COURSE INFORMATION SHEET
OPERATING SYSTEMS
PROGRAMME: Computer Science & Engineering DEGREE: BE
COURSE: OPERATING SYSTEMS SEMESTER: 3 CREDITS:04
COURSE CODE: C204 COURSE TYPE: IPCC
REGULATION:2023 Scheme
COURSE AREA/DOMAIN: Computer Science CONTACT HOURS: 3 hours/Week.
CORRESPONDING LAB COURSE CODE (IFANY):yes LAB COURSE NAME: OPERATING SYSTEMS
Laboratory
SYLLABUS:
Module DETAILS HOURS
I Introduction to operating systems, System structures: What operating systems do; 8
Computer System organization; Computer System architecture; Operating System
structure; Operating System operations;
Process management; Memory management; Storage management; Protection and
Security; Distributed system; Special-purpose systems; Computing environments.
Operating System Services: User - Operating System interface; System calls; Types of
system calls; System programs; Operating system design and implementation;
Operating System structure; Virtual machines; Operating System debugging,
Operating System generation; System boot.
II Process Management: Process concept; Process scheduling; Operations on processes; 8
Inter process communication.
Multi-threaded Programming: Overview; Multithreading models; Thread Libraries;
Threading issues.
Process Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms;
Thread scheduling; Multiple-processor scheduling.
III Process Synchronization: Synchronization: The critical section problem; Peterson’s 8
solution; Synchronization hardware; Semaphores; Classical problems of
synchronization;
Deadlocks: System model; Deadlock characterization; Methods for handling
deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and
recovery from deadlock.
IV Memory Management: Memory management strategies: Background; Swapping; 8
Contiguous memory allocation; Paging; Structure of page table; Segmentation.
Virtual Memory Management: Background; Demand paging; Copy-on-write; Page
replacement; Allocation of frames; Thrashing.
V File System, Implementation of File System: File system: File concept; Access 8
methods; Directory and Disk structure; File system mounting; File sharing;
Implementing File system: File system structure; Filesystem implementation;
Directory implementation; Allocation methods; Free space management.
Secondary Storage Structure, Protection: Mass storage structures; Disk structure; Disk
attachment; Disk scheduling; Disk management; Protection: Goals of protection,
Principles of protection, Domain of protection, Access matrix.
Total Hours 40
EXPER
IMENT Topics to be covered CO & PO’S
NO.
1 Develop a c program to implement the Process system calls (fork (), exec(), CO1 , PO1
wait(), create process, terminate process)
Simulate the following CPU scheduling algorithms to find turnaround time and CO2,
2
waiting time a) FCFS b) SJF c) Round Robin d) Priority. PO1,PO2
3 Develop a C program to simulate producer-consumer problem using CO3,PO1,PO2
semaphores.
Develop a C program which demonstrates inter-process communication CO2,
4 between a reader process and a writer process. Use mkfifo, open, read, write PO1,PO2
and close APIs in your program.
5 Develop a C program to simulate Bankers Algorithm for Deadlock Avoidance. CO3,PO1,PO2
6 Develop a C program to simulate the following contiguous memory allocation CO4,
Techniques: a) Worst fit b) Best fit c) First fit. PO2,PO3
7 Develop a C program to simulate page replacement algorithms: a) FIFO b) CO4,
LRU PO2,PO3
8 Simulate following File Organization Techniques CO5,PO1,PO3
a) Single level directory b) Two level directory
9 Develop a C program to simulate the Linked file allocation strategies. CO5,PO1,PO3
10 Develop a C program to simulate SCAN disk scheduling algorithm. CO5,PO1,PO3
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles 7th
edition, Wiley-India, 2006.
R Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th
Edition Oxford Scholarship Online: December 2013
R P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition,
PHI(EEE), 2014.
R William Stallings Operating Systems: Internals and Design Principles, 6th Edition,
Pearson.
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
C105 Problem solving using C To know the Concepts of computer basics, 1st
Strong programming skills (Knowledge of
C), elementary data structures and
algorithms, computer architecture.
COURSE OBJECTIVES:
1 To Demonstrate the need for OS and different types of OS
2 To discuss suitable techniques for management of different resources
3 To demonstrate different APIs/Commands related to processor.
4 To introduce Memory, storage and file system management.
COURSE OUTCOMES:
SL. DESCRIPTION Blooms’ Taxonomy
NO. Level
C204.1 Define the process concept, structure and design of the Remembering ,Understand
operating system. and Apply (level1, 2 and 3)
C204.2 Discuss the concepts of threads, process Remembering and Apply
synchronization and CPU scheduling algorithms. (level 1 and 3)
C204.3 Identify causes of deadlocks and solutions for Remembering and Apply
eliminating deadlock. (level 1 and 3)
C204.4 Analyze the virtual memory management and file Understand and Apply
system implementation. (level2 and 3)
C204.5 Analyze storage structure, disk scheduling and Understand and Apply
protection (level2 and 3)
CO-PO AND CO-PSO MAPPING
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
C204.1 2
C204.2 2 2
C204.3 2 2 1
C204.4 2 2 1
C204.5 2 1 2
JUSTIFICATIONS FOR CO-PO MAPPING
MAPPING LOW/ JUSTIFICATION
MEDIUM/HIGH
C204.1 –PO1 2 Students will be able to apply the knowledge of the
fundamental concepts and theories of operating systems.
C204.2 –PO1 2 Students will be able to understand the concepts of threads ,
process and fundamentals of scheduling algorithms
C204.2 –PO2 2 Students will be able to identify the problems related to
threads and scheduling the process and providing the
synchronization between the process.
C204.3- PO1 2 Students will be able to understand the concepts of Deadlocks
and fundamentals of Deadlocks detection and Avoidance
algorithms.
C204.3 –PO2 2 Students will be able to identify the problems related to
Deadlock necessary conditions and providing the
synchronization between the processes.
C204.3-PO3 1 Students will be able to incorporate and demonstrate bankers
algorithm and also to have insights in handling the deadlock
methods.
C204.4 –PO1 2 Students will be able to understand the concepts of virtual
memory, paging, segmentation.
C204.4-PO2 2 Students will be able to identify and analyze the problems
related to paging , segmentation and memory management
C204.4-PO3 1 Students will be able to incorporate and design the solutions
for paging and segmentation problems.
C204.5 – PO1 2 Students will be able to understand the concepts of file and its
implementations.
C204.5 – PO2 1 Students will be able to identify and formulate the problems
related to files implementation, domain of protection and
secondary storage structure.
C204.5- PO3 2 Students will be able to design solutions for Linked file
allocation strategies and scheduling of disks.
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
SNO DESCRIPTION PROPOSED RELEVANCE RELEVANCE
ACTIONS WITH POs WITH PSOs
1 Topics on Security measures for NPTEL 3,4,5
operating systems
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST
LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
SNO DESCRIPTION RELEVANCE WITH RELEVANCE WITH
POs
PSOs
1 To familiarize students on the 3,4,5
different case studies of operating
system
WEB SOURCE REFERENCES:
1 Operating System - Course (nptel.ac.in)
2 Operating System Tutorial - GeeksforGeeks
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
• CHALK & TALK • STUD. ASSIGNMENT • WEB RESOURCES
• LCD/SMART BOARDS • STUD. SEMINARS • ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
• ASSIGNMENTS • STUD. SEMINARS • TESTS/MODEL • UNIV.
EXAMS EXAMINATION
• STUD. LAB PRACTICES • STUD. VIVA • MINI/MAJOR • CERTIFICATIONS
PROJECTS
• ADD-ON COURSES • OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
• ASSESSMENT OF COURSE OUTCOMES (BY • STUDENT FEEDBACK ON FACULTY
FEEDBACK, ONCE) (TWICE)
• ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. • OTHERS
EXPERTS
Prepared by
Chetana KN Approved by
