CSE 430 Operating System (Fall 2011)

Lecture T, TH 6:00 P.M. - 7:15 P.M. BYAC 150
Instructor Georgios Varsamopoulos
Office BY514
Email Georgios.Varsamopoulos@asu.edu
Office Hours M,T,W,Th 1:00-2:00pm
TA Priyanka Bagade(pbagade@asu.edu)
Office BY517BA , Office Hours: W,F 9:30-10:30am


CONTENTS

ANNOUNCEMENT

  • A student must check this web page regularly.

COURSE DESCRIPTION

Goal and Topics
Operating system sturcture and services, processor scheduling, concurrent processes, synchronization techniques, memory management, virtual memory, input/output, storage management, and file system.

Syllabus
This is the syllabus for the course of this semester. It is same as the one uploaded in the BlackBoard.

Grading
The following grading rubric will be used to evaluate all the submitted material and performance tasks:


A+ 97%-100%
A 94%-96%
A- 90%-93%
B+ 87%-89%
B 84%-86%
B- 80%-83%
C+ 76%-79%
C 70%-75%
D 60%-69%
E <60%
The final letter grade will be assigned based on weighted average of the grades obtained in the following categories:

Homeworks will be given the grade using this Rubric.
Assignment 20%
Project, Exam(highest) 25%
Quizes 10%
Midterms 20% each
In-class participation 5%
Notice: the above description is not finalized and subject to change. Student should check back this page on a regular basis.


ASSIGNMENTS

Assignment Points Date Assigned Due Date Files
Homework Assignments



Homework #1
Aug. 18th 2011 Aug. 25th 2011 PDF
Quiz



Project



Mid-term 1
Mid-term 2
Final exam



LECTURE NOTES

-->
Week Class # Date Topics Materials
1 1 08/18 - Introduction to the Course & Introduction to Operating Systems - Chapter 1
- Slides
- Basic writing advice
2 2 08/23 - History of Operating Systems
- Overview of Operating System structure and architecture
- Chapter 2
- Slides
3 08/25 - Processes and their memory layout
- System Calls
- Creation and life cycle of processes
- Sections 3.1—3.3
- Slides
3 4 08/30 - Process Creation
- Inter-process communication(IPC)
- Sections 3.3—3.6
- Slides
- pipes_original.c
- pipes_read_only.c
- pipes_write_only.c
5 09/01 - Introduction to threads - Chapter 4.1—4.2
- Slides
- pthread_example.c
- pthread_example_2.c
4 6
09/06
- Threads
- Chapter 4.3—4.5
- Slides
7
09/08 Types of schedulers, metrics, Gantt chart - Slides
5 8
09/13   -
9
09/13
6 10
09/20 - Scheduling cont'd
- Slide
11
09/29 - Process Synchronization - Chapter 6.4—6.5
- Slide
7 12
10/04 - Midterm review

13
10/06
MIDTERM

8 14
10/11
Midterm solutions

15
10/14 Probability review

9 16
10/17

17
10/20
- (Chapter 7) Deadlocks and the conditions for their occurence - Slides
10 18
10/25
19
10/27

11 20
11/01

21
11/03
12 24
25
13 26
27
14 28
29
15 30
31
16 32
33




REFERENCE

  • Operating System Concepts by A. Silberschatz, P. B. Galvin and G. Gagne


RESOURCES

POLICY ON CHEATING

Any incidence of cheating in this class will be severely dealt with. This applies to homework assignments, programming assignments, quizzes and tests. The minimum penalty for cheating will be that the student will not obtain any credit for that particular assignment. (This means that if in a test and/or assignment a student is found have cheated, he/she will obtain zero in that test and/or assignment.) For the homework and the programming assignments students may discuss the problems with others, but one is expected to turn in the results of one's own effort (not the results of a friend's efforts). One tends to get very suspicious if two identically wrong results show up in the homework assignment and/or tests. The names of the offenders will be maintained in the departmental files. The repeat offenders may be debarred from the University.









Home | Projects | People | Publications | Courses | Resources | Contact