
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

IGNOU UNIVERSITY MCA - II (SEM 4) JUN 2010 : Operating Systems

4 pages, 18 questions, 0 questions with responses, 0 total responses,

	mca_india	+Fave Message
	Profile Timeline Uploads Q & A

Home > mca_india >

Formatting page ...

No. of Printed Pages : 4 MCS-041 I MCA (Revised) Term-End Examination cN1 June, 2010 MCS-041 : OPERATING SYSTEMS Maximum Marks :100 (Weightage : 75%) Time : 3 hours Note : Question No. 1 is compulsory. Attempt any three questions from the rest. 1. (a) For the given five processes arriving at time 10 0, in the order of the length of CPU time in millisecond : CPU time P1 8 P2 4 P3 6 P4 1 P5 5 Consider SJF and FCFS scheduling algorithms for the above processes; which algorithm of the two will give minimum Average Turn around time and why ? MCS-041 1 P.T.O. (b) A system contains 10 units of resource R1. The resource requirement of 3 user processes P1, P2, P3 can be summarised as : P1 P2 P3 Max. Requirement 7 4 5 Current Allocation 3 2 3 Is the current allocation state feasible and safe ? Apply Banker's Algorithm to check it. If a new request of (2, 1, 0) arises, check whether it will be granted or not using Banker's Algorithm ? Explain what causes the thrashing ? Suggest the mechanism to avoid the thrashing. Discuss Lamport's Algorithm in distributed system. Estimate the cost of communication of Lamport's algorithm. (e) Compare and contrast the architecture of WINDOWS OS with UNIX OS. 2. 10 5 7 8 (a) What is a semaphore ? Give a solution to 10 'Readers - Writers' problem using semaphore. Explain the steps. (b) Explain SCAN and LOOK disk scheduling 6 algorithm with suitable diagrams for the given example. Starting clinder is 100 in the direction of increasing cylinder number. Cylinder request : 150, 160, 184, 90, 58, 55, 39, 38, 18 MCS-041 2 (c) How can we implement security and Reliability in Distributed Operating System ? 4 (a) Explain multistage switch based system in Maultiprocess system. With the help of diagrams, explain the 4 concept of demand paging and demand segmentation. For a page Reference string as : 3. 10 6 0, 1, 2, 6, 9, 4, 5, 0, 2, 6, 3, 8 and with 3 memory frames, calculate the no. of page faults using : OPT LRU Page replacement algorithms. (a) Explain the implementation of RPC in a distributed system. 5 Explain memory organisation in UNIX. Draw appropriate diagrams. 4. 5 How is booting done in WINDOWS 2000 operating system ? Explain windows process and threads with the help of a suitable diagram. MCS-041 3 10 P.T.O. 5. (a) Explain Chaining and Indexing disk 10 allocation schemes with the help of a suitable example. Explain 'address translation' by direct 5 mapping and associative mapping. Discuss two alterative forms of 5 authentication. MCS-041 4

Formatting page ...

Additional Info : Mca - II (sem 4) June 2010 Question Paper - Operating Systems (Revised Course)
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers

mca_india chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: