U.S.N.

BMS College of Engineering, Bangalore-560019

(Autonomous Institute, Affiliated to VTU, Belgaum)
May 2016 Semester End Main Examinations
Course: Operating Systems Concepts Duration: 3 hrs
Course Code: 12ES6GE2OS Max Marks: 100

Date: 13.05.2016
Instructions:
UNIT 1
1 a Describe different classes of operating system. Differentiate hard and soft real time 10
system.
b Describe the common tasks performed by an OS 6
c A program is in a dormant state if it is not engaged in any activity (it may be waiting for 4
an action by a user).Comment on the validity of the following statement “A dormant
program also consumes resources”.
UNIT 2
2 a Given Given the information in the table below, compute the average turnaround time , 10
average waiting time of the processes also specify the scheduling order of the
processes if HRN and SRN algorithms are used

Processes P1 P2 P3 P4 P5
Arrival time 0 2 3 4 8
Service time 3 3 5 2 3
b Define Paging and Segmentation. Compare 10
i) contiguous and non-contiguous memory allocation
ii)Pre-emptive and non-preemptive scheduling
UNIT 3
3 a What is virtual memory. Explain demand paging with advantages and limitations. 08
b What are the functions of virtual memory manager? 05
c Compare optimal and FIFO page replacement policies for 07

Page reference string 0, 1, 0, 2, 0, 1, 2…….

Reference time string t1, t2, t3, t4, t5, t6, t7……..
OR
4 a Describe the different operations being performed on files. 06
b Discuss linked and indexed type disk allocation to files 08
c Explain sequential and random file access mechanism. 06
UNIT 4
5 a what is message passing? Explain buffering and delivery of Interprocess messages 6

b What are resource deadlocks? Explain the conditions for resource deadlocks. 6
c Explain deadlock detection algorithm. 8
OR
6 a Explain the technique of implementation of message passing in UNIX OS . 10
b Discuss graph models with an example. 10
UNIT 5
7 a Describe Virtual machine operating system 5
b Explain monolithic operating system 5
c Explain the Kernel-based operating system and mechanisms in a kernel 10
*******
 U.S.N.

BMS College of Engineering, Bangalore-560019

(Autonomous Institute, Affiliated to VTU, Belgaum)
May 2017 Semester End Main Examinations
Course: OPERATING SYSTEM Duration: 3 Hours
Course Code: 16EC6DE20S Max Marks: 100
Date: 19.05.2017
Instructions: Answer five full questions

UNIT-1
1. a An OS design demands abstract views. Comment on this statement. State what are 06
Abstract views

b Discuss principles of working of Real time operating systems. Illustrate software 06

design done to implement time Real time Operating systems

c List problems in monolithic OS. Illustrate Kernel based OS design aspects. 08

OR
2. a What is context switching? Illustrate series of operations involved to realize context 06
switching

b Compare the operations of time sharing operating system with that of distributed 08
operating system.

c It is required to run different varieties of OS on a single hardware. Propose the 06

solution for the same and listing difficulties to realize the same.

UNIT-2
3. a Define process. Discuss data structures in process control block. 05

b List advantages of threads. Illustrate working principles and advantages of User level 05
threads.

c Discuss problems related to bad synchronization among processes. Suggest solutions 06

for the same.

d With schematic of operation, illustrate terminologies employed in scheduling. 04

OR
4. a A process has a state and state transitions in a computer. If so, give reasons for these 05
transitions and highlight responsibilities of OS during these transitions.
 b Illustrate a situation where race conditions evolves in the system and propose Solution 05
which has critical section and mutual exclusion.

c Illustrate solution of semaphore in concurrent operating systems in program 05

constructs.

d For the following processes shown below calculate the turnaround and weighted 05
turnaround time for SRN scheduling policy.
Process P1 P2 P3 P4 P5
Arrival 0 1 3 7 10
time
Service 3 3 2 5 3
time

UNIT-3
5. a Illustrate use of memory hierarchy and memory allocation model in memory 06
management

b List different memory allocators for reuse of memory. Explain operation of powers of 05
two allocator.

c Compare noncontiguous and contiguous memory allocation techniques. 05

d List the features of static and dynamic memory allocation. 04

UNIT-4
6. a Give the layer organization of I/O software and List the steps to process interrupt and 07
Interrupt handling

b Discuss role of buffering in I/O devices. Illustrate buffering schemes. 06

c Discuss operational techniques of user space I/O software. 07

UNIT-5
7 a Explain the characteristics and features of distributed operating system. 06

b What are IPC semantics? Discuss the relevance and usage of each of semantics. 06

c Illustrate the working model of Remote Procedure Call paradigm and list steps for 08
Implementing the same.

*******
 U.S.N.

BMS College of Engineering, Bangalore-560019

(Autonomous Institute, Affiliated to VTU, Belgaum)
June 2017 Semester End Make Up Examinations
Course: OPERATING SYSTEM Duration: 3 Hours
Course Code: 16EC6DE20S Max Marks: 100
Date: 12.06.2017
Instructions: Answer five full questions

UNIT-1
1. a With neat diagram explain round-robin scheduling with time slice (δ) in time sharing 08
operating system with an algorithm.

b With neat diagram explain batch processing system and turnaround time 06

c With diagram explain Monolithic structure operating system and its disadvantages 06

OR
2. a With neat diagram explain kernel based operating system 06

b With an example explain multiprogramming system 07

c Explain real time system, its categories and its features 07

UNIT-2
3. a With diagram explain hybrid thread models 06

b Consider the following process to explain the HRN policy, calculate response ratio, 07
mean of weighted turn-around time and turn-around time. Draw the timing chart

Process P1 P2 P3 P4 P5
Arrival time (sec) 0 2 3 5 9
Service time (sec) 3 3 2 5 3

c Consider the following processes to explain rate monotonic scheduling and write 07
timing chart

Process P1 P2 P3
Time Period (msec) 10 15 30
Service Time(msec) 3 5 9
OR
4. a Define Critical section and explain CS with an example 06
 b Define Semaphores and explain producer consumer using semaphores with an 06
example

c Consider the following process to explain the SRN policy, calculate, mean of 08
weighted turn-around time and turn-around time. Draw the timing chart

Process P1 P2 P3 P4 P5
Arrival time (sec) 0 2 3 5 9
Service time (sec) 3 3 2 5 3
UNIT-3
5. a Explain with neat diagram, Stack using an example 06

b Explain non-contiguous memory allocation? Four unallocated memory areas of 50K, 08

30K,80K and 60K bytes exist in the memory as shown below .Obtain the physical
address of instruction add 51,488. The logical address space of P extends from 0 to
140K, while physical address space extends from 0 to 640K. Process P is spilt into
three components that is

Process Component Size Memory start address

P-1 50K 100K
P-2 30K 300K
P-3 60K 450K

Memory
1 5
00K 0K
F
3 3
00K 0K
C
4 8
50K 0K
D
6 4
00K 0K

c With neat diagram explain buddy system and power of two allocators 06

UNIT-4
6. a With neat diagram explain layers of the I/O system 06

b Explain device independent software and its functions 07

c Explain device driver and user space I/O software 07

 UNIT-5
7 a With an Algorithm explain RRA protocol - Blocking 06

b With neat diagram explain implementation of a remote procedure call (RPC) 08

c Explain different modes of accessing data in a distributed system 06

*******