CS6401-Operating Systems Notes

CS6401                    OPERATING SYSTEMS                  L T P C                  3 0 0 3


The student should be made to:

Ø  Study the basic concepts and functions of operating systems.

Ø  Understand the structure and functions of OS.

Ø  Learn about Processes, Threads and Scheduling algorithms.

Ø  Understand the principles of concurrency and Deadlocks.

Ø  Learn various memory management schemes.

Ø  Study I/O management and File systems.

Ø  Learn the basics of Linux system and perform administrative tasks on Linux Servers.

UNIT I                      OPERATING SYSTEMS OVERVIEW                           9

Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory Hierarchy,

Cache Memory, Direct Memory Access, Multiprocessor and Multicore Organization. Operating system

overview-objectives and functions, Evolution of Operating System.- Computer System OrganizationOperating System Structure and Operations- System Calls, System Programs, OS Generation and System Boot.

UNIT II                              PROCESS MANAGEMENT                                    9

Processes-Process Concept, Process Scheduling, Operations on Processes, Interprocess

Communication; Threads- Overview, Multicore Programming, Multithreading Models; Windows 7 -

Thread and SMP Management. Process Synchronization - Critical Section Problem, Mutex Locks,

Semophores, Monitors; CPU Scheduling and Deadlocks.

UNIT III                          STORAGE MANAGEMENT                                        9

Main Memory-Contiguous Memory Allocation, Segmentation, Paging, 32 and 64 bit architecture

Examples; Virtual Memory- Demand Paging, Page Replacement, Allocation, Thrashing; Allocating

Kernel Memory, OS Examples.

UNIT IV                              I/O SYSTEMS                                                                9

Mass Storage Structure- Overview, Disk Scheduling and Management; File System Storage-File

Concepts, Directory and Disk Structure, Sharing and Protection; File System Implementation- File

System Structure, Directory Structure, Allocation Methods, Free Space Management, I/O Systems.

UNIT V                                CASE STUDY                                                              9


                                                                                               TOTAL: 45 PERIODS



At the end of the course, the student should be able to:

Ø  Design various Scheduling algorithms.

Ø  Apply the principles of concurrency.

Ø  Design deadlock, prevention and avoidance algorithms.

Ø  Compare and contrast various memory management schemes.

Ø  Design and Implement a prototype file systems.

Ø  Perform administrative tasks on Linux Servers.


1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts”, 9th

Edition, John Wiley and Sons Inc., 2012.


1. William Stallings, “Operating Systems Internals and Design Principles”, 7th Edition, Prentice Hall,


2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley, 2001.

3. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill

Education”, 1996.

4. D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Second Edition, Tata

McGraw-Hill Education, 2007.

5. http://nptel.ac.in/.

Vivekananthamoorthy N,
Feb 7, 2017, 1:17 AM
Vivekananthamoorthy N,
Feb 7, 2017, 1:16 AM
Vivekananthamoorthy N,
Feb 6, 2017, 10:34 PM
Vivekananthamoorthy N,
Feb 7, 2017, 1:17 AM
Vivekananthamoorthy N,
Feb 7, 2017, 1:16 AM
Vivekananthamoorthy N,
Feb 7, 2017, 1:16 AM
Vivekananthamoorthy N,
Feb 6, 2017, 10:32 PM
Vivekananthamoorthy N,
Feb 7, 2017, 1:17 AM