Operating System - Dec 2014
Computer Engineering (Semester 4)
TOTAL MARKS: 100
TOTAL TIME: 3 HOURS (1) Question 1 is compulsory.
(2) Attempt any four from the remaining questions.
(3) Assume data wherever required.
(4) Figures to the right indicate full marks. 1 (a) Explain basic services provided by Operating System on bare Hardware machine.(7 marks) 1 (b) What is Virtual Machine? Explain virtual machine & Client/Server architecture of Operating System.(7 marks) 2 (a) What is the average waiting time & average Turn around times of all process for FCS, SJF, non-preemptive Priority and Round(Quantum=1) scheduling:
(Assume small number implies higher priority & All 5 process have arrived in order P1,P2,P3,P4,P5 all at time=0).(7 marks) 2 (b) What is Process? Explain Process state Transition Diagram in detail.(7 marks) 2 (c) What is System Call in OS? Explain fork() system call to create new process in UNIX OS.(7 marks) 3 (a) What is IPC? Explain the use of Semaphore to solve Producer-Consumer problem.(7 marks) 3 (b) Consider the following page reference string
0,1,7,2,3,2,7,1,0,3. How many page fault occur with four page frames and eight pages and the four frames are initially empty in case of FIFO & LRU.(7 marks) 3 (c) What is Monitor in IPC? Solve the Bounded buffer problem using Monitor.(7 marks) 3 (d) What is a Deadlock? Describe the conditions that lead to deadlock. How to recover from Deadlock?(7 marks) 4 (a) Explain virtual memory management with Paging in detail.(7 marks) 4 (b) Explain Banker's Algorithm to avoid deadlock with multiple resources.(7 marks) 4 (c) Explain following commands in UNIX
1. chmod 2. grep 3. head & tail 4. cut.(7 marks) 4 (d) Explain How DMA (Direct Memory Access) works.(7 marks) 5 (a) Explain linked list allocation file implementation technique.(7 marks) 5 (b) Discuss various security threats in File System of OS.(7 marks) 5 (c) Compare various Disk Arm Scheduling Algorithms.(7 marks) 5 (d) Compare Windows & Unix family Operating System.(7 marks)