M | Tuesday | W | Thursday | F |
---|---|---|---|---|
3
|
4
Before Class:
![]() ![]() ![]() ![]() ![]() Class: C: C-style Strings C: Command-line arguments C: Libraries C: Memory Allocation (example) C Exercises Class notes |
5
|
6
Before Class:
![]() ![]() Class: C: Memory Allocation (example) C: Control Structures C: Structured Data Objects C: Functions C: File I/O C Exercises Class notes |
7
|
10
|
11
Before Class:
Class: C: File I/O C Class notes Overview of virtualization, concurrency, persistence and history of OSs Class notes |
12
|
Fall Student Appreciation (12:30 PM, CCT lobby)
13
Before Class:
Class: Processes Process creation Process state (exercises) Class notes |
Deadline to Withdraw with WP
14
|
17
|
18
Before Class:
Class: Process API: fork(), exec(), and wait() UNIX Shell Command Line (Unix Commands) Due: |
19
|
20
Before Class:
Class: UNIX Shell Command Line (Unix Commands) Direct execution User & kernel modes Context switches Class Notes |
21
|
24
|
25
Before Class:
Class: CPU scheduling Turnaround time Response time Scheduling algorithms: FIFO, shortest job first, shortest time-to-completion first, round robin CPU scheduling using a multi-level feedback queue Lottery scheduling |
26
|
27
Before Class:
Class: Address spaces Exam #1 Game Review (topics) |
28
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
Before Class:
Class: Memory allocation (malloc(), free()) Types of memory: stack and heap Exam 1 (in CCT 409) (topics) |
3
|
4
Before Class:
Class: Address translation (virtual and physical addresses) Base and bounds address translation Segmentation (exercises) (translation code) Free List management algorithms |
5
|
8
|
Job & Internship Fair 11 AM - 2 PM
9
Before Class:
Class: Free List management algorithms Free Space Management (exercises) External fragmentation Internal fragmentation Free space management strategies |
10
|
University Closed
11
|
12
|
15
|
Fall Break
16
|
17
|
18
Before Class:
Class: Free Space Management (exercises) Free space management strategies Paging Virtual page number (VPN) and offset Physical frame number Class Notes |
19
|
22
|
23
Before Class:
Class: Translation-lookaside Buffers (TLBs) Swap space Page-faults Page-replacement policies (e.g., Optimal, FIFO, Random, LRU, Clock) (exercises) |
24
|
25
Before Class:
Class: Critical section Race condition Indeterminate programs Mutual exclusion Due: |
26
|
29
|
30
Before Class:
Class: Threads Thread creation Thread completion Locks Condition variables Locks Pthread locks Spin-wait Test-and-set instructions Spin locks |
31
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
|
|||
5
|
6
Before Class:
Class: Condition variables (Producer/consumer problem) Exam2 In CCT 407 (topics) |
7
|
8
|
9
|
12
|
13
Before Class:
Class: Dining philosophers problem Readers-Writers Lock Non-deadlock currency bugs Deadlock Conditions for deadlock Deadlock prevention Deadlock Avoidance |
14
|
15
Before Class:
Class: Deadlock prevention Deadlock Avoidance I/O devices CPU-guided data movement Interrupts Interrupt service routines / interrupt handlers Direct memory access data movement |
16
|
19
|
Thanksgiving Week
20
|
21
|
Thanksgiving Day
22
|
23
|
26
|
27
Before Class:
Class: Hard disk drives Hard disk drives' physical structure I/O Timing Disk Scheduling Redundant array of inexpensive disks (RAIDs) |
28
|
29
Before Class:
Class: Files Creating files Reading and writing files Removing files Directories Due: |
30
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
3
|
4
Before Class:
Class: Making directories Reading directories Deleting directories Hard & symbolic links Mounting a file system File system implementation Inodes Flash-based SSDs SSD performance Final Game Review |
5
|
6
|
7
|
10
|
11
|
12
|
13
|
14
|