Scribd
Upload
12 views4 pages

18CS34

This document outlines the examination structure for the Operating Systems course at RV College of Engineering for the III Semester B.E. in Computer Science and Engineering. It includes instructions for candidates, a breakdown of Part A and Part B questions, and various topics such as process creation, scheduling algorithms, memory management, and deadlock detection. The exam is designed to assess students' understanding of key operating system concepts and their ability to apply these concepts in practical scenarios.

Uploaded by

sachetan2005
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
12 views4 pages

18CS34

This document outlines the examination structure for the Operating Systems course at RV College of Engineering for the III Semester B.E. in Computer Science and Engineering. It includes instructions for candidates, a breakdown of Part A and Part B questions, and various topics such as process creation, scheduling algorithms, memory management, and deadlock detection. The exam is designed to assess students' understanding of key operating system concepts and their ability to apply these concepts in practical scenarios.

Uploaded by

sachetan2005
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/ 4

18CS34

USN
RV COLLEGE OF ENGINEERING®
(An Autonomous Institution affiliated to VTU)
III Semester B. E. Examinations April/May-2023
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 What is copy-on-write in process creation? What is it’s advantage. 02
1.2 Analyze the code below and create parent-child relationship tree to
determine number of process.

02
1.3 In additional reference bit algorithm, In the given table the next frame
selected for replacement is ___________. Give reason.

02
1.4 If the total number of available frames is , and there are processes
one of pages and the other of pages then calculate number of
frames allocated to each of these processes using proportional
allocation method. 02
1.5 Even if number of frames are increased, ___________ algorithm may
result in increased number of page faults. This scenario is known as
___________. 02
1.6 Construct a wait-for-graph for resource allocation graph below and
determine if there exist a deadlock.

02
1.7 How the operating system and other processes are protected from being
modified by an already running process? 02
1.8 What are the three main goals of an operating systems? 02
1.9 At a particular time of computation the value of a counting semaphore
is then operations and operations were completed on this
semaphore determine the resulting value of the semaphore. 02
1.10 Assuming page size and logical address space size, what are
the page numbers and offsets for the following address references:
i)
ii) 02

PART-B

2 a Elucidate with the help of neat diagram the dual mode of operation and
it’s purpose in operating systems? Which of the following instructions
need to execute in privileged mode or user mode, give reason.
i) Printing file on printer
ii) Create a child process
iii) Sorting list of numbers
iv) Read the clock 08
b Design a program to create child process from same parent, where
is read from user as a command line argument. Each child should print
message “Hi from child with parent ”, where is the process
of the child and parent. The parent process should wait for all the
children to exit first. 08

3 a Consider the following set of processes with a length of the burst


time given in milliseconds:

Draw Gantt charts illustrating the execution of these processes using


Preemptive , Preemptive Priority (lower number higher priority) and
Round Robin (Time slice= ). Compute the average waiting time,
average turnaround time and number of context switches in each
approach. 10
b Describe the circumstances under which to use spinlocks, mutex locks,
semaphores and condition variables. In each case with an example,
explain why the mechanism is needed or appropriate for. 06

OR

4 a Compare preemptive and non-preemptive scheduling with respect


to basic approach, advantages and disadvantages. 06
b Discuss the producer-consumer problem and propose a solution to
satisfy the critical section requirement. 05
c Describe testandset() instruction and explain how it can be used to
provide mutual exclusion that satisfies bounded waiting for
processes. 05

5 a Differentiate paging and segmentation memory management scheme.


With the help of a neat diagram discuss the logical address to physical
address translation in segmentation memory management scheme. 10
b Consider six memory partitions of size , ,
, and . These partitions need to be allocated
to four processes of sizes in that order. Identify
the block allocation by best fit, first fit and worst fit strategy. Determine
the internal and external fragmentation. 06

OR

6 a Consider a reference string: The number of frames in


the memory is Find out the number of page faults respective to:
Optimal and page replacement algorithms. 06
b With respect to implementation of virtual memory bring out the
relationship between all of the following with a neat diagram and
explanation:
Valid-invalid bit, Dirty bit, Swap Space, Page table, , trap 10

7 a Suppose that a disk drive has cylinders, numbered to The


drive is currently serving a request at cylinder , and the previous
request was at cylinder . The queue of pending requests, in
order, is : Starting
from the current head position, what is the total distance (in cylinders)
that the disk arm moves to satisfy all the pending requests for each of
the following disk-scheduling algorithms? Show your work to support
your answer.
i)
ii) (right)
iii) (right) 06
b Illustrate with the help of a neat diagram how kernel supports
Open, operation on files. 06
c Develop a program to implement move command ( ) in Linux
operating systems using file system . 04

8 a Consider the following resource allocation graph.


Do the following problems:
i) Convert it to the matrix representation (i.e, Allocation, request
and Available).
ii) Do a step-by step execution of the deadlock detection
algorithm.
iii) Is there a deadlock? If there is a deadlock, which processes are
involved? 10
b What are the different strategies for handling deadlock? Discuss any
one strategy in detail. 06

You might also like