Dayananda Sagar University

School of Engineering
Department of Computer Science and Engineering

OPERATING SYSTEMS
[As per Choice Based Credit System (CBCS) scheme]

SEMESTER – V
Course Code : Credits : 04
Hours / : 03 Hours Total Hours : 39(T)+26(P)
Week Hours
L–T–P–J : 3–0–2–0

Course Learning Objectives:

This Course will enable students to:
● Understand the basic concepts and functions of operating systems.
● Understand Processes and Threads
● Analyze Scheduling algorithms.
● Understand the concept of Deadlocks.
● Analyze various Memory and Virtual memory management, File system
and storage techniques.
● Discuss the goals and principles of protection in a modern computer
system.
Teaching-Learning Process (General Instructions)

These are sample new pedagogical methods, where teacher can use to accelerate the
attainment of the various course outcomes.
1. Lecture method means it includes not only traditional lecture method, but
different type of teaching methods may be adopted to develop the course
outcomes.
2. Interactive Teaching: Adopt the Active learning that includes brainstorming,
discussing, group work, focused listening, formulating questions, notetaking,
annotating, and roleplaying.
3. Show Video/animation films to explain functioning of various concepts.
4. Encourage Collaborative (Group Learning) Learning in the class.
5. To make Critical thinking, ask at least three Higher order Thinking questions
in the class.
6. Adopt Problem Based Learning, which fosters students’ Analytical skills,
develop thinking skills such as the ability to evaluate, generalize, and analyse
information rather than simply recall it.
7. Show the different ways to solve the same problem and encourage the
students to come up with their own creative ways to solve them.
UNIT – I 08 Hours
 Dayananda Sagar University
School of Engineering
Department of Computer Science and Engineering
OS Overview and System Structure: Introduction to operating systems, System
structures: What operating systems do; Computer System organization; Computer
System architecture; Operating System structure; Operating System operations;
Process management; Memory management; Storage management; Protection and
Security; Distributed system; 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;
Textbook – 1: 1.1 -1.10,1.12,2.1-2.8.

UNIT – II 08 Hours
Process Management: Process concept; Process scheduling; Operations on
processes.
Multi- threaded Programming: Overview; Multithreading models; Threading
issues.
Process Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms.
Textbook – 1: 3.1-3.3,4.1,4.2,4.4,5.1-5.3

UNIT – III 08 Hours

Process Synchronization: The critical section problem; Peterson’s solution;
Synchronization hardware; Semaphores; Classical problems of synchronization;
Monitors Deadlocks.
Deadlocks: System model; Deadlock characterization; Methods for handling
deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and
recovery from deadlock.
Textbook-1: 6.1-6.7,7.1-7.7

UNIT – IV 07 Hours
Memory Management Strategies: Background; Swapping; Contiguous memory
allocation; Paging; Structure of page table; Segmentation.
Virtual Memory Management: Background; Demand paging; Copy-on-write; Page
replacement; Allocation of frames; Thrashing.
Textbook-1: 8.1-8.6,9.1-9.6

UNIT – V 08 Hours
File System, Implementation of File System:
File system: File concept; Access methods; Directory structure; File system
mounting; File sharing. Protection: Implementing File system: File system structure;
File system implementation; Directory implementation; Allocation methods; Free
space management.
Mass storage structures: Disk structure; Disk attachment; Disk scheduling; Disk
management; Swap space management.
Protection and Security:
 Dayananda Sagar University
School of Engineering
Department of Computer Science and Engineering
Protection: Goals of protection, Principles of protection, System Security: The Security
Problem, Program Threats, System and Network Threats.
Textbook-1: 10.1-10.6,12.1-12.6,14.1,15.1-15.3

List of Laboratory/Practical Experiments:

Exp. Division of
List of Experiments
No Experiments

Write a C program to create a new process that exec a

1 new program using system calls fork(), execlp() &
wait()
Write a C program to display PID and PPID using
2 System Calls
system calls getpid () & getppid ()
Write a C program using I/O system calls open(),
3 read() & write() to copy contents of one file to another
file
Write a C program to implement multithreaded
4
program using pthreads
Process
Write C program to simulate the Round Robin CPU
Management
5 scheduling algorithms

Process Write a C program to simulate producer-consumer

6
synchronization problem using semaphores
7 Write a C program to simulate Bankers algorithm for
Deadlock
8 the purpose of deadlock avoidance.
9 Write a C program to simulate FIFO page replacement
Memory
algorithms
10 Management
Write a C program to simulate the single level directory
11 technique
I/O System
Write a C program to simulate the indexed file
12
allocation strategies.

Bloom’s
Course
Description Taxonomy
Outcome
Level
At the end of the course the student will be able to:

1 Illustrate the key concepts and structures of operating L2

 Dayananda Sagar University
School of Engineering
Department of Computer Science and Engineering
systems, including process, memory, and storage
management, protection, security, distributed systems, and
system calls.
Apply concepts of process management, including process
scheduling and operations, multi-threaded programming
2 models and issues, and process scheduling criteria and L3
algorithms, resulting in a practical understanding of efficient
process handling in operating systems.
Apply concepts of process synchronization and deadlock
3 management methods for handling, preventing, avoiding, L3
detecting, and recovering from deadlocks.
Compare and contrast various memory management
4 techniques to enforce memory protection and manage L2
memory allocation and deallocation efficiently.
Demonstrate the various file management techniques, disk
scheduling methods for efficient resource utilization and
5 interpret the system, network, program threats and employ L2
protection principles to safeguard the system resources.

Table: Mapping Levels of COs to POs / PSOs

COs Program Outcomes (POs) PSOs
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO
1 2 1 0
1
CO
1 1 1 1 0
2
CO
1 1 1 1 0
3
CO
1 1 1 1 0
4
CO
1 1 1 1 0
5

3: Substantial (High) 2: Moderate (Medium) 1: Poor (Low)

TEXT BOOKS:
 Dayananda Sagar University
School of Engineering
Department of Computer Science and Engineering
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System
Principles 8th edition, Wiley-India, 2010

REFERENCE BOOKS:
1. Operating Systems-Internals and Design Principles, William Stallings, 6th Edition,
Pearson Education, 2009.
2. Operating Systems: A Modern Perspective, Gary J. Nutt, Addison-Wesley, 1997

E-Resources:
1. Modern Operating Systems by Andrew S. Tanenbaum - Known for its
comprehensive coverage of modern operating systems principles and design.
2. Operating System Fundamentals - Course (nptel.ac.in)

3. Introduction to Operating Systems - Course (nptel.ac.in)

4. Intro to Operating Systems 1: Virtualization | Coursera
5. Intro to Operating Systems 3: Concurrency | Coursera
6. Intro to Operating Systems 2: Memory Management | Coursera

Activity Based Learning (Suggested Activities in Class)

1. Implementing Operating System concepts by doing Mini projects.
2. Case study to compare various Operating Systems and their performance.
3. Present real-world case studies or problems related to operating systems design
and performance optimization, encouraging students to apply theoretical
knowledge to analyze and propose solutions.

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