21CS56

USN 1 B Y

BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT

(An Autonomous Institute affiliated to Visvesvaraya Technological University, Belagavi)
SEMESTER END EXAMINATION MODEL QUESTION PAPER

Fifth Semester B.E. Degree Examination

Regular / Make-up / Arrears / Supplementary

OPERATING SYSTEMS
Time: 3 hrs. Max. Marks: 100

Note:
1. Part A carries 20 marks. Answer all TWENTY full questions, by choosing ONE Correct option.
2. The correct option is to be shaded in the OMR sheet provided within the Booklet.
3. There is no Negative Marking, but Shading more than 1 option, will lead to rejection of the particular
question for scoring.
4. Part B carries 80 Marks. Answer FIVE full questions, choosing ONE full question from each module.

Q. PART A Marks CO, RBT

No Multiple Choice Questions

01 Symmetric multiprocessing architecture of the computer system uses shared 01 CO1, K2

a. bus
b. memory
c. processors
d. both a and b
02 What else is a command interpreter called? 01 CO1, K2
a. prompt
b. kernel
c. shell
d. command
03 The Operating System Works between 01 CO1, K2
a Network and User
b. User and Computer
c. One user to another user
d. All of the above
04 What is not the function of the Operating System? 01 CO1, K2
a. Virus protection
b. Disk Management
c. Memory Management
Application Management
05 Multi-processor system gives a 01 CO1, K2
a. small system
b. tightly coupled system
c. loosely coupled system
d. both a and b
 21CS56

06 Multiprocessor system have advantage of 01 CO1, K2

a. Increased Throughput
b. Expensive hardware
c. operating system
d. both a and b

07 Controller of the computer system transfers data from device to 01 CO1, K2

a. buffers
b. cache
c. registers
indexes
08 To start an I/O operation the device driver loads the appropriate register into? 01 CO1, K2
a. memory
b. Secondary storage
c. Device Controller
Arrays
09 01 CO2, K1
In asymmetric clustering other machines perform operations while one machine
is in
a. hot standby mode
b. standby mode
c. reset mode
d. undefined mode

10 Table of pointers for interrupt to be executed contains the 01 CO2, K2

a. interrupts
b. programs
c. addresses
compilers
11 Kernel mode of operating system runs when the mode bit is 01 CO2, K2
a. 1
b. 0
c. x
d. undefined

12 Process synchronization of programs is done by 01 CO2, K2

a. input
b. output
c. operating system
d. memory

13 In operating system, a software may triggers an interrupt executing a special 01 CO2, K1

operation it is called as?
a. System Call
b. Application Call
c. software Call
kernel call
14 A process needs 01 CO2, K1
a. through put to execute
b. timer to execute
c. resources to execute
both a and b
 21CS56

15 Response time in time sharing of operating system is usually 01 CO2, K1

a. 1sec
b. 1sec
c. less than 1sec
more than 1sec
16 All jobs of OS are not kept in main memory due to its small size so where they 01 CO5, K2
resides on disk
a. in RAM
b. in job pool
c. in ROM
in CD
17 Running many operating systems on one core system is called 01 CO1, K2
a. virtualization
b. clouding
c. sharing
both a and b
18 Out of these page replacement algorithms, which one suffers from Belady’s 01 CO4, K2
anomaly?
a. LRU
b. FIFO
c. Both LRU and FIFO
d. Optimal Page Replacement
19 The Virtual memory is: 01 CO3, K1
a. An illusion of a large main memory
b. A large main memory
c. A large secondary memory
d. None of the above
20 Thrashing occurs in a system when: 01 CO3, K1
a. The processes on the system access pages and not memory frequently
b. A page fault pops up
c. The processes on the system are in running state
d. The processes on the system are in the waiting state

PART B
Descriptive Questions

Q. No Module – 1 Marks CO, RBT

1a. Define Operating System. Explain the Services provided by OS 8 CO1, K2

1b. Explain the Operating System Structure in Layered approach with a neat 8 CO1, K2
diagram.
OR
2a. Define System call. List the types of System Call in detail. 8 CO1, K2
2b. Define the essential properties of the following operating systems: i) 8 CO1, K2
Time sharing operating system
ii) Batch operating system
iii) Real time operating system
iv) Distributed operating system.
 21CS56

Module – 2
3a. Consider the following set of processes with a length of the CPU burst 8 CO2, K3
time given in milliseconds

i.Draw the Gantt charts illustrating the execution of these processes using
SRTF and Preemptive Priority scheduling.
ii.Compute the waiting times in each of the two scheduling
iii) Find which of them provides results in the minimal average waiting
time and turnaround time.

3b. State in your own words, the use of semaphores in solving the 8 CO2, K2
synchronization problem – Readers writers problem.

OR
4a. Consider the Dining Philosophers problem. If we arbitrarily decide that if 8 CO2, K2
a philosopher who has their left fork waits a random amount of time after
failing to acquire the right-hand fork before attempting to acquire it again,
will this remove the ability for the system to reach deadlock? Why or why
not.
4b. Differentiate between starvation and deadlock. Does Peterson’s Solution 8 CO2, K3
to critical section problem prevents starvation? Justify your answer

Module – 3
5a. Consider the following snapshot of a system. 8 CO3, K2

Answer the following questions using Banker’s algorithm.

i) What is the content of the matrix need?
ii) Is the system in a safe state?
iii) If yes, write the safe sequence.
Mention any two conditions on which Deadlock may occur?
5b. Elaborate on Hold and Wait condition with respect to deadlock prevention 8 CO3, K2
considering an example.
OR
6a. Consider a system with 80% hit ratio, 50 ns time to search the associative CO3, K2
registers, 750 ns time to access memory. Find the time to access a page 8
a. When the page number is in associative memory.
b. When the page number not in associative memory.
 21CS56

c. Find the effective memory access time.

6b. 8 CO3, K2
Given memory partitions of 100k ,500k,200k, 300k and 600k( in order)
how would each of first fit , best fit and worst fit algorithms work place
process of 212k,417k,112k, and 426k ( in order)? Which algorithm makes
the most efficient use of memory ?

Module – 4
7a. Consider the following page reference string: 7, 6, 8, 6, 7, 9, 6, 7, 5, 6, 9, CO4, K2
5, 8, 7, 8, 5, 7, 6, 4, 8. How many page faults would occur for the following 8
replacement algorithms, assuming, three and five frames:
a. LRU replacement
b. FIFO replacement
c. Optimal replacement
7b. With the help of supporting hardware diagram show how the TLB 8 CO4, K2
improves the performance of demand paging
OR
8a. Explain the following: i) File types ii) File operation. iii) File attributes 8 CO4, K2
8b. Compare the working of the following disk scheduling algorithms: i) 8 CO4, K2
SSTF ii) SCAN iii) LOOK
Module – 5
9a. Describe the benefits of virtualization. 8 CO5, K2
9b. Compare the features of Android and iOS 8 CO5, K2
OR
10a. Explain the different types of Virtual Machine with implementation 8 CO5, K2
10b. Explain the structure of Android and iOS System Architecture. 8 CO5, K2

Course Outcomes (COs):

COs At the end of the course, the student will be able to
CO-1 Describe the structure of OS and basic architectural components involved in OS.
CO-2 Analyze various resource management techniques
CO-3 Apply the concepts to solve scheduling and allocation problems
CO-4 Demonstrate the Deadlock, file system and virtualization concepts
CO-5 Compare iOS with Android
K1- Remembering K2 - Understanding K3 – Applying K4- Analyzing K5 - Evaluating K6 -Creating

“Satisfaction lies in the effort, not in the attainment, full effort is full victory”