Scribd
Upload
44 views2 pages

Syllabus

This document outlines the course objectives, outcomes, units, experiments, and textbooks for the 20CS4402 Operating Systems course. The course aims to help students understand operating system services and components. It covers topics like process management, concurrency, synchronization, memory management, CPU scheduling algorithms, and I/O management algorithms. Students will conduct experiments related to processes, scheduling, synchronization, paging, and disk scheduling. The course has 3 units spanning 10 periods each, and 30 periods for experiments. Recommended textbooks are also provided.

Uploaded by

rajendrakannammalg.cse
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
44 views2 pages

Syllabus

This document outlines the course objectives, outcomes, units, experiments, and textbooks for the 20CS4402 Operating Systems course. The course aims to help students understand operating system services and components. It covers topics like process management, concurrency, synchronization, memory management, CPU scheduling algorithms, and I/O management algorithms. Students will conduct experiments related to processes, scheduling, synchronization, paging, and disk scheduling. The course has 3 units spanning 10 periods each, and 30 periods for experiments. Recommended textbooks are also provided.

Uploaded by

rajendrakannammalg.cse
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

20CS4402 OPERATING SYSTEMS L T P S C

ASSESSMENT TYPE TYPE -3 3 0 2 1 4


OBJECTIVES
To understand the services provided by an operating system.
COURSE OUTCOMES
Students will be able to
1. Identify the components of operating system and their functionalities
2. Analyze and evaluate the performance of various process management algorithms
3. Analyze and evaluate the performance of various memory management algorithms
4. Analyze and evaluate the performance of various I/O management algorithms
5. write programs to evaluate various system calls

UNIT 1 – BASICS OF OPERATING SYSTEMS


Overview –Operating system operations and structures - System calls and System programs-
Building and Booting an Operating system. Process Management-Processes and Threads – Process
scheduling - Operations on processes - Inter process communication - IPC in Shared Systems.
Scheduling criteria – CPU Scheduling algorithms.
Total Periods :10
UNIT 2 - PROCESS COORDINATION
Concurrency and Synchronization Mechanisms- Semaphores - Classic problems of synchronization –
Deadlock characterization - Methods for handling deadlocks - Deadlock prevention - Deadlock
avoidance - Deadlock detection and Recovery.
Total Periods :10
UNIT 3 - MEMORY MANAGEMENT
Memory Management: Main memory- Contiguous memory allocation - Paging - Swapping -
Segmentation - Virtual Memory- Demand paging – Page Replacement Algorithms – Thrashing- Design
Issues – Implementation Issues.
Total Periods :10
LIST OF EXPERIMENTS

1. Linux Commands
2. Process Management using System Calls: Fork, Exit, Getpid, Exit, Wait, Close, Stat
3. Simulate the following CPU scheduling algorithms a) FIFO b) SJF c) Priority d) Round Robin
4. Implement dinning philosopher problem using semaphore
5. Simulate Bankers Algorithm for Dead Lock Avoidance and prevention
6. Simulate Paging Technique of memory management
7. Simulate all page replacement algorithms a) FIFO b) LRU c) LFU
8. Simulate the following disk scheduling algorithms a) FCFS b) SSTF c) SCAN
Total Periods: 30
TEXT BOOKS

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ―Operating System Concepts‖, 9th
Edition, John Wiley and Sons Inc., 2012.
REFERENCE BOOKS
1. Andrew S. Tanenbaum and Herbert Bos, “Modern Operating Systems”, Fourth Edition, Prentice Hall,
2014.
2. MukeshSinghal, NiranjanShivaratri, “Advanced Concepts in Operating Systems – Distributed,
Database and Multiprocessor Operating Systems”, Tata McGraw-Hill, 2001.
3. Rajib Mall, “Real-Time Systems: Theory and Practice”, Prentice Hall, 2006.

You might also like