AJCE_Autonomous
COURSE CODE COURSE NAME CATEGORY L T P R CREDIT YEAR OF INTRODUCTION
23CST206 OPERATING SYSTEMS PCC 3 1 0 0 4 2023
Preamble :
Preamble: Study of operating system is an essential to understand the overall working of computer system,
tradeoffs between performance and functionality and the division of jobs between hardware and software.
This course introduces the concepts of memory management, device management, process management,
file management and security & protection mechanisms available in an operating system. The course helps
the learner to understand the fundamentals about any operating system design so that they can extend the
features of operating system to detect and solve many problems occurring in operating system and to
manage the computer resources appropriately.
Prerequisite :
Prerequisite: Topics covered in the courses are Data Structures (CST 201) and Programming in C (EST 102)
Course Outcomes(CO): Upon successful completion of this course, students should be able to:
Explain the relevance, structure and functions of Operating Systems in computing devices.
CO1
(Cognitive knowledge: Understand)
Illustrate the concepts of process management and process scheduling mechanisms employed
CO2
in Operating Systems. (Cognitive knowledge: Understand)
Explain process synchronization in Operating Systems and illustrate process synchronization
CO3 mechanisms using Mutex Locks, Semaphores and Monitors (Cognitive knowledge:
Understand)
Explain any one method for detection, prevention, avoidance and recovery for managing
CO4
deadlocks in Operating Systems. (Cognitive knowledge: Understand)
Explain the memory management algorithms in Operating Systems. (Cognitive knowledge:
CO5
Understand)
Mapping of course outcomes with program outcomes
# PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 - - - - - - 2 - 1
CO2 2 1 3 3 - - - - - 3 - 2
CO3 3 2 3 2 - - - - - 3 - 1
CO4 1 3 3 2 - - - - - 2 - 2
CO5 2 3 2 2 - - - - - 3 - 2
Mapping of course outcomes with program specific outcomes
# PSO1 PSO2 PSO3
CO1 - - -
CO2 3 3 2
CO3 3 2 2
CO4 3 2 2
23CST206/1
AJCE_Autonomous
# PSO1 PSO2 PSO3
CO5 3 3 2
Assessment Pattern :
Bloom’s Category Test 1 (Marks Test 2 (Marks End Semester
in percentage) in percentage) Examination
(Marks in percentage)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark distribution :
Total Marks CIE Marks ESE Marks ESE Duration
150 50 100 3Hours
Continuous Internal Evaluation Pattern :
Continuous Internal Evaluation Pattern:
Attendance : 10 marks
Continuous Assessment Test : 25 marks
Continuous Assessment Assignment : 15 marks
End Semester Examination Pattern (3 Hours)
Part Total Qns No. of Qns to be answered Marks
Part A 10 10 3
Module Total Qns To be Answered Mark
Module-1 2 1 14
Module-2 2 1 14
Part B
Module-3 2 1 14
Module-4 2 1 14
Module-5 2 1 14
Total Marks 100
Book of Study :
Text Book
Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, ' Operating System Concepts' 9th
Edition, Wiley India 2015.
References :
Reference Books:
1. Andrew S Tanenbaum, “Modern Operating Systems” , 4th Edition, Prentice Hall, 2015.
2. William Stallings, “Operating systems”, 6th Edition, Pearson, Global Edition, 2015.
3. Garry Nutt, Nabendu Chaki, Sarmistha Neogy, “Operating Systems”, 3rd Edition, Pearson
Education.
4. D.M.Dhamdhere, “Operating Systems”, 2nd Edition, Tata McGraw Hill, 2011.
5. Sibsankar Haldar, Alex A Aravind, “Operating Systems”, Pearson Education.
23CST206/2
AJCE_Autonomous
Syllabus
Module 1: Introduction (5 Hours)
Introduction to Operating System - Operating System operations, functions, service - System calls,
Types - Operating System Structure: Simple, Layered, Microkernel, Modules - System Boot Process -
Module 2: Processes and Process Scheduling (9 Hours)
Processes, Process states - Process Control Block, Threads - Scheduling - Operations on processes:
process creation and termination - Inter-process communication: Shared memory systems, Message
Passing - Process Scheduling – Basic concepts, Scheduling Criteria - Scheduling algorithms - Basics
- First come First Served, Shortest Job First - Priority scheduling, Round Robin Scheduling -
Module 3: Process synchronization and Dead locks (12 Hours)
Process synchronization, Race conditions - Critical Section problem, Peterson’s solution -
Synchronization hardware, Mutex Locks - Semaphores - Monitors - Synchronization problem
examples - Deadlocks: Necessary conditions, Resource Allocation Graphs - Deadlock prevention -
Deadlock avoidance - Banker’s algorithm - Deadlock detection - Deadlock recovery -
Module 4: Memory Management (9 Hours)
Memory Management: Concept of Address spaces - Swapping - Contiguous memory allocation, fixed
and variable partitions - Segmentation - Paging - TLBs, TLB hits and misses TLB structure - Virtual
memory, Demand Paging - Page replacement algorithms -
Module 5: File and Disk management (10 Hours)
File concept, Attributes, Operations, types, structure - Access methods - Protection - File-System
implementation,File System Checker, File System Journaling - Directory implementation,Allocation
Methods - Crash Consistency - Storage Management, Disk structure - Disk scheduling - Disk
formatting - RAID Structure -
Course Contents and Lecture Schedule
Sl. No Topic No. of Lectures
Module 1: Introduction (5 Hours)
1.1 Introduction to Operating System
1.2 Operating System operations, functions, service
1.3 System calls, Types
1.4 Operating System Structure: Simple, Layered, Microkernel, Modules
1.5 System Boot Process
Module 2: Processes and Process Scheduling (9 Hours)
2.1 Processes, Process states
2.2 Process Control Block, Threads
2.3 Scheduling
2.4 Operations on processes: process creation and termination
2.5 Inter-process communication: Shared memory systems, Message Passing
2.6 Process Scheduling – Basic concepts, Scheduling Criteria
2.7 Scheduling algorithms - Basics
2.8 First come First Served, Shortest Job First
2.9 Priority scheduling, Round Robin Scheduling
Module 3: Process synchronization and Dead locks (12 Hours)
3.1 Process synchronization, Race conditions
23CST206/3
AJCE_Autonomous
3.2 Critical Section problem, Peterson’s solution
3.3 Synchronization hardware, Mutex Locks
3.4 Semaphores
3.5 Monitors
3.6 Synchronization problem examples
3.7 Deadlocks: Necessary conditions, Resource Allocation Graphs
3.8 Deadlock prevention
3.9 Deadlock avoidance
3.10 Banker’s algorithm
3.11 Deadlock detection
3.12 Deadlock recovery
Module 4: Memory Management (9 Hours)
4.1 Memory Management: Concept of Address spaces
4.2 Swapping
4.3 Contiguous memory allocation, fixed and variable partitions
4.4 Segmentation
4.5 Paging
4.6 TLBs, TLB hits and misses TLB structure
4.7 Virtual memory, Demand Paging
4.8 Page replacement algorithms
Module 5: File and Disk management (10 Hours)
5.1 File concept, Attributes, Operations, types, structure
5.2 Access methods
5.3 Protection
5.4 File-System implementation,File System Checker, File System Journaling
5.5 Directory implementation,Allocation Methods
5.6 Crash Consistency
5.7 Storage Management, Disk structure
5.8 Disk scheduling
5.9 Disk formatting
5.10 RAID Structure
Total Hours 45
23CST206/4
< SEECODE > Reg no :_______________________
Name :_______________________
AMAL JYOTHI COLLEGE OF ENGINEERING
(AUTONOMOUS)
SEMESTER IV B.Tech DEGREE EXAMINATION (Regular)
23CST206
Operating Systems
Duration: 3 Hours Maximum Marks: 100
PART A
Answer all questions, each carries 3 Marks.
1 How does hardware find the Operating System kernel after system switch-on? (3)
2 What is the purpose of system call in operating system? (3)
3 Why is context switching considered as an overhead to the system? (3)
4 How is inter process communication implement using shared memory? (3)
5 Describe resource allocation graph for the following.
a) with a deadlock b)with a cycle but no deadlock.
(3)
6 What is critical section? What requirement should be satisfied by a solution to (3)
the critical section problem
7 Consider the reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults occur while using FCFS for the following cases. (3)
a) frame=2 b)frame=3
8 Differentiate between internal and external fragmentations. (3)
9 Compare sequential access and direct access methods of storage devices (3)
10 Define the terms (i) Disk bandwidth (ii) Seek time (3)
PART B
Answer all questions, each carries 14 Marks.
Module 1
11 a) Explain the following structures of operating system
(i) Monolithic systems
(ii) Layered Systems
(iii) Micro Kernel
( 14 )
(iv) Modular approach. (12)
b) Under what circumstances would a user be better of using a time
sharing system than a PC or a single user workstation? (2)
Or
12 a) What is the main advantage of the micro kernel approach to system
design? How do user program and system program interact in a
microkernel architecture? (8)
( 14 )
b) Describe the differences between symmetric and asymmetric
multiprocessing? What are the advantages and disadvantages of
multiprocessor systems? (6)
Module 2
13 a) Define process. With the help of a neat diagram explain different
states of process. (8)
( 14 )
b) Explain how a new process can be created in Unix using fork system
call. (6)
Or
14 Find the average waiting time and average turnaround time for the
processes given in the table below using:-
i) SRT scheduling algorithm ii) Priority scheduling algorithm (9)
Process Arrival Time (ms) Burst Time(ms) Priority
P1 0 5 3 ( 14 )
P2 2 4 1
P3 3 1 2
P4 5 2 4
b) What is a Process Control Block? Explain the fields used in a
Process Control Block. (5)
Module 3
15 Consider a system with five processes P0 through P4 and three
resources of type A, B, C.Resource type A has 10 instances, B has 5
instances and C has 7 instances. Suppose at time t0 following snapshot
of the system has been taken:
( 14 )
i) i)What
will be the content of the Need matrix? Is the system in a safe state? If
Yes, then what is the safe sequence? (8)
ii)What will happen if process P1 requests one additional instance of
resource type A and two instances of resource type C? (6)
Or
16 a) State dining philosopher’s problem and give a solution using
semaphores. (7)
14
b) What do you mean by binary semaphore and counting semaphore?
With C struct, explain implementation of wait () and signal() (7)
Module 4
17 a) Consider the following page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2,C
1,E 2 ,A 3N, 7D, 6E, 3N, G2, I1N, E2,E RING
3, 6. Find out the number of page faults if there are 4 page frames,
14
using the following
page replacement algorithms i) LRU ii) FIFO iii) Optimal (9)
b) Explain the steps involved in handling a page fault. (5)
Or
18 a) With a diagram, explain how paging is done with TLB. (5)
b) Memory partitions of sizes 100 kb, 500 kb, 200 kb, 300 kb, 600 kb
are available, how would best ,worst and first fit algorithms place 14
processes of size 212 kb, 417 kb, 112 kb, 426 kb in order. Rank the
algorithms in terms of how efficiently they uses memory. (9)
19 a) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999.
the drive currently services a request at cylinder 143, and the previous
request was at cylinder 125. the queue of pending request in FIFO
order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130.
Starting from the current position, what is the total distance (in
14
cylinders) that the disk arm moves to satisfy all pending requests for
each of the following algorithms
i) FCFS ii) SSFT iii) SCAN iv) LOOK v) C-SCAN (10)
b) What is the use of access matrix in protection mechanism? (4)
Or
20 a) Explain the different file allocation operations with advantages and
disadvantages. (8)
b) Explain the following
i) file types
ii) file operation
iii) file attributes (6)
Powered by TCPDF (www.tcpdf.org)
