Parul Institute of Engineering &

Technology
CSE Department
Operating System (303105251)
Question Bank
Year: 2023-2024
 Question Bank
Subject Name: Operating System
Subject Code: 303105251

Sr. Question Marks

No.
1 Give the Difference between Multi-Programming, Multi-tasking , 3
Multiprocessing System.
2 Write different operating system services. 4

3 Explain the features of Time sharing system 4

4 What is operating system? Give the view of OS as a resource 7
manager.
5 What is system call? Explain steps for system call execution. 7

6 What is interrupt? How it is handle by operating system. 4

7 Explain different types of OS and also Explain different types oftasks 7
done by OS. 3
3
8 Explain monolithic operating system structure. 4
9 Explain Distributed OS with neat sketch and give its pros and cons. 7

10 What is Kernel? Differentiate between Monolithic Kernel and Micro 7

Kernel.

11 Define operating system. Explain the different views of operating 7

system. Also explain types of operating system
12 Explain evolution of operating system in detail with suitable 7
diagrams.
1 What is Process? Draw Five State Process Model and Explain it. 7

Page 2 of 8
2 Consider Five Processes P1 to P5 arrived at same time. They 7
have stimated running time 10,2,6,8 and 4 seconds, respectively.
Their Priorities are 3,2,5,4 and 1, respectively with 5 being
highest Priority. Find the average turnaround time and average
waiting time for Round- Robin(q=3) and Priority Scheduling
algorithm.
3 Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. 7
The drive is currently serving a request at cylinder 143,. The
queue of pending requests,in FIFO order, 86, 1470, 913, 1774,
948, 1509, 1022, 1750, 130 Starting from current head position
what is total distance (in cylinders) that disk arm moves to satisfy
all the pending request for FCFS and SSTF disk scheduling
algorithm?
4 Explain process control block with diagram 7
7
5 Difference between process and thread. 4
6 What is scheduler? Explain queuing diagram representation of 4
process scheduler with figure
7 7

Co
nsider the following five processes with the length of the CPU
burst time in milliseconds. Processes are Assumed to have arrived
at time 0. Priority For the above set of processes find the average
waiting time and average around time for each of the following
scheduling algorithm using Gantt chart. Consider 1 is highest
priority.
1. SJF
2. Non preemptive Priority
3. RR ( Q = 2)
8 Suppose Disk drive has 300 cylinders. The current position of 7
head is 90. The queue of pending request is
36,79,15,120,199,270,89,170 Calculate head movement for the
following algorithms.
1. FCFS 2. SSTF
9 Explain the classical thread model with its implementation 7
strategies.(Explain Thread Life Cycle with diagram.)

10 Explain Context Switching. Discuss performance evaluation of 7

FCFS (First Come First Serve) &RR (Round Robin)
scheduling.or Explain RR Algorithm with example.

Page 3 of 8
11 .Explain Swapping and Fragmentation in detail. 7

12 List the four events that cause processes to be created. Explain 3

each in brief.
13 Following table gives arrival time and expected run time of five 7
processes.

Igno
re process switching overhead. Find average turnaround time for
following scheduling algorithm. Round robin (quantum = 1 sec),
Shortest Job First.
14 Explain thread implementation in user space with its advantages 7
and
disadvantages.
15 Differentiate between preemptive and non-preemptive scheduling. 7
Solve following by SJF preemptive and non-preemptive. Draw
Gantt Chart, Average Waiting Time and Average Turnaround
Time. Which one is better as per average turnaround time?

16 Define following terms. 7

Throughput, Waiting Time, Turnaround Time,Response
TimeGranularity, Short Term Scheduler, CPU Utilization
17 (i) Define process. Differentiate between a process and a program. 7
(ii) Explain different states of a process with a suitable diagram.
18 Explain threads in brief with its types. What is multithreading? 7
Explain.
19 Explain SJF process scheduling algorithm with example 7

20 What it priority inversion problem in inter process 4

communication? How to solve it?

21 How does a parent process create a child process? How does a 4

parent process create an ordinary pipe (anonymous pipe) for
communicating with child process? Write the steps.

22 Give the Difference between Thread and Process 3

Page 4 of 8
1 What Critical section Problem and list the requirements to solve 7
it. Write Peterson’s Solution for the same. 4

2 What is Semaphore? Give the implementation of Readers-Writers 3

Problem using Semaphore.
3 What is Monitor? Write Solution to Dining-Philosopher problem 4
using 7
monitor.
4 What is Semaphore? Give the implementation of Bounded Buffer 7
Producer Consumer Problem using Semaphore.Write pseudo code
for the same.

