Uka Tarsadia University

Diploma
Semester VI

OPERATING SYSTEM
(CE2010)

EFFECTIVE FROM July-2021

Syllabus version: 1.00
 Teaching Scheme
Subject
Subject Title Hours Credits
Code
Theory Practical Theory Practical
CE2010 Operating System 3 2 3 1

Theory Practical
Subject Examination Marks Examination Marks Total
Subject Title
Code Marks
Internal External Internal External
CE2010 Operating System 40 60 20 30 150

Objectives of the course:

To understand the services provided by different operating systems.
To understand the process management and synchronization.
To familiarize the views of operating management policies like process, memory
management and file management.

Course Outcomes:
Upon completion of the course, the student will be able to:
CO1: Identify different operating systems used in real world.
CO2: Implement different scheduling algorithms used in operating systems.
CO3: Understand various process management concepts of inter process
communication.
CO4: Simulate different algorithms to resolve deadlock.
CO5: Familiarize with concept of memory management including virtual memory.
CO6: Understand the concept file system interface and its implementation.

Sr. No. Topics Hours

Unit – I
1 Introduction to Operating System: 6
Basics of Operating System, Need of Operating System, Computer
hardware, Types of Operating System, Operating System concepts:
processes, address spaces, files, input/output, protection, shell.
Unit – II
2 Process Management: 9
Process Overview: The Process Model, Process Creation, Process
Termination, Process Hierarchies, Process State, Process Control
Block, Process Scheduling, Process Scheduling algorithms: First Come
First Serve, Shortest Job First, Priority, and Round Robin
Unit – III
3 Interprocess Communication: 7
Race condition, Critical regions, Mutual exclusion with busy waiting,
Sleep and Wakeup, Semaphores, Mutexes, Monitors, Message passing,
Barriers.
Unit – IV
4 Deadlocks: 7
Resources, Introduction to deadlocks, Deadlock detection and
recovery, Deadlock avoidance, Deadlock prevention.
Unit – V
5 Memory Management: 9
 Introduction of memory management, Contiguous allocation:
Partitioned memory allocation, Fixed & variable partitioning,
Swapping, Non-contiguous allocation: Page allocation, Segmentation,
Virtual Memory, Page Replacement Algorithms: First In First Out,
Optimal Page replacement, Least Recently Used.
Unit – VI
6 File Systems: 7
File naming, File structure, File types, File access, File attributes, File
operations; Directories: Single level directory systems, Hierarchical
directory system, Path names, Directory operations; File system
implementation: File system layout, Implementing files,
Implementing directories, Shared files.

Sr. No. Operating System (Practical) Hours

1 Study the features of all the major operating systems evolved and 2
perform comparative analysis.
2 Given the list of processes, their CPU burst times and arrival times, 4
write a C program to display/print the Gantt chart for FCFS
scheduling algorithms. Also compute and print the average waiting
time and average turnaround time.
3 Given the list of processes, their CPU burst times and arrival times, 4
write a C program to display/print the Gantt chart for Non
Preemptive Priority scheduling algorithms. Also compute and print
the average waiting time and average turnaround time.
4 Write a C program to implement the Readers and Writers problem 4
using semaphores.
5 Write a C program to implement banker’s algorithm for deadlock 4
avoidance.
6 Write a C program to implement first fit, best fit and worst fit 4
memory allocation scheme.
7 Write a C program to implement First In First Out page replacement 4
algorithm.
8 Write a C program to open, read and write into a file. 4

Text book:
1. Andrew S. Tanenbaum – “Modern Operating Systems”, Pearson.

Reference books:
1. Abraham Silberschatz, Peter B Galvin, Gerg Gagne – “Operating System Concepts” – 9th
Edition, Wiley.
2. Bhatt, Pramod Chandra P. – “An Introduction to Operating Systems: Concepts and
Practice”, PHI.
3. Dhamdhere D. M. – “Operating Systems”, TMH.
4. Halder S. and Aravind A. – “Operating Systems”, Pearson.
Course objectives and Course outcomes mapping:
To understand the services provided by different operating systems: CO1, CO2
To understand the process management and synchronization: CO2, CO3
To familiarize the views of operating management policies like process, memory
management and file management: CO4, CO5, CO6
Course units and Course outcome mapping:

Unit Course Outcomes

Unit Name
No. CO1 CO2 CO3 CO4 CO5 CO6
1 Introduction to Operating System
2 Process Management
3 Interprocess Communication
4 Deadlocks
5 Memory Management
6 File Systems

Programme Outcomes:
PO 1: Basic and Discipline specific knowledge: Apply knowledge of basic mathematics,
science and engineering fundamentals and engineering specialization to solve the
engineering problems.
PO 2: Problem analysis: Identify and analyse well-defined engineering problems using
codified standard methods.
PO 3: Design/ development of solutions: Design solutions for well-defined technical
problems and assist with the design of systems components or processes to meet
specified needs.
PO 4: Engineering Tools, Experimentation and Testing: Apply modern engineering tools
and appropriate technique to conduct standard tests and measurements.
PO 5: Engineering practices for society, sustainability and environment: Apply
appropriate technology in context of society, sustainability, environment and
ethical practices.
PO 6: Project Management: Use engineering management principles individually, as a
team member or a leader to manage projects and effectively communicate about
well-defined engineering activities.
PO 7: Life-long learning: Ability to analyse individual needs and engage in updating in
the context of technological changes.

Programme Outcomes and Course Outcomes mapping:

Programme Course Outcomes

Outcomes CO1 CO2 CO3 CO4 CO5 CO6
PO1
PO2
PO3
PO4
PO5
PO6
PO7