Institute / School Name
Program Name
Course Code
Course Name
Lecture / Tutorial (per week)
Course Coordinator Name
1.
Institute of Engineering & Technology
BE
CSL 4207
Operating System
3-1-0
Course Credits
Shivani Gautam
3.5
Scope and Objectives of the Course
1. Operating system course is an essential part of any computer science education. The theory component
will teach the students the concepts and principles that underlie modern operating systems, and relate
theoretical principles with operating system implementation.
2. The course aims at providing a sound conceptual foundation with emphasis on Operating system
architecture and its components.
3. The course attempts to familiarize students with the concepts of file system architecture, concurrent
programming and various issues in the management of resources like processor, memory and inputoutput.
4. At the end of this course, students should be able to understand the operations performed by Operating
System as a resource manager and various computer security issues and Operating System tools.
2.
Textbooks
TB1: ‘Operating System Concepts’ by Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Sixth
Edition, John Wiley & Sons (ASIA) Pvt. Ltd.
3.
Reference Books
RB1: ‘Modern Operating Systems’ by Andrew S. Tanenbaum, Second Edition, Prentice-Hall
RB2: ‘System Programming & Operating Systems’ by D.M. Dhamdhere, Second revised edition, Tata
McGraw Hill
RB3: ‘Operating Systems’ by W. Stallings, Fifth edition, Prentice-Hall
4.
Other readings and relevant websites
S.No.
Link of Journals, Magazines, websites and Research Papers
1. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-828-operating-systemengineering-fall-2006/
2. http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/Operating Systems/New_index1.
Html
3. http://www.ics.uci.edu/~ics143/lectures.html
4. http://www.cs.kent.edu/~farrell/osf03/oldnotes/index.html
5. http://williamstallings.com/OS/OS6e.html
Page 1 of 4
5. Course Plan
Lecture
Number
Topics
1
Introduction:
Introduction to Operating systems, Types of Operating Systems-Mainframe
systems, Desktop Systems
Types of Operating systems- Multiprocessor Systems, Distributed Systems,
Clustered Systems, Real Time Systems, Handheld Systems
System Components, Operating System Services, System Calls/API, System
Program
Process Concept:
Process Scheduling, Operations On Processes, Cooperating Processes, Interprocess Communication
2-3
4-5
6-7
8-9
10-11
12-13
14-15
16
12-20
277-312
55-74
TB1
RB2
TB1
RB2
RB3
TB1
RB2
RB3
Process Synchronization:
The Critical-Section Problem, Synchronization, Hardware, Semaphores,
TB1
RB2
Classic problems of Synchronization, Critical regions, Monitors
TB1
RB2
TB1
RB2
RB1
TB1
RB1
TB1
RB3
206-222
396-432
143-250
371-395
168-173
250-265
168-183
273-308
326-331
TB1
TB1
RB1
309-312
317-330
202-222
TB1
RB1
TB1
RB1
RB3
TB1
RB1
330-353
202-222
379-406
382-398
552-579
411-433
399-428
19-20
22-24
25-26
Deadlock Prevention, Deadlock avoidance, Deadlock detection, Recovery
From Deadlocks
Memory Management:
Swapping, Paging
ST-1
Segmentation ,Segmentation with paging
Virtual Memory, Demand Paging, Process creation,
27-28
Page Replacement Algorithms, Allocation of frames, Thrashing
30
TB1
RB2
TB1
3-12
277-312
CPU Scheduling:
Basic Concepts, Scheduling Criteria Scheduling Algorithms-, First In first Out
Scheduling Algorithms (FIFO), Shortest Job First Scheduling Algorithms (SJF).
Scheduling Algorithms- Priority Scheduling Algorithms, Round-robin
Scheduling Algorithms, Multilevel Queue Scheduling, Multilevel Feedback
Scheduling, Multiple-Processor , Scheduling Real Time Scheduling
Threads:
Overview of Threads, Multithreading Models, Threading issues, Linux
Threads
Deadlock:
System Model Deadlock Characterization, Methods for handling Deadlocks
29
Page
numbers
of Text
Book(s)
95-116
320-326,
447-453
108-140
129-138,
144-145
161-174,
195-198
151-161
343-347,
406-416
161-171
347-368
417-432,
453-481
189-206
396-432
17-18
21
Text Book /
Reference
Book /
Other
reading
material
TB1
RB2
File Concept:
Access Methods, Directory Structure, File System Mounting, File Sharing,
Protection
File System Structure, File System Implementation, Directory
implementation, Allocation Methods, Free-space Management
RB3
TB1
RB3
Page 2 of 4
31-32
Kernel I/O Subsystems, Disk Structure, Disk Scheduling, Disk Management,
Swap-Space Management
TB1
RB1
472-478,
491-504
269-324
TB1
RB1
657-671
584-650
RB1
Website
TB1
TB1
RB1
672-756
Link 5
695-737
743-847
763-849
ST-2
33-34
35
Security:
Protection, Security Problem, User Authentication Problem, Program
Threats, System Threats
OS Case study –
 UNIX


