Scribd
Upload
34 views2 pages

Os End Sem Syllabus 2024

Uploaded by

kyakrnahetujhe
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
34 views2 pages

Os End Sem Syllabus 2024

Uploaded by

kyakrnahetujhe
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

OS END SEM SYLLABUS 2024

Module 1:
1. As per syllabus of Sessional 1:
Introduction, basic h/w support necessary for modern operating systems - Services provided by OS,
system programs and system calls - brief discussions of evolution of OS - real time and distributed
systems: a brief overview of issues.
2. Process Scheduling and Threads: Processes and 3 levels of scheduling - process control block
and context switch - goals of scheduling and different scheduling algorithms - threads: user-level
and kernel level, thread life cycle, multicore and multiprocessor systems.
Process Scheduling:
i. Basic Concepts
ii. CPU Burst and I/O Burst
iii. CPU Scheduling Criteria
iv. Scheduling Algorithms Types: Long term Scheduling, Mid Term Scheduling and Short
Term Scheduling
v. Scheduling Algorithms: FCFS, SJF, SRTF, RR, Priority Scheduling Algorithm
vi. Multilevel Queue Scheduling
vii. Multilevel Feedback Queue Scheduling
Threads:
i. Basic Concept of Threads: Single and Multithreaded Processes
ii. Benefits
iii. User and Kernel Level Threads
iv. Multithreading Models: Many to one model, one to one model and many to many model
Module 2:
Process cooperation and synchronization - mutual exclusion and implementation - semaphores,
conditional critical regions and monitors - classical inter – process communication problems - message
passing.
Deadlocks and strategies for handling them.
Process Synchronization:
i. Critical Section Problem
ii. Race Condition
iii. Software Solution: Two Process Solution (Peterson’s Solution)
iv. Synchronization Hardware (test and set instruction, compare and swap instruction)
v. Mutex Locks
vi. Semaphores
vii. Classical Problems of Synchronization
a. Bounded Buffer Problem
b. Reader Writers Problem
c. Dinning Philosophers Problem
viii. Monitors
Deadlocks:
i. Deadlock Characterization: Necessary Conditions
ii. Resource Allocation Graph
iii. Deadlock Prevention
iv. Deadlock Avoidance: Safe State, Resource Allocation Graph Algorithm, Banker’s Algorithm
v. Deadlock Detection
vi. Recovery from Deadlock
Module 3 (As per Syllabus of Sessional 2):
Memory management techniques - contiguous and non-contiguous - paging and segmentation -
translation look-aside buffers (TLB) and overheads - virtual memory and demand paging- page faults and
instruction restart – page replacement algorithms.
Module 4:
File systems, user interface - disk space management and space allocation strategies - examples from
UNIX, DOS, Windows etc - directory structures.
Mass Storage Structures:
i. Disk Structure
ii. Disk Scheduling: FCFS Scheduling, SSTF Scheduling, SCAN Scheduling, C-SCAN Scheduling,
LOOK Scheduling and C-LOOK Scheduling Algorithms
iii. Selection of Disk Scheduling Algorithm

NOTE: ALL CONTENTS RELATED TO ABOVE TOPICS COVERED IN CLASS.

***********************

You might also like