Scribd
Upload
18 views2 pages

Final OS Lab

The document outlines a course on Operating Systems, detailing objectives such as understanding processes, scheduling algorithms, memory management, and file systems. It is structured into five units covering topics like process management, deadlock management, memory management, and storage management, with specific learning outcomes for students. The course includes recommended textbooks and reference materials for further study.

Uploaded by

Balaji Ns
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views2 pages

Final OS Lab

The document outlines a course on Operating Systems, detailing objectives such as understanding processes, scheduling algorithms, memory management, and file systems. It is structured into five units covering topics like process management, deadlock management, memory management, and storage management, with specific learning outcomes for students. The course includes recommended textbooks and reference materials for further study.

Uploaded by

Balaji Ns
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

OPERATING SYSTEMS LTPC

300 3
COURSE OBJECTIVES:
 To understand the function of operating systems, Processes and threads.
 To study scheduling algorithms and deadlocks.
 To understand various memory management schemes, I/o Management and file
system.

UNIT I: OPERATING SYSTEM OVERVIEW 9

Computer system Overview –Memory Hierarchy –Cache Memory-Interrupts-


Operating System overview-Objectives and functions-System calls-System
programs-System Boot.

UNIT II: PROCESS MANAGEMENT 9

Process concepts-Process Scheduling: Short term, Long term, Medium term-CPU


Scheduling algorithms: Pre-Emptive, Non Emptive scheduling, FCFS, SJF, SRTF, Priority,
Round Robin-Inter process Communications: Message passing, Shared Memory, Critical
sections, Mutual Exclusion and Synchronization: classical problems for Synchronization –
Peterson’s Solutions-Semaphore-Mutex.

UNIT III: DEAD LOCK MANAGEMENT 9

Principles of Deadlock-Necessary Conditions-Deadlock Detection-Resource


allocation Graph- Deadlock Avoidance-Banker’s algorithm- Deadlock prevention-
Deadlock Recovery.

UNIT IV: MEMORY MANAGEMENT 9

Main Memory-contiguous allocation –fixed partitioning –virtual Memory-paging-


Segmentation –Swapping –Demand Paging-Page Replacement Algorithms.

UNIT V: STORAGE MANAGEMENT 9

File System structure- Allocation Methods-Free Space Management- Disk


Structure-Disk Scheduling Algorithms-Swap space Management- Case Study-
Linux System.

COURSE OUTCOMES: Total: 45 Periods

 Describe the important computer system resources and the role of


operating systems.
 Explain various CPU scheduling algorithm and synchronization. .
 Exemplify with handling deadlock mechanism.
 Evaluate various page replacement algorithms.
 Exhibit file system structure and disk scheduling algorithms.

TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne,
“Operating System Concepts”‖, 10th Edition, John Wiley and Sons
Inc., 2018.
2. William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition,
Prentice Hall, 2018

Reference Book:

1. Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill


Education, 2016.
2. Ramaz Elmasri, A. Gil Carrick, David Levine, “Operating Systems –
A Spiral Approach”, Tata McGraw Hill Edition, 2010.
3. Maurice J Bach, “The Design of the Unix Operating System ”, Edition , Pearson
Education.2017.

CO’s PO’s PSO’s


1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - - - - - - - - 1 - 1 -
2 2 1 - - - - - - - - - 1 - 1 -
3 2 1 - - - - - - - - - 2 - 1 -
4 3 2 1 - - - - - - - - 2 - 2 -
5 3 2 1 - - - - - - - - 2 - 2 -
AVg. 2 1 1 0 0 0 0 0 0 0 0 2 - 2 -

You might also like