Scribd
Upload
4 views

Operating system syllabus

The document outlines the course structure for an Operating Systems subject in a B.Tech program, detailing objectives, modules, and outcomes. It covers key topics such as OS types, process management, concurrency, memory management, I/O systems, and file management. Additionally, it includes references for further reading on operating system concepts.

Uploaded by

Ankit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Operating system syllabus

The document outlines the course structure for an Operating Systems subject in a B.Tech program, detailing objectives, modules, and outcomes. It covers key topics such as OS types, process management, concurrency, memory management, I/O systems, and file management. Additionally, it includes references for further reading on operating system concepts.

Uploaded by

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

CODE: PCC-CS-403

SUBJECT NAME: OPERATING SYSTEM


NO OF CREDITS: 3
th
B.TECH. 4 SEMESTER SESSIONAL: 25
L T P PRACTICAL EXAM: 75
3 0 0 TOTAL: 100
Course Objectives:
1. To understand evolution and types of OS and to understand the structure, components and
functions of OS.
2. To learn about Processes, threads and various Scheduling policies.
3. To understand process concurrency and synchronization.
4. To understand the principles of concurrency and Deadlocks.
5. To understand various memory management schemes.
6. To understand virtual memory management, Disk management, I/O management and File
systems
MODULE-1:
Introduction: Concept of Operating Systems, Generations of Operating systems, Types of
Operating Systems, OS Services, System Calls, Structure of an OS - Layered, Monolithic,
Microkernel Operating Systems,
MODULE-2:
Processes: Definition, Process Relationship, Different states of a Process, Process State
transitions, Process Control Block (PCB), Context switching
Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of
multithreads,
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling
criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time;
Scheduling algorithms: Pre-emptive and Non pre-emptive, FCFS, SJF, RR;
MODULE-3:
Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion,
Hardware Solution, Strict Alternation, Peterson‘s Solution, The Producer/Consumer Problem,
Semaphores, Event Counters, Monitors, Message Passing, Classical IPC Problems: Reader‘s &
Writer Problem, Dinning Philosopher Problem etc.
MODULE-4:
Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock
Prevention, Deadlock Avoidance: Banker‘s algorithm, Deadlock detection and Recovery.
MODULE-5:

83 | P a g e
Memory Management: Basic concept, Logical and Physical address map, Memory allocation:
Contiguous Memory allocation – Fixed and variable partition–Internal and External
fragmentation and Compaction; Paging: Principle of operation – Page allocation – Hardware
support for paging, Protection and sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of
reference, Page fault , Working Set , Dirty page/Dirty bit – Demand paging, Page Replacement
algorithms: Optimal, First in First Out (FIFO) and Least Recently used (LRU).
MODULE-6:
I/O Hardware: I/O devices, Device controllers, Direct memory access Principles of I/O
Software: Goals of Interrupt handlers, Device drivers, Device independent I/O software,
Secondary-Storage Structure: Disk structure, Disk scheduling algorithms
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed), Free-space
management (bit vector, linked list, grouping), directory implementation (linear list, hash
table).
Case study: UNIX and WINDOWS Operating System.
Course Outcomes:
After the completion of the course, the students will be able to:
1. Learn the basic concepts of operating system, its various types and architecture
2. Learn and implement process management issues including process life cycle,
scheduling, synchronization and deadlocks
3. Learn and implement memory management issues including memory partitioning,
memory allocation and virtual memory concept
4. Learn and implement files systems and I/O systems including file management and
diskmanagement

REFERENCES:
4. Abraham Silberschatz, Peter Galvin, Greg Gagne, “Operating System Concepts
Essentials”,9th Edition, Wiley Asia Student Edition.
5. Naresh Chauhan,” Principles of Operating System”, Oxford University Press, 2014.
6. William Stallings, “Operating Systems: Internals and Design Principles”, 5th Edition,
Prentice Hall of India.

84 | P a g e

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy