School of Technology, Design & Computer Application​

Aditya Silver Oak Institute Of Technology ​

Bachelor of Technology ​
Computer Engineering / Information Technology /
Computer Science & Engineering
Operating System
Semester: 4th Academic Year: 2024 - 25
Course Name: Operating System Course Code: 1010043218

​ ​ ​ ​ ​ Question bank

Sr.
Question Text Marks CO
No.
Unit No 1: Introduction
1 Explain the objectives and functions of operating systems? 3 CO1
Explain basic services provided by the Operating system on bare CO1
2 3
Hardware machines?
What is System Call in OS? Explain fork () system call in UNIX CO1
3 4
OS?
4 List the types of operating systems and explain any one in detail? 3 CO1
Write a note on the Distributed Operating System. What is an CO1
5 4
Operating System? Give functions of Operating Systems.
Give the features of Real Time Operating System and CO1
6 4
Time-Sharing Operating System.
What is an operating System? Explain the abstract view of the CO1
7 4
components of a computer system.
Explain different types of OS and also Explain different types of CO1
8 6
tasks done by OS.
What is a system call? What is interrupt? How is it handled by CO1
9 4
the OS?
10 Give the features of Batch Operating System. 3 CO1
11 Give the advantages of Distributed Operating System 3 CO1
12 Write short notes on following: Real Time Operating System 4 CO1
13 Explain Goals of I/O Software. 3 CO1
Unit No 2 : Process and Threads Management:
 Differentiate process and thread. How do you create and
1 terminate the process? Draw a diagram which indicates the state 8 CO 1
of processes.
Consider the following set of processes with the length of the
CPU burst time given in milliseconds.

2 6 CO 1

Draw a Gantt Chart and find out average waiting time and
average turnaround time for (i) FCFS (ii) SJF (iii) RR​
Consider Five Processes P1 to P5 arrived at the same time. They
have estimated running time 10,2,6,8 and 4 seconds,
respectively. Their Priorities are 3,2,5,4 and 1, respectively with
3 6 CO 1
5 being the highest Priority. Find the average turnaround time
and average waiting time for Round Robin(q=3) and Priority
Scheduling algorithm.
4 Give the difference between a Process and a Program 3 CO 1
Write different operating system services Explain multiprocessor
5 operating system types in brief. 4 CO 1
Differentiate Multiprogramming, Multitasking, Multiprocessing
6 & Distributed Operating System. 6 CO 1
Define a process. Explain the process state transition with a neat
7 4 CO 1
diagram.
What is thread and what are the differences between user level
8 threads and kernel supported threads? Under what circumstances 4 CO 1
is one type “better” than the other?
Find average waiting time for shortest job first scheduling, and
round robin scheduling algorithm.

9 6 CO 1

What is average waiting time and average turnaround time of all

10 process for FCFS, SJF, non pre-emptive Priority, and Round 6 CO 1
Robin(Quantum =1) scheduling.
 The processes are assumed to have arrived in the order P1, P2,
P3, P4, P5 all at time=0.
Define Process. List the major events for creation of a process
11 4 CO 1
and explain them
12 What is PCB? Discuss its major fields. 4 CO 1
Draw a process state diagram for THREE states and explain all
13 4 CO 1
states.
Consider the following set of processes with length of CPU burst
time given in milliseconds.

14 6 CO 1

Assume arrival order is: P1, P2, P3, P4, P5 at time 0,1,2,3,4
respectively and a smaller priority number implies a higher
priority. Draw the Gantt charts for pre-emptive and Non
preemptive priority scheduling. Calculate Average Turnaround
Time and Average Waiting Time.
What is the process? What are the different types of states of any
15 process? Explain different data structures to handle process 4 CO 1
management.
16 Write short notes on following: (i)Multithreading 3 CO 1
17 What is thread? Explain thread structure. 3 CO 1
18 Explain PCB. 3 CO 1
What is a scheduler? Explain queuing diagram representation of
19 4 CO 1
process scheduler with figure.
Define a distributed system. Explain the characteristics of a
20 4 CO 1
distributed system.
21 Explain “5 State” Process Transition Diagram with illustration. 4 CO 1
What is the process? Explain Process State Transition Diagram
22 4 CO 1
in detail.
 What is the process? Explain Process State Transition Diagram
23 4 CO 1
in detail. Compare various disk arm scheduling algorithm.
Unit No 3: Concurrency
What Critical Section Problem and list the requirements to solve
1 4 CO 2
it. Write Peterson’s Solution for the same.
What is Semaphore? Give the implementation of CO 2
2 4
Readers-Writers Problem using Semaphore.
What is Monitor? Write Solution to Dining-Philosopher Problem CO 2
3 4
Using monitor.
What is Semaphore? Give the implementation of Bounded CO 2
4 Buffer Producer Consumer Problem using Semaphore. Write 4
pseudo code for the same.
Define and explain following terms: (i) Authentication (ii) CO 2
5 6
Mutual Exclusion (iii) Deadlock (iv)Segmentation.
Unit 4 : Inter - Process Communication
1 Explain the IPC Problem known as Dining Philosopher Problem. 6 CO 3
2 Define: Race Condition, Mutual Exclusion, Throughput. 6 CO 3
Explain the Problem of Critical Section (CSP) through Producer CO 3
3 6
Consumer Problem. Explain any one Solution in detail.
What is race condition? Explain the producer consumer problem CO 3
4 4
with a fatal race condition.
5 What is a deadlock? List the conditions that lead to deadlock. 4 CO 3
CO 3

Consider the snapshot of the system with Five Processes and

6 Four types of resources A, B, C, D. Currently Available set of 8
resources is (1,5,2,0). Answer the following Questions using
banker’s algorithm.
1)​ Find the content of Need Matrix.
2)​ Is the System in Safe State?

If a request from Process P1 arrives for (0,4,2,0) can the

request be granted immediately.
7 List Deadlock Recovery Techniques and explain one of them. 4 CO 3
8 Define: Starvation 3 CO 3
What is Deadlock? List the conditions that lead to deadlock. CO 3
9 6
How Deadlock can be prevented?
Explain the use of Banker’s Algorithm for multiple resources for CO 3
10 4
Deadlock Avoidance with illustration.
11 What is RAG? Explain briefly. 3 CO 3
 Which are the necessary conditions for Deadlock? Explain CO 3
12 4
Deadlock recovery in brief.
Define mutual exclusion. How mutual exclusion can be CO 3
13 4
achieved? Explain.
Unit 5 : Memory Management
Given memory partitions of 100K, 500K, 200K, 300K, and CO 2
600K in order, How would each of the First fit, Best fit and
Worst fit algorithms place the processes of 212K, 417K, 112K
1 6
and 426K in order? Which algorithm makes the most efficient
use of memory? Show the diagram of memory status in each
cases.
Explain the following in brief: Multiprogramming with Fixed CO 2
2 4
Partitions and Multiprogramming with Variable Partitions.
For the Page Reference String: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, CO 2
1, 2, 0. 1. 7, 0, 1calculate the Page Faults applying (i) Optimal
3 6
(ii) LRU and (iii) FIFO Page replacement Algorithms for a
Memory with three frames.
4 Explain Swapping in Detail. 4 CO 2
Unit 6 : I/O Management & Disk scheduling
Suppose that a disk drive has 5000 cylinders, numbered 0 to CO 4
4999. The drive is currently serving a request at cylinder 143,
and the previous request was at cylinder 125. The queue of
pending requests, in FIFO order, is 86, 1470, 913, 1774, 948,
1 8
1509, 1022, 1750, 130 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 i) FCFS, ii) SCAN
What are the uses of device drivers and controllers in OS? CO 4
2 4
EXPLAIN: Direct Memory Access. CO 4
3 3
Explain SSTF and LOOK disk scheduling Algorithms CO 4
4 4
Explain Device Independent I/O software. CO 4
5 3
Explain the following in brief: Elevator Algorithm. CO 4
6 3
Explain any three Disk Arm Scheduling algorithms with suitable CO 4
7 4
illustrations.
Explain the goals of I/O software. CO 4
8 3
Briefly describe SCAN CO 4
9 3
 Write a short note: RAID levels. CO 4
10 3
Draw the block diagram for DMA. Write steps for DMA data CO 4
11 4
transfer.
Implement Protection Mechanism illustrating use of Protection CO 4
12 4
Domain and Access Control List.
Create the ways for user authentication? Explain each in brief. CO 4
13 4
Explain domain protection mechanism in brief CO 4
14 3
Explain the Trojan Horse and Trap doors program threats. CO 4
15 4
Discuss some security goals. CO 4
16 3
Explain the goals of Operating System Security. CO 4
17 3
Unit 7 : Unix/Linux Operating System
Give the functions of following UNIX commands:grep, cat, cmp,
1 chmod ,finger,man Explain the following commands in UNIX: 7 8 CO5
suid, wall, man,finger,ls,cat,ps
What is “inode”? Explain File and Directory Management of CO5
2 6
Unix Operating System.
3 Explain Unix Commands: cat, sort, grep. 4 CO5
4 Explain Linux kernel and its functions in brief. 4 CO5