Teaching » CS 307 Operating Systems

GENERAL INFORMATION

Instructor: Yücel Saygin
Office: FENS 2081
E-mail: ysaygin [at] sabanciuniv.edu
Tel: 9576
Web: http://people.sabanciuniv.edu/ysaygin/
 
Assistants: Grad: Mert Kemal Erpam. UG: Yagiz Nizipli
Instructor Office Hours: Mondays and Wedensdays before/after class
 
Text Book: Modern Operating systems, 3rd edition
Author: Andrew S. Tanenbaum
Publisher: PEARSON, Prentice Hall

ANNOUNCEMENTS
  • Your projects will be announced in sucourse.
EXAMS

There will be two midterm exams, two HW Exams, and NO final exam.

LECTURE NOTES
  • Course Introduction
  • Introduction to Computer Systems
  • Processes and Threads
  • Interprocess Communication
  • Scheduling
  • Memory Management
  • Deadlocks
  • File Systems
  • Security
  • I/O
GRADING
  • Midterms: 30+40 = 70% (No Makeup for the first midterm. If you miss the first midterm, your second midterm will be 70%. A friendly suggestion: TRY NOT TO MISS THE FIRST MIDTERM :-)
  • HW Exams: 10% (During recitations, TBA)
  • Projects: 15%
  • ALS: 5% (You will have 8-10, I will select 5, so if you attend at least 5 of them, you will have 5%. If you attend more than 5, this will be a nice reference for you)
  • Total 100%
SOME USEFUL LINKS SYLLABUS

In this course we will cover operating system concepts and design principles with the following schedule (subject to minor changes in content and schedule each year):

Week 1 (Sept 27 : Oct 1)
  • Introduction to operating systems
Week 2 (Oct 4 : Oct 8 )
  • Computer hardware review
  • Review of basic operating system concepts
Week 3 (Oct 11 : 15)
  • Processes and threads : process and thread models, management, and implementation
  • Interporcess Communication: race conditions, critical regions, mutual exclusion
Week 4 (Oct 18 : Oct 22)
  • Interprocess communication: sleep and wakeup, semaphores, mutexes, monitors, message passing, and barriers.
Week 5 (Oct 25 : Oct 29)
  • Classical interprocess communication problems: The dining philosophers problem, readers and writers problem, the sleeping barber problem.
Week 6 (Nov 2: Nov 6)
  • Scheduling: batch, interactive, and real-time.
  • Midterm
Week 7 (Nov 8 : 12)
  • Scheduling contd.
Week 8 (Nov 15 : 19)
  • Deadlock Detection, recovery, and avoidance
Week 9 (Nov 22 : Nov 26 )
  • Memory management : basics, swapping, virtual memory
Week 10 (Nov 29 : Dec 3 )
  • Page replacement algorithms Design and implementation issues of paging systems, segmentation
Week 11 (Dec 6 : Dec 10)
  • Segmentation with paging
Week 12 (Dec 13 : Dec 17)
  • Files directories and file system implementation.
Week 13 (Dec 20 : Dec 24 )
  • Security issues: cryptography, autthentication, attacks, and protection mechanisms, trusted systems
Week 14 (Dec 21 : Dec 25)
  • UNIX, LINUX, and WINDOS 2000 Operating Systems
Week 15 (Dec 28 : Jan 1)
  • Review
Week 16 (Jan 4 : Jan 8)
  • Panel + Wrap-up