Operating Systems For Computational Devices Semester 5 (December 2011)

Operating Systems For Computational Devices Semester 5 (Revised Course) (3 Hours) December 2011
[Total Marks : 100]
1.	(a)	Explain various system calls with appropriate syntaxes.	10
	(b)	Explain mutual exclusion. Also write a note on Peterson's Algorithm.	10
2.	(a)	Explain demand paging.	10
	(b)	What are various disk scheduling algorithms? Explain each one in brief.	10
3.	(a)	Explain the page replacement policies implement LRU, OPT, FIFO for the following sequence :- 0, 1, 2, 4, 3, 7, 1, 4, 2, 3. Also calculate hits and faults.	10
	(b)	Write a note on Buffering Techniques.	10
4.	(a)	What are pre emptive and non-premptive algorithms.	10
	(b)	Explain DMA in terms of system concurrency. What is it implication on hardware design?	10
5.	(a)	Write a note on file Access Methods.	10
	(b)	Consider the following snapshot :- Process Allocation Max Available   A B C A B C A B C P0 1  3  5 0  6  5 6  5  6 P1 1  0  0 2  1  3    P2 2  0  1 3  4  6   P3 4  1  1 1  5  7   P4 5  4  3  0  0  1   Answer the following questions:-   (i) What is the content of matrix need?   (ii) is the system in safe state?   (iii) If process P1 arrives with a request of (4, 5, 3),  can the request be granted.	10
6.	(a)	Draw and explain architecture of RTOS.	10
	(b)	What is semaphore? Explain in detail the usages of semaphore and resource acquisition and release.	10
7.	Write short note on any four of the following :-		20
	(a)	Race condition
	(b)	VM Ware
	(c)	Monolithic Vs Micro Kernels
	(d)	Shared OS Configuration for multi Processor System.
	(e)	d