USN

C BYREGOWDA INSTITUTE OF TECHNOLOGY

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

Question Module-1 Marks

number
1 a) Demonstrate the concept of Virtual machine with an example 6M

b) Explain the types of Multiprocessing system and the types of 6M

clustering.
c) Explain the role of Operating System from different viewpoints. Explain the dual 8M
mode of operation system.
[OR]
2 a) Explain the different states of a process, with a neat diagram.. 6M
b) Describe the implementation of interprocess communication using shared memory 8M
and message passing.
c) Demonstrate the operations of process creation and process 6M
termination in Unix
Module-2
3 a) Describe term monitor. Explain solution to dining philosopher’s problem using 4M
monitor.
b) Discuss the threading issues that come with multithreaded program 8M
c) Illustrate how Reader’s-Writer’s problem can be solved by using semaphores. 8M
[OR]
4 a) Explain three requirements that a solution to critical –section problem must satisfy. 6M
b) Explain any one synchronization problem for testing newly proposed sync scheme. 6M
c) Consider the following set of process with CPU burst time(ms) 8M
Processes Arrival Time Burst Time
P0 0 9
P1 1 4
P2 2 6
P3 3 5
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) Discuss the various approaches used for deadlock recovery 6M
b) With a diagram discuss the steps involved in handling a page fault? 6M
 c) Determine whether the following system is in safe state by using Banker’s algorithm. 8M
Find the need Matrix and calculate safe sequence. Mention the below system is safe
or not safe.

Process Allocation Maximum Available

A B C A B C A B C
P0 0 0 2 0 0 4 1 0 2
P1 1 0 0 2 0 1
P2 1 3 5 1 3 7
P3 6 3 2 8 4 2
P4 1 4 3 1 5 7
[OR]
6 a) Write the short note on 6M
i) Internal and External fragmentation?
ii) Dynamic loading and linking?
b) Memory partitions of 200kb,700 kb,500 kb,300kb, 100 kb, 400kb are available how 6M
would best worst, first fit algorithm to place processes 315k,427k,250k,550k in
order. Which is the best algorithm?
c) What is Paging? Explain paging hardware with translation look-aside buffer? 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 8M
page faults while using fcfs and lru using 2 frames?
b) Illustrate how demand paging affects systems performance 8M
c) Describe various file access methods? 4M
[OR]
8 a) Explain the following i)file types ii)file operation iii)file attributes? 6M
b) Explain the various types of directory structures. 6M
c) Write a short note on linked and indexed allocation method with a 8M
neat diagram
Module-5
9 a) Explain the access matrix model of implementing protection in operating system. 6M
b) Explain the following disk scheduling algorithm in brief with 8M
examples
i. FCFS scheduling
ii. SSTF scheduling
iii. SCAN scheduling
iv. LOOK scheduling
c) What are the three methods for allocating disk space? Explain 6M
[OR]
10 a) Explain the design principle of Linux 8M

b) Explain the process management model of linux operating system? 8M

c) Discuss the various components of linux system? 6M