CS 385 (Fall '02)
[Schedule]
[Examples] [Programs]
[Notes & Reference] [Syllabus]
[Lab & TA] [Tests]
[Grades]
The schedule shown below will likely change. Under the homework list, a listing of the form "3.5 - 3.9" means do all the problems from 3.5 up to and including 3.9.
| Week | Topic |
Ch. in Text |
Homework, Programs
|
|
|
1
|
8/26
|
Intro. |
1
|
1.1-1.7, 1.12 |
|
2
|
9/2
|
Computer & O.S. Structures |
2,3
|
2.3, 2.4, 2.5, 2.7, 2.9, 2.12; 3.1-3.4, 3.7, 3.13, 3.15 |
|
3
|
9/9
|
Processes |
4
|
4.3, 4.6 |
|
4
|
9/16
|
Threads |
5
|
5.6 |
|
5
|
9/23
|
CPU Scheduling |
6
|
6.3d, 6.4a & b, 6.5, 6.6, 6.7 |
|
6
|
9/30
|
Process Synchronization |
7
|
7.8, 7.9 |
|
7
|
10/7
|
Deadlocks |
8
|
|
|
8
|
10/14
|
Memory Management |
9
|
9.5, 9.8, 9.10 |
|
9
|
10/21
|
Virtual Memory |
10
|
10.5, 10.11, 10.17 |
|
10
|
10/28
|
File systems |
11,12
|
|
|
11
|
11/4
|
Midterm #2 on 11/4/02 | ||
|
12
|
11/11
|
I/O Systems, Mass Storage |
13,14
|
|
|
13
|
11/18
|
Distributed Systems Structure |
15
|
|
|
14
|
11/25
|
Distributed File System, Coordination |
16,17
|
|
|
15
|
12/2
|
Protection, Security |
18,19
|
|
| Final Exam Thursday, 12/12 10:30 - 12:30, LC F1 (our usual classroom) |
[CS Dept] [UIC]
[Prof. Reed]