CS 3305: Operating Systems (Spring 2013)
AnnouncementsApril 15: Exam Information
April 10: Office hours for April 10th: 1:30-2:30
- Old exam
- Time and Room: Tuesday, April 23, 7:00 PM, UCC 37
- Closed-book; one cheat sheet allowed (handwritten)
April 7: Office Hours for Assignment 4
April 8: 3:30-4:30
April 9: 1:30-3:00
April 10: 1:30-3:00
April 7: Another update of FAQ
April 7: FAQ have been updated
April 6: Notes on File systems are up
March 29: Assignment 4 is up
March 24: Lecture notes on mass storage and file systems are up
March 18: Office Hours for Assignment 3
March 19: 1:30-3:00
March 20: 11:30-12:30
March 21: 1:00-3:00
March 22: 1:30-3:30
March 17: New Lectures notes on program structure and page design/implementation are up.
March 17: Assignment 3 FAQ Update
March 12: Slides on pthreads/semaphores for assignment 3 are in the Assignments section
March 6: Assignment 3 is posted
March 5: Assignment 1 avg is 79
March 5: Midterm avg is 67
March 5: Look at Assignments for test cases for Assignment 1
March 2: Lectures notes on basic memory management and paging are up
Feb 26: Midterm answers are here.
There was a typo in the answer key for the first part of question 19.
Please check your exam to see if a correction is in order.
Feb 26: Check out assignment page for more examples of inputs and outputs
Feb 26: Check out assignment page for more FAQ
Feb 25: H. Lutfiyya's office hours for this week
Feb 24: Lectures notes on mutual exclusion and classical synchronization problems are up
- Feb 25: 2:30-4:00
- Feb 26: 1:30-3:00
- Feb 27: 2:30-4:00
- Feb 28: 3:00-4:30
- March 1: 1:30-4:00
Feb 24: Midterm marks are up
Feb 22: Assignment 2 due date as stated in the course outline is March 1st.
Feb 20: Assignment 2
Feb 16: Assignment 2 is up
- Please read the FAQ; I have slightly modified the assignment writeup to clarify things that are reflected in the FAQ.
- Sample input and outputs are available.
Feb 11: Office Hours for Monday: 2:30 to 5.
Feb 8: The
due date of assignment 1 is now Monday, Feb 11, 2013. This means that
late penalties will start to apply after Monday. For those of you
who have finished or will finish today bonus marks will be assigned.
Feb 6: You may submit your assignment using OWL.
Feb 6: FAQ updated
Feb 5: Midterm information
Feb 5: New FAQ up for assignment 1
- Material covered: Everything from start of course until pthreads
- An 8x11.5 cheat sheet is allowed; Everything on the cheat sheet must be handwritten
- Sample Midterm can be found here
Feb 4: Office Hours (N. Bayat) -- MC 4A
Feb 4: Office Hours (H. Lutfiyya) -- All in MC 355
Feb 2: New notes are up related to system calls for process management, mult-processor scheduling and threads
- Monday: 2-4
- Tuesday: 1:30-3; 3:30-4:30
- Thursday: 1:00 to 3:30
- Friday: 1:30-4:00
January 31: H. Lutfiyya will be available for consulting on February 1st from 1:30-4 (Except from 2-2:30).
January 27: Notes on case studies posted
January 19: Notes on multiprogramming and CPU scheduling are posted
January 16: Assignment 1 is up; Additional lecture notes on shell can also be found
January 12: System call notes are up; Sample code can be found in the Lectures section
January 7: Course Description
January 7: Use Twitter with username CS3305 to receive course updates
January 7: First Day of Classes
Meeting Times and Location: Monday: 11:30-12:30, SEB1059; Tuesday: SEB 1059
Prequisites: CS 2212, CS 2208 or CS 2210, 2211, ECE 3375 and registration in the fourth year of the BESC program in Computer Engineering.
Description: This course is
about the design and implementation of operating systems. Topics
include basic operating system structure, process synchronization, interprocess communication, process
scheduling, memory management, virtual memory, device management, I/O,
file systems, virtualization and "hot topics".
InstructorInstructor: Professor Hanan Lutfiyya
Phone: 519-679-5184 (86888)
Email: hanan at csd dot uwo
Office Hours: By Appointment or
Operating System Concepts (Eighth Edition)
A. Silberschatz, P. Galvin, and G. Gagne
John Wiley & Sons. INC, 2012; ISBN: 978--1-118-11273-1
You can buy from the University bookstore or Amazon.