Operating Systems
CSCI-GA.2250-001, Fall 2013



Important Notices:



General Information

Lecture:
Mon 7:10P - 9:00P Weaver CIWW 102
Instructor: Hubertus Franke, frankeh@cs.nyu.edu
TAs/Graders: Lastname: A-M: Kanwarpreet Singh Randhawa ksr287@nyu.edu
Lastname: N-Z: Bohou Li bohou.li@nyu.edu
Office Hours:
Franke: Mon 6:00 - 6:45 CIWW Rm 328 or 320 (look in both) and after class
Kanwarpreet: Tue 2:00 - 3:00 CIWW 13th Floor
Bohou: Th 5:00 - 600 CIWW 13th Floor
Prerequisites: Common CS knowledge and some programming skills.
Text book: Author: Andrew Tannenbaum
Title: Modern Operating Systems
Edition: 3rd
Publisher: Prentice Hall
ISBN-13: 978-0-13-6006663-2
ISBN-10: 0-13-600663-9

Course Description

This course is an introductory course in operating systems (OS), focusing on the core concepts of operating systems. The emphasis will be on understanding general concepts that are applicable to a wide range of operating systems, rather than a discussion of the features of any one specific system. Topics that will be covered include:

Examples will be from Unix/Linux. Programming assignments will be based on C or C++ as Operatings Systems are implemented that way.

This course does not assume that you have taken an Operating Systems course as an undergraduate, or that you have had extensive experience working with one. In fact, if you have taken such a course or have a fair amount of practical experience with OS internals, this course is probably too elementary for you. Please take a look at the course schedule to get a sense of the topics that will be covered: if you can explain most of the terms contained there, you are likely looking for a more advanced course. We will NOT be "hacking" on an operating system but will have lab assignments that deal with the fundamental elements such as different process schedulers and memory management algorithms.

Textbook

Author: Andrew Tannenbaum
Title: Modern Operating Systems
Edition: 3rd
Publisher: Prentice Hall
ISBN-13: 978-0-13-6006663-2
ISBN-10: 0-13-600663-9

Computer Accounts and Mailman Mailing List

Several labs (programming assignments) across the semester will provide practical implementations of operating system concepts such as processor scheduling and memory management. These assignments are accepted in C or C++.

homeworks and Labs

I make a distinction between homeworks and labs. Both are required and form part of your grade.

Labs (aka programming assignments) are

Homeworks are optional

Doing Labs on non-NYU Systems

You may solve lab assignments on any system you wish, but ...

Obtaining Help with the Labs

Good methods for obtaining help include

  1. Asking me during office hours (see web page for my hours).
  2. Asking the mailing list.
  3. Asking another student, but ...
    Your lab must be your own.
    That is, each student must submit a unique lab. Naturally, simply changing comments, variable names, etc. does not produce a unique lab.

Grades

Grades are based on the labs, the midterm and final exam, each being important. The weighting will be:
Homeworks0% (optional)
Lab Assignments55%
MidTerm15%
Final30%
This is a graduate level class, so I am looking for lively interactions during the class and not just presence.
The midterm will be given on 11/04/2013.
The final will be given on 12/16/2013.


Class Materials, Handouts, Lectures and Assignments

LecturesDateTopicHandouts ReadingsAssignments
1
09/09
Introduction: Computer System Architectures (what does the OS manage)
Lecture-1 Chapter 1
lab1 (Due 9/23)
2
09/16
Processes and Threads
Lecture-2 Chapter 2.1 2.2
Homework:
Chapter-1: 7,9,10,25,28
Chapter-2:10,11,12
3
09/23
Processes and Threads
Lecture-3 Chapter 2.4
lab2 (Due 10/15)
4
09/30
Synchronization
Lecture-4 Chapter 2.3 2.5 2.6
Homework:
Chapter-2: 13,19,23,31,37
5
10/07
Memory Management 1
Lecture-5


10/14
NO CLASS Fall Break



6
10/21
Memory Management 2
Lecture-6 Chapter 3.1-3.5
lab3 (Due 11/11)
7
10/28
MIDTERM



8
11/04
Memory Management 3
Lecture-7 Chapter 3.6-3.7
Homework:
Chapter-3: 9, 10, 11, 28, 37
9
11/11
I/O Basics
Lecture-8 Chapter 5
lab4 (Due 12/09)
10
11/18
I/O Disk Scheduling
Lecture-9 Chapter 5

11
11/25
FileSystems 1&2
Lecture-10
Lecture-10a
Chapter 4

12
12/02
Networking
Lecture-12


13
12/09
Advanced Topics
Lecture-13


14
12/16
FINAL EXAM




Grade/Point Distribution through Midterm

A : [92-100]
A-: [90-92)
B : [82-88)
B-: [80-82)
C+: [78-80)
C : [72-78)
C-: [70-72)
F: < 70
Note that this is for you to gauge where you are. the TAs will send out the individual points to each of you. Formula used was that through midterm we accounted for 41% of the grade. Midterm = 15%, and Lab1=0.1157% and Lab2=0.1447%. The midterm exam was scored with 33pts (top score) as a 100.


See also


See also

Graduate cs.nyu.edu courses: http://cs.nyu.edu/webapps/fall2013/courses
Graduate cs.nyu.edu schedule: http://cs.nyu.edu/webapps/fall2013/Graduate/courses
Academic integrity policy: http://cs.nyu.edu/web/Academic/Graduate/academic_integrity.html

http://cs.nyu.edu/courses/fall13/CSCI-GA.2250-001/index.html