M | Tuesday | W | Thursday | F |
---|---|---|---|---|
3
|
4
Before Class:
C-style Strings Dynamic Memory Allocation in C (8:28) Switch Statements Do-while Loops For Loops Class: C: C-style Strings C: Command-line arguments C: Libraries C: Memory Allocation (example) C Exercises Class notes |
5
|
6
Before Class:
Quiz: C-Style Strings and Command-line arguments and Libraries and Memory Allocation Section 4 (5 pages) Sections 16.1 - 16.3 (pages 109 - 143) 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:
Quiz: Control Structures and Structs and Functions Preface (4 pages) Chapter 1 Dialogue (2 pages) Chapter 2 Introduction (18 pages) Quiz: Chapter 2 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:
Quiz: File I/O Chapter 3 Dialogue (2 pages) Chapter 4 Processes (12 pages) Quiz: Chapter 4 Class: Processes Process creation Process state (exercises) Class notes |
Deadline to Withdraw with WP
14
|
17
|
18
Before Class:
Chapter 5 Process API (11 pages) Quiz: Chapter 5 Class: Process API: fork(), exec(), and wait() UNIX Shell Command Line (Unix Commands) Due: Project 1 |
19
|
20
Before Class:
Chapter 6 Direct Execution (14 pages) Chapter 7 CPU Scheduling (12 pages) Quiz: Chapter 6 Quiz: Chapter 7 Class: UNIX Shell Command Line (Unix Commands) Direct execution User & kernel modes Context switches Class Notes |
21
|
24
|
25
Before Class:
Chapter 8 Multi-level Feedback (12 pages) Chapter 9 Lottery Scheduling (10 pages) (9.0 - 9.1, skim the rest) Chapter 11 Summary (2 pages) Quiz: UNIX commands Quiz: Chapters 8 & 9 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:
Chapter 12 Dialogue (ignore the rude professor's remarks) (2 pages) Chapter 13 Address Spaces (9 pages) Quiz: Chapter 13 Class: Address spaces Exam #1 Game Review (topics) |
28
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
Before Class:
Chapter 14 Memory API (11 pages) Quiz: Chapter 14 Class: Memory allocation (malloc(), free()) Types of memory: stack and heap Exam 1 (in CCT 409) (topics) |
3
|
4
Before Class:
Chapter 15 Address Translation (14 pages) Chapter 16 Segmentation (12 pages) Quiz: Chapters 15 & 16 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:
Chapter 17 Free Space Management (17 pages) Quiz: Chapter 17 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:
Chapter 18 Introduction to Paging (14 pages) Sections 19.0 & 19.8 (1 1/2 pages) Sections 20.0 & 20.6 (1 page) Chapter 21 Beyond Physical Memory: Mechanisms (11 pages) Quiz: Chapter 18 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:
Chapter 22 Swapping: Policies (18 pages) Chapter 24 Summary (3 pages) Quiz: Chapter 22 Class: Translation-lookaside Buffers (TLBs) Swap space Page-faults Page-replacement policies (e.g., Optimal, FIFO, Random, LRU, Clock) (exercises) |
24
|
25
Before Class:
Chapter 25 Dialogue (2 pages) Chapter 26 Concurrency and Threads (16 pages) Quiz: Chapter 26 Class: Critical section Race condition Indeterminate programs Mutual exclusion Due: Project 2 |
26
|
29
|
30
Before Class:
Chapter 27 Thread API (12 pages) Quiz: Chapter 27 Sections 28.0 - 28.8 and 28.12 - 28.17 (20 pages) 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:
Chapter 30 Condition Variables (17 pages) Class: Condition variables (Producer/consumer problem) Exam2 In CCT 407 (topics) |
7
|
8
|
9
|
12
|
13
Before Class:
Chapter 32 Common Concurrency Problems (17 pages) Chapter 34 Summary (2 pages) Class: Dining philosophers problem Readers-Writers Lock Non-deadlock currency bugs Deadlock Conditions for deadlock Deadlock prevention Deadlock Avoidance |
14
|
15
Before Class:
Chapter 35 Dialogue (2 pages) Chapter 36 I/O Devices (13 pages) 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:
Chapter 37 Hard Disk Drives (17 pages) (skim 37.5) Chapter 38 Redundant Disk Arrays (RAIDs) (19 pages) (Intro, summary and know what each level does and is good for) Class: Hard disk drives Hard disk drives' physical structure I/O Timing Disk Scheduling Redundant array of inexpensive disks (RAIDs) |
28
|
29
Before Class:
Chapter 39 Files and Directories (19 pages) Class: Files Creating files Reading and writing files Removing files Directories Due: Project 3 - Thread Synchronization |
30
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
3
|
4
Before Class:
Chapter 40 File System Implementation (18 pages) Sections 44.0 & 44.11 Flash-based SSDs (2 pages) Chapter 46 Summary (2 pages) 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
|