Scribd
Upload
13 views

Questions

This document outlines the examination structure for the Operating Systems course at RV College of Engineering, detailing the format and instructions for candidates. It includes two parts: Part A consists of short answer questions, while Part B contains longer questions requiring in-depth responses. The exam covers various topics such as process scheduling, memory management, and deadlock handling.

Uploaded by

djk17
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Questions

This document outlines the examination structure for the Operating Systems course at RV College of Engineering, detailing the format and instructions for candidates. It includes two parts: Part A consists of short answer questions, while Part B contains longer questions requiring in-depth responses. The exam covers various topics such as process scheduling, memory management, and deadlock handling.

Uploaded by

djk17
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

18CS34

USN

RV COLLEGE OF ENGINEERING®
(An Autonomous Institution affiliated to VTU)
III Semester B. E. Fast Track Examinations Oct-2020
Computer Science and Engineering
OPERATING SYSTEMS
Time: 03 Hours Maximum Marks: 100
Instructions to candidates:
1. Answer all questions from Part A. Part A questions should be answered
in first three pages of the answer book only.
2. Answer FIVE full questions from Part B. In Part B question number 2, 7
and 8 are compulsory. Answer any one full question from 3 and 4 & one
full question from 5 and 6.

PART-A

1 1.1 List any four classes of operating system. 02


1.2 List any four design principles for design of operating system 02
1.3 Write the ouput of the following program:
𝑖𝑛𝑡 𝑚𝑎𝑖𝑛 ()
{
𝑖𝑓 (𝑓𝑜𝑟𝑘 () ∶ : 𝑓𝑜𝑟𝑘 )
𝑓𝑜𝑟𝑘();
𝑝𝑟𝑖𝑛𝑡 (“1”);
𝑟𝑒𝑡𝑢𝑟𝑛 0;
} 02
1.4 Justify the statement, “ thread is a light weight process” 02
1.5 Differentiate between fork and vfork system calls 02
1.6 Consider three processes (process id 0,1 & 2 respectively) with
compute time burst 2, 4 and 8 times units. All processes arrive at time
zero. Considering longest remaining time first (𝐿𝑅𝑇𝐹), calculate the
average turnaround time (𝐿𝑅𝑇𝐹). 02
1.7 Illustrate with example how an improper use of semaphore leads to
deadlock. 02
1.8 Consider a paging system with 𝑇𝐿𝐵. If it takes 20 𝑛𝑠 to search 𝑇𝐿𝐵 and
100 𝑛𝑠 to access a memory, what is the effective memory access time
with 98 percent hit ratio. 02
1.9 Justify the statement: “Presence of cycle in Resource Allocation
Graph is not sufficient condition for dead lock”. 02
1.10 Differentiate between monolithic level & microkernel 02

PART-B

2 a Discuss various approaches to design operating system structure. 06


b Write a program to demonstrate following 𝑈𝑁𝐼𝑋 system calls:
i) Fork
ii) Wait
iii) Exec (any variant). 06
c Give a proper insight into “How evolution in computing influenced
different classes of operating system”. 04

3 a Compare process scheduling protocols- First came first serve (𝐹𝐶𝐹𝑆),


shortest job first, priority and round robin on basis of their
performance and algorithm complexity. 06
b Give solution for the following critical section problem:
i) Producer consumer problem
ii) Dining philosopher problem. 10

OR

4 a Consider a following set of processes with a length of the 𝐶𝑃𝑈 burst


time given in milliseconds.

𝑃𝑟𝑜𝑐𝑒𝑠𝑠 𝐴𝑟𝑟𝑖𝑣𝑎𝑙 𝑇𝑖𝑚𝑒 𝐵𝑢𝑟𝑠𝑡 𝑇𝑖𝑚𝑒 𝑃𝑟𝑖𝑜𝑟𝑖𝑡𝑦


𝑃 0 7 3
𝑃 3 2 2
𝑃 4 3 1
𝑃 4 1 1
𝑃 5 3 3

i) Draw Gantt chart illustrating the execution of these


processes using shortest job first (preemptive), priority
(preemptive) and round robin (time slice = 2 𝑚𝑠)
ii) Compute average waiting, average turnaround and average
response time. 10
b Describe the process scheduling in linear operating system. 06

5 a Given five memory partitions of 100 𝐾𝐵, 500 𝐾𝐵, 200 𝐾𝐵, 300 𝐾𝐵 and
600 𝐾𝐵 in order, how would first fit, best fit and worst fit algorithms
place processes of 212 𝐾𝐵, 417 𝐾𝐵, 112 𝐾𝐵 and 426 𝐾𝐵 in order? Which
algorithm makes the most efficient use of memory? 08
b With a neat diagram explain the basic paging scheme of memory
management. Also discuss the hardware support for paging. 08

OR

6 a What are logical and physical address space? Justify how memory
management helps programmer to have larger logical address
compared to available physical memory. 08
b Consider the following page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
How many page facility will occur by 𝐿𝑅𝑈, 𝐹𝐼𝐹𝑂 and optimal page
replacement algorithms, assuming 5 free frames. 08

7 a What is thrashing? What are the causes for thrashing? Discuss the
mechanism to prevent it. 06
b Suppose on a disk with 5000 cylinders, number 0 to 4999. The drive is
currently serving a request at cylinder 143. The queue of pending
requests in 𝐹𝐼𝐹𝑂 order is 𝐵6, 1470, 913, 1774, 948, 1509, 1022, 1250, 130
starting from the current position what is the total number of disk
moves for the following algorithms
i) shortest seek time first (𝑆𝑆𝑇𝐹)
ii) 𝑆𝐶𝐴𝑀
iii) 𝐿𝑂𝑂𝐾. 10

8 a What is deadlock? Explain. Discuss different ways of handling


deadlock. 08
b Consider the following snapshot of a system.

𝐴𝑙𝑙𝑜𝑐𝑎𝑡𝑖𝑜𝑛 𝑀𝑎𝑥
𝑃𝑟𝑜𝑐𝑒𝑠𝑠
𝐴 𝐵 𝐶 𝐷 𝐴 𝐵 𝐶 𝐷
𝑃 0 0 1 2 0 0 1 2
𝑃 1 0 0 0 1 7 5 0
𝑃 1 3 5 4 2 3 5 6
𝑃 0 6 3 2 0 6 5 2
𝑃 0 0 1 4 0 6 5 6

The available resources are 𝐴 = 1, 𝐵 = 5, 𝐶 = 2 and 𝐷 = 0.


i) What is the content of matrix 𝑁𝐸𝐸𝐷
ii) Is the system in safe state? If so give the safe sequence.
iii) If a request from process 𝑃1 arrives for (0 4 2 0), can the
request be granted immediately. 08

You might also like