IIMTU-NEP IMPLEMENTATION
Year II / Semester III
Programme: UG(R) Year: II
Class: B. Tech CSE Semester: III
Credits Subject: Operating System
Theory: 4
Practical:2
Course Code: Title: Operating System
SECS-233
Course Objectives:
Student will be able to understand the structure and functions of OS
Student will be able to learn about Processes, Threads and Scheduling algorithms.
Student will be able to study and understand the principles of concurrency and Deadlocks
Student will be able to study and learn various memory management scheme
Student will be able to study I/O management and File systems.
Nature of Paper: Engineering Courses (Core)
Minimum Passing Marks/Credits: 4
L:3 T:1 P:3(In Hours/Week)
Theory - 1 Hr. = 1 Credit
Practical- 2 Hrs.=1Credit(4Hrs./Week=4Credits)
Unit Contents No. of Lectures Allotted
I Introduction of Operating system and functions,
Classification of Operating systems- Batch, Interactive, 10
Time sharing, Real Time System, Multiprocessor Systems,
Multiuser Systems, Multi process Systems, Multithreaded
Systems.
Details of Operating System Structure- Layered structure,
System Components, Operating System services, Reentrant
Kernels, Monolithic and Microkernel Systems.
II Process Concept, Principle of Concurrency, Producer /
Consumer Problem, Mutual Exclusion, Critical Section 10
Problem, Dekker’s solution, Peterson’s solution,
Semaphores, Test and Set [Link] Problem in
Concurrency i.e Dining Philosopher Problem and Sleeping
Barber Problem. Overview of Inter Process Communication
models and Schemes, Process generation.
III CPU Scheduling: Scheduling Concepts, Performance
Criteria, Process States, Process Transition Diagram, 10
Schedulers, Process Control Block (PCB), Process address
space, Process identification information, Threads and their
management, Scheduling Algorithms, Multiprocessor
Scheduling. Deadlock: System model, Deadlock
characterization, Prevention, Avoidance and detection,
Recovery from deadlock.
IV Memory Management: Basic bare machine, Resident
monitor, Multiprogramming with fixed partitions, 10
Multiprogramming with variable partitions, Protection
schemes, Paging, Segmentation, Paged segmentation,
Virtual memory concepts, Demand paging, Performance of
demand paging, Page replacement algorithms, Thrashing,
Cache memory organization, Locality of reference.
V I/O Management and Disk Scheduling: I/O devices, and I/O
subsystems, I/O buffering, Disk storage and disk scheduling, 10
RAID.
File System: File concept, File organization and access
mechanism, File directories, and File sharing, File system
implementation issues, File system protection and security.
Reference / Text Books:
Text books:
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
2. Sibsankar Halder and Alex A Aravind, “Operating Systems”, Pearson Education
Reference Books:
1. Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education
2. TMH 5. William Stallings, “Operating Systems: Internals and Design Principles ”, 6th Edition, Pearson
Education
Evaluation/Assessment Methodology
Max. Marks
1) Class tasks/ Sessional Examination 30
2) Presentations /Seminar
3)Assignments 20
4)Research Project Report Seminar On Research Project Report
5) ESE
100
Total: 150
Prerequisites for the course:
Course Learning Outcomes:
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 scheme
Study I/O management and File systems.
Dr. Deepa Sharma
Chairperson- CBCS Committee
IIMTU-NEP IMPLEMENTATION
Year II / Semester III
Programme:UG(R) Year: II
Class: [Link](CSE) Semester:III
Credits Subject: Operating System Lab
Theory: 0
Practical: 2
Course Code: Title: Operating System Lab
SECS-233P
Course Objectives:
1. To learn shell programming and the use of filters in the LINUX environment.
2. To practice multithreaded programming.
3. To implement CPU Scheduling Algorithms and memory management algorithms.
Nature of Paper: Core
Minimum Passing Marks/Credits:2
L:
T:
P:3(In Hours/Week)
Theory - 1 Hr. = 1 Credit
Practical- 2 Hrs.=1Credit(4Hrs./Week=4Credits)
Unit Contents No. of Lectures Allotted
I Write C programs to implement UNIX system calls and file 2
management.
II Write C programs to demonstrate various process related 2
concepts.
III Write C programs to demonstrate various thread related 2
concepts.
IV Write C programs to simulate CPU scheduling algorithms: 2
FCFS, SJF, and Round Robin.
V Write C programs to simulate Intra & Inter – Process 2
Communication (IPC) techniques: Pipes, Messages Queues,
and Shared Memory.
VI Write C programs to simulate solutions to Classical Process 2
Synchronization Problems.
VII Dining Philosophers, Producer – Consumer, Readers – 2
Writers.
VIII Write a C program to simulate Bankers Algorithm for 2
Deadlock Avoidance.
Reference / Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne (2006), Operating System Principles, 7 the
edition, Wiley India Private Limited, New Delhi.
If the course is available as Generic Elective then the students of following departments may opt it.
1.
Evaluation/Assessment Methodology
Max. Marks:50
1) Class tasks/ Sessional Examination 20
2) Presentations /Seminar
3)Assignments
4)Research Project Report
Seminar On Research Project Report
30
5) ESE
Total: 50
Coures Learning Outcomes:
Student will be able to :
1. Ensure the development of students applied skills in operating systems
related areas.
2. Students will gain knowledge in writing software routines modules or implementing various
concepts of operating system.
3. Implement Dining Philosophers, Producer – Consumer, Readers – Writers.
4. Write C programs to simulate solutions to Classical Process Synchronization Problems.
5. Write a C program to simulate Bankers Algorithm for Deadlock Avoidance.
6. Write C programs to simulate solutions to Classical Process Synchronization Problems.
Dr. Deepa Sharma
Chairperson- CBCS Committee