5 Explain the IPC Problem known as Dining Philosopher Problem. 7

6 Explain IPC Problem – Readers &Writers Problem. 7

7 Explain Race Condition regarding banking problem. 7
1 What is deadlock? List the conditions that lead to deadlock. 4

7
2 7
7

Consider the snapshot of the system with Five Processes and Four
types of resources A,B,C,D.Currently Available set of resources is
(1,5,2,0). Answer the following Questions using bankers
algorithm.
1) Find the content of Need Matrix.
2) Is the System in Safe State?
3) If request from Process P1 arrives for (0,4,2,0) can the request
be granted immediately.
3 List Deadlock Recovery Techniques and explain one of them. 3

4 Define: Starvation 1
5 What is Deadlock? List the conditions that lead to deadlock. How 7
Deadlock can be prevented?

Page 5 of 8
6 Explain the use of Banker’s Algorithm for multiple resources for 7
DeadlockAvoidance with illustration.

7 What is Mutex? Write a pseudo code to achieve mutual exclusion 7

using mutex.
8 How TSL instruction can be used to achieve mutual exclusion? 7
Explain with proper pseudocode.
9 What is RAG? Explain briefly. 4
10 Which are the necessary conditions for Deadlock? Explain 7
Deadlock recovery in brief.
11 Define mutual exclusion. How mutual exclusion can be achieved? 7
Explain.

1 Explain concept of virtual memory and paging with example 7

2 Explain Difference between Internal and External Fragmentation. 3

3 Consider paging system with TLB, all page reference are found 3
75%
times the TLB, if 100ns are required for single memory reference,
then
calculate the effective memory access time? (ignore TLB search
time)
4 Explain concept of Demand Paging in memory management. 4
7
5 Consider the following page reference string: 7
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
With four Frames How many page faults would occur for the
FIFO,
Optimal page replacement algorithms? which algorithm is
efficient?
(assume all frames are initially empty)
6 Explain link list method for dynamic memory management. 3
7 Explain multiprogramming with fixed partition. 4

8 What is Paging? Explain paging mechanism in MMU with 7

example.
9 Explain TLB mechanism for speed up the process of paging. 4

10 Consider the following reference string. Calculate the page fault 7

rates for
below page replacement algorithm. Assume the memory size is 4
page
frame.

Page 6 of 8
 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
1. FIFO
2. OPTIMAL
11 Explain the following allocation algorithms: 1) First-fit 2) Best-fit 7
3) Worst-fit
12 If FIFO page replacement algorithm is used with 4 page frames 7
and 8 pages, how many page faults will occur with reference
string 0124720347 if four page frames are initially empty? Solve
the same problem for LRU page replacement algorithm.
13 What is called segmentation? How it differs from paging? 7

14 Which three are Page Replacement Algorithms? Discuss it in 7

terms of page faults.
15 Explain the structure of a page table entry. If a machine has 48 bit 7
virtual addresses and 32-bit physical addresses and pages are of 8
KB, how many entries are needed for the page table?
16 For the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 7
0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Calculate the page faults applying the
following Page Replacement Algorithms for a memory with three
frames:
(i) Optimal (ii) LRU (iii) FIFO
17 What is symbolic link and hard link. What is absolute path and 3
relative path
/
18 Explain memory allocation using Buddy System with an example. 4

1 Draw the block diagram for DMA. Write steps for DMA data 7
transfer. 3

2 Explain the use of Controller in I/O transfer. 3

3 Write short note: RAID levels. 7

4 Explain SSTF and LOOK disk scheduling algorithms 7

5 What is I-node? Explain in detail. 4

6 Disk requests come in to the disk driver for cylinders 10, 22, 20, 7
2, 40, 6, and 38, in that order. A seek takes 6 msec per cylinder

Page 7 of 8
 moved. How much seek time is needed for
1. First-come, firExplain all Accessing Methods of File.st served
2. Elevator algorithm. (initially moving upward) In all cases, the
arm is initially at cylinder 20.
7 Briefly describe SCAN. 4

8 Explain the goals of I/O software. 7

9 Explain any three Disk Arm Scheduling algorithms with suitable 7
illustrations.
1 Explain domain protection mechanism in brief 4
2 Explain the Trojan Horse and Trap doors program threats. 7
3 Discuss some security goals. 7
4 Explain the goals of Operating System Security. 7

Page 8 of 8