Operating Systems (CS240)

• The handouts are ordered by sequence numbers and the material covered in the lectures are indicated next to the date. Specifically, the numbers in parentheses indicate the slides covered during class, i.e., [a/b-c/d] indicates that the material covered is from sequence a (slide b) to sequence c (to slide d).
• If there are any problems with accessing the handouts, please let me know (email, phone, smoke signs, drums, ...)!
• Corrections: some slides may contain formatting errors, typos etc. which have been addressed in class, but have not been reflected in the notes posted here.
• WARNING LOCAL STUDENTS: Do not send pdf files (i.e. files in pdf format) to the printer! Pdf files are binary files and printing them "directly" will result in a big printer mess!!! Use a pdf reader to view and print the file!!!
• Syllabus
• Lecture Notes
  • Lecture 1 (08/24/09): [1/01-1/16] Sequence 1, (pdf), : Introduction, Processors, Instruction and program execution, DMA, Interrupts, Multiprogramming, Memory hierarchy
  • Lecture 2 (08/26/09): [1/17-1/25] Sequence 2, (pdf), : OS objectives, OS services, Kernel, Linux
  • Lecture 3 (08/28/09): [1/26-1/45] Sequence 3, (pdf), : Evolution of OSs, JCL, I/O Devices - Speedup, uniprogramming, multiprogramming, time sharing, major achievements in OSs
  • Lecture 4 (08/321/09): [1/46-2/04] no new handouts
  • Lecture 5 (09/02/09): [2/05-3/08] Sequence 4, (pdf), : Microkernel, multithreading, SMP, Overview: Microsoft Windows Architecture, Unix Architecture
  • Lecture 6 (09/04/09): [3/09-3/21] Sequence 5, (pdf), : Processes, process execution states
  • Lecture 7 (09/09/09): [3/22-4/02] no new handouts
  • Lecture 8 (09/11/09): [4/03-4/21] Assignment 1
  • Lecture 9 (09/14/09): [5/01-5/19] Sequence 6, (pdf), : Processes cont., linux and OS x monitoring utilities
  • Lecture 10 (09/16/09): [5/20-6/06] Processes cont.
  • Lecture 11 (09/18/09): [6/07-6/20] Sequence 7, (pdf), : Process creation in unix, fork()
  • Lecture 12 (09/21/09): [6/21-7/02] Sequence 8, (pdf), : Threads, singel and multithreaded process model,
  • Lecture 13 (09/23/09): [7/03-7/05] (Research Talk) : Research applications: Processes and Threads in GRID application Process creation in unix, fork(), Assignment 2 discussion. Don't miss this class as you will need the information in this discussion!!!
  • Lecture 14 (09/25/09): [7/06-8/12] Sequence 9, (pdf), : User and kernel level threads
  • Lecture 15 (09/28/09): [9/01-9/07] discussion on tripwire shell, no new handouts
  • Lecture 16 (09/30/09): [9/10-9/18] Sequence 10, (pdf), : System Taxonomies, Flynn's Taxonomy
  • EXAM 1 (10/02/09): closed book/notes/etc., material covered up to (and including) Sequence 8
  • Lecture 17 (10/05/09): [10/01-10/10] Sequence 11, (pdf), : SMP, Microkernal Architecture and design, Windows and Solaris processes, Windows, Solaris and Linux process management
  • Lecture 18 (10/07/09): [10/11-11/14] Sequence 12, (pdf), : Concurrency, Mutual exclusion Discussions on shell assignment.
  • Lecture 19 (10/09/09): [12/01-12/12] Sequence 13, (pdf), : Lamport's Algorithms, Peterson's Algorithm
  • Lecture 20 (10/12/09): [12/13-13/03] Mutual exclusion cont.
  • Lecture 21 (10/14/09): [13/04-14/03] Sequence 14, (pdf), : Producer/Consumer problem using semaphores, Assignment 3 is out.
  • Lecture 22 (10/16/09): [14/04-14/10] Sequence 15, (pdf), : Monitors
  • Lecture 23 (10/19/09): [14/11-15/09] Sequence 16, (pdf), : message passing, reader/writer problem solutions, deadlock
  • Lecture 24 (10/21/09): [15/10-15/19] Sequence 17, (pdf), : Discussion of shell assignment, Deadlock avoidance, Banker's Algorithm
  • Lecture 25 (10/23/09): [15/20-16/06] catching up
  • Lecture 26 (10/26/09): [16/07-17/11] Sequence 18 (pdf), : Deadlock detection, Dining Philosopher Problem,
  • Lecture 27 (10/28/09): [17/12-18/06] Sequence 19 (pdf), : Memory management, fixed and dynamic partitioning
  • Lecture 28 (10/30/09): [18/07-18/15] Assignment 4 (with short deadline) and Assignment 5 are posted. Sequence 20 (pdf), : Paging, Frames and Segmentation
  • Lecture 29 (11/02/09): [18/16-19/18] Sequence 21 (pdf), : Virtual Memory
  • Lecture 30 (11/04/09): [19/16-20/05] Sequence 22 (pdf), : Page tables, TLB
  • Lecture 31 (11/06/09): [20/06-21/05] Sequence 23 (pdf), : Segmentation tables, Fetch and Replacement Policies
  • Lecture 32 (11/09/09): [21/06-22/10] catching up
  • Lecture 33 (11/11/09): [22/11-23/07] Sequence 24 (pdf), : Page replacement algorithms
  • Lecture 34 (11/13/09): [23/08-23/20] Sequence 25 (pdf), : Scheduling
  • Lecture 35 (11/16/09): [24/01-25/02] catching up
  • Lecture 36 (11/18/09): [25/03-2x/xx] Sequence 26 (pdf), : Scheduling algorithms
  • EXAM 2 (11/20/09): closed book/notes/etc., material covered up to (and including) Sequence 24

• Expectations: Homeworks/Assignments/Project reports are expected to look professional! Depending on the type of writeup, e.g. if mathematical derivations are included, they do not have to be typed in order to look good, but be aware that I will not accept scribbles etc. Use a new page for each problem and staple the final submission.
• Assignment 0 (pdf)
• Assignment 1 (pdf)
• Assignment 2 (pdf)
• Assignment 3 (pdf)
• Assignment 4 (pdf)
• Assignment 5 (pdf)
• Assignment 6 (pdf)

• Note that some of the material covered in an old exam might not overlap with the material covered this term.
• Exam 1 (07),
• Exam 2 (07),
• Exam 3 (07),

Back