{"id":22,"date":"2025-06-04T14:11:24","date_gmt":"2025-06-04T20:11:24","guid":{"rendered":"https:\/\/courses.cs.colostate.edu\/cs003\/?page_id=22"},"modified":"2026-04-01T21:08:35","modified_gmt":"2026-04-02T03:08:35","slug":"syllabus","status":"publish","type":"page","link":"https:\/\/courses.cs.colostate.edu\/cs370\/syllabus\/","title":{"rendered":"Syllabus"},"content":{"rendered":"

<\/p>\n

Prerequisites<\/strong>: CS200 with a C [2.0] or better, CS270 with a C [2.0] or better.<\/p>\n\n\n\n
Required Texts<\/strong><\/td>\nProfessor<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n

Avi Silberschatz, Peter Galvin, Greg Gagne.
\n Operating Systems Concepts<\/em>, 10th edition
\n Publisher – John Wiley & Sons, Inc.
\n ISBN-13: 978-1119800361.<\/p>\n<\/td>\n

 <\/td>\nLouis-Noel Pouchet<\/strong><\/a>
\n Office Hours: On request
\nE-mail: compsci_cs370@mail.colostate.edu<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

Additional Useful References
\n (1) <\/strong>Andrew S Tanenbaum and Herbert Bos. Modern Operating Systems<\/em>. 4th Edition, 2014. Prentice Hall.
\nISBN: 013359162X\/978-0133591620. [AT]<\/span>
\n(2)<\/strong> Thomas Anderson and Michael Dahlin. Operating Systems: Principles and Practice<\/em>, 2nd Edition.
\nRecursive Books. ISBN: 0985673524\/978-0985673529. [AD]<\/span>
\n(3)<\/strong> Kay Robbins & Steve Robbins. Unix Systems Programming<\/em>, 2nd edition, Prentice Hall
\nISBN-13: 978-0-13-042411-2. [RR]<\/span>
\n(4)<\/strong> C Programming Language<\/em> (2nd Edition). Brian W. Kernighan and Dennis M. Ritchie.
\nPrentice Hall. ISBN: 0131103628\/978-0131103627
\n(5)<\/strong> Concurrent Programming in Java(TM): Design Principles and Pattern<\/em> (2nd Edition).
\nDoug Lea. Prentice Hall. ISBN: 0201310090\/978-0201310092. <\/p>\n

List of Topics<\/strong><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
 <\/td>\nIntroduction to Operating Systems<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • History of Operating Systems<\/li>\n
  • The OS as a resource manager<\/li>\n
  • Key principles underpinning OS design<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nProcesses<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Processes and multitasking<\/li>\n
  • Operations on processes<\/li>\n
  • Context switches<\/li>\n
  • Process lifecycle and transitions, Shells and Daemons<\/li>\n
  • POSIX <\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nInter Process Communications<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Shared memory<\/li>\n
  • Pipes<\/li>\n
  • Messages<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nThreads<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Thread models<\/li>\n
  • Differences between processes and threads<\/li>\n
  • User and Kernel threads<\/li>\n
  • Multithreading models<\/li>\n
  • Threading issues: system calls, cancellation and signal handling<\/li>\n
  • Support for threading in different operating systems<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nCPU Scheduling<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Scheduling criteria including fairness and time quanta<\/li>\n
  • Pre-emptive and non-preemptive scheduling<\/li>\n
  • Scheduling algorithms: FCFS, shortest jobs, priority, round-robin, multilevel queues<\/li>\n
  • Evaluating the effectiveness of scheduling algorithms and criteria<\/li>\n
  • Scheduling on multiprocessors<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nProcess Synchronization<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Critical Section Problem<\/li>\n
  • Peterson’s solution<\/li>\n
  • Synchronization hardware and Instruction Set Architecture support<\/li>\n
  • Semaphores<\/li>\n
  • Classical problems of Synchronization: <\/li>\n
      \n
    • Bounded buffers, Readers-Writers, Dining Philosophers<\/li>\n<\/ul>\n
    • Monitors<\/li>\n
    • Synchronization constructs<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nAtomic Transactions<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Atomic Transactions and Serializability<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nDeadlocks<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • The model for deadlocks<\/li>\n
  • Deadlock Characterization<\/li>\n
  • Methods for handling deadlocks<\/li>\n
  • Deadlock Prevention<\/li>\n
  • Deadlock Avoidance<\/li>\n
  • Recovery from Deadlocks<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nMemory Management<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Address binding<\/li>\n
  • Address spaces<\/li>\n
  • Swapping of Processes<\/li>\n
  • Contiguous Memory allocation<\/li>\n
  • Paging<\/li>\n
  • Shared Pages<\/li>\n
  • Structure of Page Tables<\/li>\n
  • Hardware support for paging<\/li>\n
  • Memory protection in paged environments<\/li>\n
  • Segmentation<\/li>\n
  • Use of Segmentation and Paging<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nVirtual Memory
\n <\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Demand Paging<\/li>\n
  • Copy-on-Write<\/li>\n
  • Page Replacement<\/li>\n
  • Belady’s anomaly and stack algorithms<\/li>\n
  • Allocation of Frames<\/li>\n
  • Thrashing and working sets<\/li>\n
  • Memory-mapped files<\/li>\n
  • Allocation of Kernel Memory<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nVirtualization<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n
    \n
  • Virtual Machine Monitors <\/li>\n
  • Type-1 hypervisor <\/li>\n
  • Type-2 hypervisor<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n
 <\/td>\nFile Systems<\/strong><\/td>\n<\/tr>\n
 <\/td>\n\n