P.E.S.

College of Engineering, Mandya

(An Autonomous Institution affiliated to VTU, Belagavi)
Department of Computer Science and Engineering
Fifth Semester B.E (CS&E)
Model Question Paper
Operating System(Integrated) (P22CS504)
---------------------------------------------------------------------------------------------------------------------------------------------------------------
Note: i) Part – A is compulsory, One question from each unit
ii) Part – B: Answer Two sub questions from each unit for 18 marks
Q. No. Questions Marks Bloom’s Taxonomy

PART – A 10 BL CO PO
Unit – I to V
a Outline operating system in user and system view. 2 L2 1 1,12
b Summarize the benefits of multithreaded programming 2 L2 1 1,12
1 c Compare long term and short term scheduler 2 L4 3 1,2,3
d Infer the cause for thrashing, 2 L4 3 1,2,3
e Mention one advantage and disadvantage of contiguous allocation method 2 L2 1 1,12
PART – B 90
Unit – I 18
a List and explain the services provided by operating system. 9 L2 1 1,12
2 b Illustrate the layered approach design of operating system along with advantages
9 L2 1 1,12
and disadvantages
c What are cooperating processes? Explain Shared memory model of inter process
9 L2 2 1,2,3,5
communication.
Unit - II 18
a List and brief five present challenges in programming for multi core systems. 9 L4 3 1,2,3
b Analyze the occurrence of Race condition in producer and consumer
3 9 L4 3 1,2,3
processes
c Discuss any one problems of synchronization. 9 L4 2 1,2,3,5
Unit - III 18
a Consider the following set of processes with CPU burst time given in ms.
Process Burst time Arrival time
4 P1 8 0
P2 4 1
P3 9 2 12 L3 2 1,2,3,5
P4 5 3
i) Draw the Gantt charts of execution using FCFS, preemptive SJF and round robin
(time slice=1ms).
ii) Calculate the average waiting and turn around time using above algorithms.
b Consider the following snapshot of system:
Process Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6 12 L3 2 1,2,3,5
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following question using Bankers’algorithm;
i) What is the content of the need matrix.
ii) Is the system in a safe state?
c construct wait for graph from Resource allocation graph with explanation 6 L3 3 1,2,3
 Unit – IV 18
a Compare internal and external fragmentation 6 L4 3 1,2,3
b Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB
(in order), how would each of the first fit, best fit and worst fit algorithms
5 12 L4 3 1,2,3
place processes of 212 KB, 417 KB, 112 KB and 426 KB(in order)? Which
algorithm makes the most efficient use of memory?
c List the steps of action taken in handling a page fault along with figure 12 L4 3 1,2,3
Unit – V 18
a Explain file attributes and file types in a file system . 12 L2 1 1,12
6 b Explain contiguous, Linked and Indexed methods of allocating disk space 12 L2 1 1,12
along with figure.
c Consider a disk queue with requests for I/O to blocks on cylinders in the
order 98, 183, 37, 122, 14, 124, 65, 67. If the disk head is initially at
cylinder 53, find the number of head movements using the following 6 L3 2 1,2,3,5
algorithms along with graphical representation
i)FCFS (ii)SSTF

*****