Operating Systems For Computational Devices Semester 5 (December 2013)

Operating Systems For Computational Devices Semester 5 (Revised Course) (3 Hours) December 2013
LJ-11275 [Total Marks : 100]
N.B:	(1)	Questions No. 1 is compulsory.
	(2)	Answers any four questions form remaining six questions.
1.	(a)	What is Kernel? Describe briefly the approaches of designing kernel.	05
	(b)	What is real time operating system? Write the characteristics of real time operating system.	05
	(c)	In typical process state transition diagrams. Clearly state under what condition the following state transitions occurs?      (i) Running to ready     (ii) Running to waiting     (iii) Waiting to ready	05
	(d)	What is Programmed I/O? Describe in brief.	05
2.	(a)	Consider a system running 10 I/O bound tasks and one CPU bound task. Assume that I/O bound task issues an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 millisecond and that all processes are long running tasks. What is the CPU utilization for round Robin Schedular when:   (i) The time quantum is 1 Millisecond   (ii) The time quantum is 10 millisecond	10
	(b)	Describe the implementation of file allocation techniques.	10
3.	(a)	What is meant by interposes communication? Explain shared memory and message passing.	10
	(b)	Consider the following page traces in demand paging system with 4 page frames:- 2, 3, 1, 2, 4, 3, 2, 5, 3, 6, 7, 9, 3, 7. Determine the number of page faults and hit ratio using FIFO and LRU page replacement algorithms.	10
4.	(a)	Consider the following system snapshot using data structure in the Banker's algorithm.   Process Max A B C D Allocation A B C D Available A B C D P0 6 0 1 2 4 0 0 1 3 2 1 1 P1 1 7 5 0 1 1 0 0   P2 2 3 5 6 1 2 5 4   P3 1 6 5 3 0 6 3 3   P4 1 6 5 6 0 2 1 2   Using Banker's algorithm's answer the following questions :-   (i) How many resources to type A, B, C and D are there?   (ii) What are the contents of need matrix?   (iii) Is the system is in safe state? Find the sate sequence if it is.	10
	(b)	Draw and explain architecture of RTOs.	10
5.	(a)	Suggest the implementation of binary semaphore that avoids the busy waiting.	10
	(b)	A 16 bit computer has page size of 1024 bytes. The page table of process is as follows:   Page No. Frame No. 0 7 1 2 2 5 3 1 4 12 5 6 6 6 7 0 Determine the physical address corresponds to logical address.     (i)   3720          (ii) 1125	10
6.	(a)	On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arm must move to satisfy all request in the disk queue. Assume the last request serviced was at track 345 and the head is moving towards track 0, the queue in FIFO order contains request for the following tracks :   123,  874, 692, 475, 105, 376 perform the computation for the following scheduling algorithms :-    (i)  FIFO     (ii) SSTF     (iii) SCAN.	10
	(b)	What is thread? Explain user level threads and kernes level threads.	10
7.	Write short note on the following  :-		20
	(a)	Nos.
	(b)	Different types of dchedular.
	(c)	Distributed O.S.
	(d)

Also see Operating systems for computational devices question papers for May 2013