Assignment
Assignment
ENGINEERING RESEARCH
CE, CSE & ICT Department
Operating System (3140702)
3) Explain following types of operating system neat sketch and give its pros and cons. 7
(a) Batch Operating System
(b) Multiprogramming Operating System
(c) Time Sharing Operating System
(d) Multiprocessor Operating System
(e) Clustered Operating System
(f) Distributed Operating System
(g) Network Operating System
(h) Real Time Operating System
4) What is system call? Explain steps for system call execution. 7
4) Define Scheduling criteria likes CPU Utilization, Throughput, Turn Around Time, and 7
Waiting Time and Response Time.
5) Differentiate: Non-preemptive v/s Preemptive scheduling. 7
P0 0 6
P1 1 4
P2 3 2
P3 5 1
8) Define IPC (Inter-Process Communication). Give one application which uses IPC. 7
List out issues related to IPC. Gives advantages of IPC.
2) Define Process Synchronization and list out issues related to Process Synchronization. 7
5) Describe three problems (Mutual Exclusion, Progress and Bounded waiting) of critical 7
section.
6) Explain Software based (using Peterson’s Solution) and Hardware based (using Locks) 7
in brief.
7) Define Semaphore. Explain Binary and Counter Semaphore in brief. Describe 7
Semaphore implementation with no busy waiting. Describe deadlock, starvation and
indefinite blocking problem using busy waiting.
8) Explain following Classical IPC/Process Synchronization problems in brief. 7
i) Bounded-Buffer Problem / Producer – Consumer Problem
ii) Readers and Writers Problem
iii) Dining-Philosophers Problem
3) Define Deadlock and explain four necessary conditions for dead lock to occur. 7
6) Explain the use of Banker’s Algorithm for multiple resources for Deadlock avoidance 7
with illustration.
7) List Deadlock Recovery Techniques and explain one of them. 7
10) Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst-fit with 7
example.
11) Explain Fragmentation. Difference between Internal and External Fragmentation. 7
21) Consider the following reference string. Calculate the page fault rates for below page 7
replacement algorithm. Assume the memory size is 4 page frame.
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
1. FIFO
2. LRU
3. OPTIMAL
Which algorithm is efficient?
22) What is Belady’s anomaly? Explain with suitable example. 7
2) What is DMA? Explain DMA cycle stealing with the help of diagram. 7
5) Assume that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently 7
serving a request at cylinder 100. The queue of pending requests is
23, 89, 132, 42, 189.
Calculate seek time FCFS and SSTFdisk scheduling algorithm.
6) Suppose that a disk drive has 200 cylinders. Numbered 0 to 199. The drive is currently 7
serving at cylinder 53 and previous request was at cylinder 43. The queue of pending
requests in FIFO order is
98, 183, 37, 122, 14, 124, 65, 67
Starting from the current head position what is the total distance (in cylinders) that the
disk arm moves to satisfy all the pending requests for each of following disk
scheduling algorithms.
(a) FCFS
(b) SSTF
(c) SCAN
(d) LOOK
(e) C-SCAN
(f) C-LOOK
7) List and Explain different File Attributes and Operations. 7
13) Explain domain Protection Mechanism (Protection Domain, Access Control List) in 7
brief.
14) What is “inode”? Explain File and Directory Management of Unix Operating System 7