Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

C Byregowda Institute of Technology: Department: Computer Science and Engineering

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

USN

C BYREGOWDA INSTITUTE OF TECHNOLOGY


Department: Computer Science and Engineering
Model Question paper 1
OPERATING SYSTEMS(15CS64)
Duration: 03 hrs Max Marks: 80
Note: Answer five full questions, choosing one full question from each module

Question Module-1 Marks


number
1 a) Define OS. Discuss its role from different perspectives. 6M

b) Explain the concept of virtual machines. Bring out its advantages. 4M

c) What do you mean by PCB? Where is it used? What are its contents? Explain. 6M

[OR]
2 a) What are system calls? With examples explain different categories of system call? 6M

b) Explain direct and indirect communications of message passing systems 4M

c)List different services of OS. Explain. 6M

Module-2
3 a) Describe term monitor. Explain solution to dining philosopher’s problem using 5M
monitor.
b) What are semaphores? Explain solution to producer-consumer problem using semaphores 6M
c) Explain any one synchronization problem for testing newly proposed sync scheme. 5M

[OR]
4 a) State dining philosopher’s problem and give a solution using semaphores Write structure 4M

of philosopher.
b) Explain three requirements that a solution to critical –section problem must satisfy. 4M

c) Consider the following set of process with CPU burst time(ms) 8M

Processes Arrival Time Burst Time


P0 0 6
P1 1 3
P2 2 1
P3 3 4
i)Draw Gantt chart illustrating the execution of above process using
FCFS,SRTF and non Preemptive SJF.Find average waiting time and average
Turnaround time.

Module-3
5 a) What is deadlock. Describe necessary conditions for a deadlock situation to arise. 5M
b) With a diagram discuss the steps involved in handling a page fault? 6M

c) Memory partitions of 100kb,500 kb,200 kb,300kb,600 kb are available how would best 5M

worst, first fit algorithm to place processes 212,417,112,426 in order. which is the best
algorithm?
[OR]
6 a) Differentiate between internal and external fragmentation? 4M

b) Why is deadlock state more critical than starvation? Describe resource allocation graph 4M
with a deadlock, with a cycle but no deadlock.
c) write the Bankers algorithem 8M

Module-4
7 a) Consider the reference stream 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.how many page 8M

faults while using fcfs and lru?


b) What is thrashing? what are causes? 4M

c)Describe various file access methods? 4M

[OR]
8 a ) Mention different file attributes and file types? 4M

b) Explain the method used for implementing directories? 4M

c)Consider the following reference string?1,2,3,4,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 8M

How many page faults using 2 frames?


Module-5
9 a) What are the three methods for allocating disk space? Explain 6M

b) Explain the process management model of Linux operating system? 5M

c) What is protection goals and principles? 5M

[OR]
10 a) Explain various disk scheduling algorithms? 8M

b) Write short notes on Revocation of access rights. 4M

c) Explain the access matrix structure employed in protection domain? 4M

You might also like