Operating Systems For Computational Devices Semester 5 (May 2010)

Operating Systems For Computational Devices Semester 5 (Revised Course) (3 Hours) May 2010
AN- 4309 [Total Marks : 100]
N.B.:	(1)	Questions No.1 is compulsory.
	(2)	Attempt any four questions out of remaining six questions.
	(3)	Assume suitable data wherever required but justify the same.
	(4)	All questions carry equal marks.
	(5)	Answer to each new questions to be started on a fresh page.
	(6)	Figures to the right in brackets indicate full marks.
1.	(a)	What are the various real-time CPU scheduling algorithms. Explain each one in brief.	10
	(b)	What are requirements of mutual exclusion? Explain Peterson's algorithm for mutual exclusion.	10
2.	(a)	What are two difference between user-level threads and kernel-level threads? Under what circumstances is one type better than the other?	10
	(b)	Consider the following page 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 fault would occur for the following replacement algorithms assuming one, two, three, four, five, six or seven frames?      -- LRU Replacement      -- FIFO Replacement      -- Optimal Replacement.
3.	(a)	How does DMA increase system concurrency? How does it complicate hardware design?	10
	(b)	How do caches help improve performance? Why do systems not use more or larger caches if they are so useful.	10
4.	(a)	What are the various disk-scheduling algorithms. Explain each one in brief.	10
	(b)	Consider the following segment table:-   Segment Phase Length 0 1 2 3 4 219 2300 90 1327 1952 600 14 100 580 96 What are the physical addresses for the following logical addresses?      (i) 0,430,  (ii)  1, 10,   (iii)  2,500,   (iv)  3,400,   (v)   4, 112.
5.	(a)	What are the four conditions that create deadlock? Explain deadlock prevention and avoidance techniques.	10
	(b)	Given five memory partitions of 100 KB, 200 KB, 300 KB, and 600 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory?	10
6.	(a)	What are the various buffering techniques? Explain each one in detail.	10
	(b)	Explain file allocation methods in details.	10
7.	Write short note on any four of the following :-		20
	(a)	Monolithic Vs. Micro Kernels
	(b)	Comparison of any two RTOS
	(c)	Vx works 5.X
	(d)	NOS Vs. DOS
	(e)	Race Condition
	(f)	Inodes.

Also see Operating systems for computational devices question papers for December 2009