My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: Chithra Member Level: Gold Posted Date: 25 May 2008
|
2007 Indira Gandhi National Open University (IGNOU) M.C.A Computer Aplications CS-13 : OPERATING SYSTEMS Question paper
ADCA / MCA (III Year)
Term- End Examination
December , 2007
CS-13 : OPERATING SYSTEMS
Time : 3 hours Maximum Marks : 75
Note : Question number 1 is compulsory . Answer any three questions from the rest.
1. (a) Define deadlock with example. List the four necessary conditions for the deadlock occurrence. Also explain deadlock prevention methods. (Marks 8)
(b) Describe Belady’s anomaly with an example. Does it occur in all page replacement algorithms? (Marks 7)
(c) Expalin Producers / Consumers problem in concurrent programming, with an example. (Mark 5)
(d) Define the terms mutual exclusion and semaphores with examples. (Mark 5)
(e) What is thrashing? Explain its causes. Give examples. (Mark 5)
2 (a) Explain Ricart and Agarwala’s Algorithm for ordering of events in
distributed operating system environment. (Mark 7)
(b) If memory access time is 250 nsec; search time in TLB is 25 nsec; hit ratio is 80%; calculate effective memory access time. (Mark 3)
(c) Write the types of multiprocessor OS (Mark 5)
3. (a) For the following processes and CPU burst time
(Note : All the processes arrived at the same time)
Process
P1, P2 ,P3,P4
Burst time
1, 4,3,2
(i) Draw Ganttcharts showing the execution of processes for
(a) SJF
(b) Round Robin Scheduling (quantum 1)
(ii) Calculate the waiting time and turnaround time of each process for above scheduling algorithms. (Mark 6)
(c) Explain Dekker’s solution to mutual exclusion problem, with an example.
(Mark 6)
(d) Explain Access –matrix model for protection, with an example. (Mark 3)
4. (a) Explain the concept of paged segmentation. What are its overheads? (Mark 5)
(b) List and explain the disk allocation methods in an operating system. (Mark 5)
(e) Explain take –grant model for protection of a system (Mark 5)
5.(a) List the similarity and difference between multiprocessor and distributed systems. (Mark 5)
(b) Explain the concept of working set model with an example. (Mark 5)
(c) Explain single –stage and multi-stage interconnection networks with examples. (Mark 5)
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|