Course Name: Operating System

Course Outcomes (COs):

At the end of the course the student should be able to:
1. Explanation of the basic structure and functionality of operating system.
2. Analysis of various algorithms in process management, process scheduling and inter process communication.
3. Explanation and analysis of different deadlock prevention, avoidance and detection algorithms.
4. Explanation and analysis of different memory management algorithms.
5. Explanation of I/O systems, file system and analysis of different disk scheduling algorithms. Case study of operating systems.

Model Question Paper for End Semester Examination

Course Code: Course Title: Operating System
Duration: 3 hrs Max. Marks: 100

Ques Marks CO BL
Num
Question (Attempt any four)
1

What are the different services provided by an operating system? Explain 5 CO1
a
any two with suitable examples. 1

What do you mean by system call? What are the different system calls 5 CO1
b
provided by operating system?
1

Differentiate between distributed system and parallel systems. 5 CO1 1

c
Justify the statement “It is possible to support multiprogramming without
using time sharing. However, it is impractical to support time sharing 5 CO1 4
d
without using multiprogramming”.

With the help of suitable example explain real time operating system.
5 CO1 2
e Differentiate between hard and soft real time systems.

Ques
Marks CO BL
Num
2 Question (Attempt any four)

Write short notes on message passing system with respect to inter- 5 CO2
a process communication. How mailboxes are used in message passing 2
system?

With the example of suitable example explain, how semaphore is 5 CO2

b
implemented for two process solution?
3

Explain the mechanism of scheduler. Differentiate short term and long 5 CO2 1
c
term scheduler..
 What are different process states? Differentiate between process and 5 CO2 1
d
thread with the help of suitable example.

What do you mean by starvation? How it can be avoided? 5 CO2 2

e

Ques Marks CO BL
Num
Question (Attempt any two)
3
What do you mean by deadlock? Explain resource ranking mechanism for
10 CO3
a deadlock prevention. Differentiate between preemptive and non
2
preemptive scheduling. Describe Bankers algorithm.

Describe segmented paging? Explain in detail. What are the various steps
taken by an OS during page fault? Discuss with suitable example. How 10 CO4
b
segmentation provides protection? 2

An OS Contains 3 resource classes. The number resources units in these

classes are 7, 7 and 10, respectively. The current resource allocation state
is as shown below.

Allocates Resources Maximum Requirement

R1 R2 R3 R1 R2 R3

Process P1 2 2 3 3 6 8 10 CO3 5
c
Process P2 2 0 3 4 3 3

Process P3 1 2 4 3 4 4

Is the current allocation state is safe? If yes then write the safe sequence.
Describe deadlock detection and recover mechanism.

Ques Marks CO BL
Num
Question (Attempt any two)
4
Describe virtual memory in details. Suppose we have given with the
following string of the pages to be referenced.
10 CO4
7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,01,7,0,1
5
a If we are given with a memory system with 3 frames then how much page
faults will occur using FCFS algorithm?

Explain the concept thrashing. Write a short note on any mechanism to 10 CO4
b
avoid thrashing. Describe Compile time, Load time and Execution time 2
binding.

Suppose more the one user are working on same project using common
10 CO5 2
c files then which directory structure will be suitable to work with? Explain
tree structured directory with the help of suitable example.
Ques Marks CO BL
Num
Question (Attempt any two)
5
With the help of suitable example describe disadvantages of the linked
allocation strategies. Describe associate and direct mapping of the cache 10 CO5
a
memory organization.

4
Write short notes on security and protection mechanism used in memory
CO5
b system. How look and c-look disk scheduling are different from scan and c-
2
scan scheduling. Give suitable example for the explanation.
10

How Indexed allocation mechanism of the file allocation strategy

10 CO5 4
c overcomes the problems faced in linked allocation strategy. Write a short
note on FAT.