LINUX
WINDOWS
6. Tutorial plan
Tutorial
Number
1
2
3
4
5
6
7
8
9
10
11
12
Topics
Prerequisite of Operating System and different types of OS
Various types of System Calls and interrupts
Numerical based on CPU scheduling
Numerical based on CPU scheduling
Numerical based on Deadlocks (like RAG, deadlock prevention, deadlock avoidance etc)
Tutorial Test-1
Numerical based on Paging and segmentation
Numerical based on Page Replacements
Tutorial Test-2
File systems of different operating systems like LINUX, UNIX, WINDOWS
Quiz
Numerical on Disk Scheduling
7. Evaluation Scheme:
Component 1
Quizzes / Presentation/Tutorial test
20
Component 2*
Sessional Tests (STs)*
20
Component 3**
End Term Examination**
60
Total
100
* There are three Sessional Tests (STs) for all theory papers, the first two are compulsory and the third one is the
non-mandatory make up / mercy test. The average of best two is considered.
** The End Term Comprehensive examination will be held at the end of semester. The mandatory requirement
of 75% attendance in all theory classes is to be met for being eligible to appear in this component.
8. Details of Evaluation Component 1
Description
Tutorial test-1*
Duration
30 mins
Marks
20
To be held in week
6th week
Tutorial test-2*
30 mins
20
9th week
Quiz*
20 mins
20
11th week
Remarks
Descriptive/ Short-Long Answer (2 questions, 10
marks each)
Descriptive/ Short-Long Answer(2 questions, 10
marks each)
MCQ’s, Fill in the blanks, True- false (10
questions, 2 marks each)
*Particular component to be covered in tutorials.
Page 3 of 4
9. Syllabus with weightage
Contents
Introduction:
Mainframe systems , Desktop Systems , Multiprocessor Systems , Distributed
Systems ,Clustered Systems , Real Time Systems Handheld Systems
System Components, Operating System Services, System Calls/API, System Program
Process Concept:
Process Scheduling, Operations On Processes, Cooperating Processes, Inter-process
Communication
Lectures
5
Threads:
Multithreading Models, Overview, Threading issues, Linux Threads
CPU Scheduling:
Basic Concepts, Scheduling Criteria Scheduling Algorithms Multiple-Processor,
Scheduling Real Time Scheduling
Process Synchronization: The Critical-Section Problem, Synchronization Hardware,
Semaphores, Classic problems of Synchronization, Critical regions, Monitors
Deadlock:
System Model Deadlock Characterization, Methods for handling Deadlocks,
Deadlock Prevention, Deadlock avoidance, Deadlock detection, Recovery From
Deadlocks
Memory Management:
Swapping, paging, Segmentation, Segmentation with paging
Virtual Memory, Demand Paging, Process creation, Page Replacement Algorithms,
Allocation of frames, Thrashing
File Concept:
Access Methods, Directory Structure, File System Mounting, File Sharing, Protection
File System Structure, and File System Implementation, Directory implementation,
Allocation Methods, Free-space Management,
Kernel I/O Subsystems. Disk Structure – Disk Scheduling, Disk Management – SwapSpace Management
Security:
Protection, Security Problem, User Authentication Problem, Program Threats,
System Threats
OS Case study – UNIX, Linux, Windows
2
Weightage
18%
2
4
18%
3
4
18%
4
21%
4
2
2
25%
3
This Document is approved by:
Designation
Course Coordinator
PI/CoD/HoD
Dean
Date
Revision Number
Name
Ms Shivani Gautam
Mr. Sushil Bansal
Dr. Rajnish Sharma
27.07.2012
1
Signature
Page 4 of 4