Course grades now available

Prerequisites

This contains the index to all handouts and notes for ECS 150, Spring Quarter 1999.

- General Information [FM] [PDF] [PS] [TXT]
- Syllabus
- All About Homework
- All About Laboratory Assignments

- Homework #1 [FM] [PDF] [PS] [TXT], due April 15, 1999;
- Homework #2 [FM] [PDF] [PS] [TXT], due April 29, 1999;
- Homework #3 [FM] [PDF] [PS] [TXT], due May 18, 1999
- Homework #4 [FM] [PDF] [PS] [TXT], due June 8, 1999

- Laboratory #1 [FM] [PDF] [PS] [TXT], due April 20, 1999
- Laboratory #2 [FM] [PDF] [PS] [TXT], due May 4, 1999
- Laboratory #3 [FM] [PDF] [PS] [TXT], due May 27, 1999

- Logging Into the MINIX Lab
- Building the MINIX Kernel
- Submitting Code
- What To Do When Everything Else Has Gone Wrong

These are sketchy and have typos and other errors that I correct on the fly. So they are available on an "as is" basis only.

- Notes for Beginnings [PDF] [PS]
- Notes for Concurrency and Synchronization [PDF] [PS]
- Notes for Process Scheduling [PDF] [PS]
- Notes for Input/Output and Device Drivers [PDF] [PS]
- Notes for Memory Management [PDF] [PS]
- Notes for Deadlock [PDF] [PS]
- Notes for File Systems [PDF] [PS]
- Notes for Security [PDF] [PS]

- Improper Nesting Example [FM] [PDF] [PS] [TXT]
- Classical Synchronization Problems [FM] [PDF] [PS] [TXT]
- The Bakery Algorithm [FM] [PDF] [PS] [TXT]
- Test and Set Solution [FM] [PDF] [PS] [TXT]
- First Readers Writers Problem (Semaphores) [FM] [PDF] [PS] [TXT]
- Producers Consumers Problem (Semaphores) [FM] [PDF] [PS] [TXT]
- First Readers Writers Problem (Monitors) [FM] [PDF] [PS] [TXT]
- Producers Consumers Problem (Monitors) [FM] [PDF] [PS] [TXT]
- Monitors and Semaphores [FM] [PDF] [PS] [TXT]
- Monitors and Priority Waits [FM] [PDF] [PS] [TXT]
- send/receive Charts [FM] [PDF] [PS] [TXT]
- Producers Consumers Problem (send/receive) [FM] [PDF] [PS] [TXT]
- Producers Consumers Problem (ADA) [FM] [PDF] [PS] [TXT]
- Types of Schedulers [FM] [PDF] [PS] [TXT]
- Job Scheduling Algorithms [FM] [PDF] [PS] [TXT]
- The Stages of Compilation [FM] [PDF] [PS] [TXT]
- Static and Dynamic Relocation [FM] [PDF] [PS] [TXT]
- Paging and Address Translation [FM] [PDF] [PS] [TXT]
- Segmentation and Address Translation [FM] [PDF] [PS] [TXT]
- Segmentation and Paging Combined [FM] [PDF] [PS] [TXT]
- Page Replacement Algorithms [FM] [PDF] [PS] [TXT]

Send email to cs150@csif.cs.ucdavis.edu.

Department of Computer Science

University of California at Davis

Davis, CA 95616-8562