(AUTONOMOUS)

Affiliated to JNTUH, Approved by AICTE, Accredited by NAAC with A++ Grade, ISO 9001:2015 Certified
Kacharam, Shamshabad, Hyderabad – 501218, Telangana, India
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
II B. TECH I SEMESTER 2023-2024
A8510 – OPERATING SYSTEMS
Module wise Question Bank
Topic Wise Questions to Practice
[Link] Question Description CO# BL#

OPERATING SYSTEMS OVERVIEW

Define Operating System? List the various services provided by the Operating
1 CO1 BL2
Systems.
2 Demonstrate the Operating System services in view of User and System. CO1 BL2

3 Show the System call execution in an Operating System using System call Interface. CO1 BL3

4 Classify the System calls at various levels of Operating system function. CO1 BL2
5 Explain the various types of Operating Systems evolution. CO1 BL2

6 Compare Batch processing and Multi Programming Systems CO1 BL2

7 Compare Multi-Processing and Distributed Systems CO1 BL2

Classify the Special Purpose systems and Outline the features provided by the
8 CO1 BL3
operating systems for them.
“A real time system uses real time scheduling “. Give reason and outline the
9 CO1 BL3
properties of real time systems.
Illustrate the working process of Operating system by using Dual mode operation and
10 CO1 BL2
Timer.
Show the main difficulty that a programmer must overcome in writing an operating
11 CO1 BL3
system for a real-time environment?
12 Identify five major activities of an operating system with regard to file management? CO1 BL3
Identify five major activities of an operating system with regard to memory
13 CO1 BL3
management?
Summarize the System programs for convenient environment in program
14 CO1 BL2
development and execution.
Define the term Degree of Multi Programming. Compare CPU Bound and I/O Bound
15 Programs. Demonstrate how multiprogramming systems improves performance of a CO1 BL3
system.
PROCESS MANAGEMENT

14 Distinguish between a program and process. CO1 BL2

15 Identify the various components in a Process when created by the operating system. CO2 BL3

16 Show with neat diagram 5-state model of a process. CO2 BL3

17 Identify the contents of PCB in an operating system when a process is created. CO2 BL3
Illustrate how context switch takes place from one process to another when an
18 CO2 BL2
interrupt occurs.
19 Identify the role of operating system in process termination. CO2 BL3
20 Demonstrate the process operations in operating system design. CO2 BL2

21 Distinguish between Shared Memory and Message Passing Systems. CO2 BL4
22 Compare Ordinary and Named pipes for inter process communication. CO2 BL4

23 Define a Pipe. List the characteristics of a pipe. CO2 BL2

24 Explain message queue form of IPC in operating systems CO2 BL2

25 Illustrate with an example Shared Memory system and how it works. CO2 BL2
Define the terms
26 1. Turnaround Time 3. Throughput CO2 BL1
2. Waiting Time 4. Response time
Identify the role of
i. Long-term Scheduler
27 CO2 BL3
ii. Medium-term Scheduler
iii. Short -term Scheduler
Consider the following processes with Burst time in nsec
Process Arrival Time Burst Time Priority
P1 0 8 5
P2 1 7 4
P3 2 6 2
P4 4 10 1
28 P5 5 5 3 CO2 BL4
***Priority -> 1-High, 5-Low , with time quantum of 3 nsec
i) Calculate Average Waiting time using FCFS, SJF, SRTF, Priority
Scheduling and Round Robin Scheduling.
ii) Calculate Average Turnaround time using FCFS, SJF, SRTF, Priority
Scheduling and Round Robin Scheduling.
iii) Select the algorithm with minimum waiting time.
iv) Compare round robin scheduling with time quantum 4.
Explain Multilevel Queue Feedback Scheduling. Identify the parameters for
29 CO2 BL2
implementing this scheduling.
Illustrate how multi programming operating systems uses Multi Level Queue
30 CO2 BL3
Scheduling.
“In Priority Scheduling, the low priority processes never get a chance on CPU for
31 CO2 BL3
longer time. Select a technique to overcome this in operating systems.
PROCESS SYNCHRONIZATION
Identify the need of synchronization among cooperating processes. Explain with
32 CO2 BL3
example code segment.
Define the terms
33 i. Race Condition CO2 BL1
ii. Synchronization
 iii. Starvation

How to define protocol for Critical Section Problem? Identify the conditions a critical
34 CO2 BL3
section problem must satisfy.
Choose a solution for synchronization among two processes in multiprogramming
35 CO2 BL3
systems. (Hint : Peterson’s Solution)
36 Identify how to provide synchronization among more than two processes. CO2 BL3

37 Write the semaphore operations for synchronization. Classify semaphores. CO2 BL3
In a system, demonstrate a method to allocate multiple instances of a resource
38 CO2 BL3
among processes. (Hint: Counting Semaphore).
39 Write code segment for Producer-Consumer using semaphores. CO2 BL3
“In a system a processes can read data or write data to same file/database in
40 cooperating environment. Solve the problem using semaphores. (Hint Reader-Writers CO2 BL3
Problem).
Write code segment using semaphores. Select the possible solutions for Dining
41 CO2 BL3
Philosophers problem.
MEMORY MANAGEMENT
How swapping is implemented in a system? Identify the issues in implementing
42 CO3 BL3
swapping.
43 Outline the difference between fixed size and variable size partitioning. CO3 BL2
Identify the limitations of contiguous memory allocation. Explain how to overcome in
44 CO3 BL3
memory management.(Hint: internal and external fragmentation , paging)
Demonstrate with example how internal and external fragmentation differs in
45 CO3 BL2
memory allocation.
Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in
order), how would the first-fit, best-fit, and worst-fit algorithms place processes of
46 CO3 BL3
212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most
efficient use of memory?
Summarize the algorithms of contiguous memory allocation. (Hint: first-fit, best-fit,
47 CO3 BL2
and worst-fit)
Illustrate with example how paging is implemented in operating system. Choose the
48 CO3 BL2
hardware required for paging.
Consider a logical address space of 64 pages of 1,024 words each, mapped On to a
physical memory of 32 frames.
49 CO3 BL3
a. How many bits are there in the logical address?
b. How many bits are there in the physical address?
Identify the role of TLB? Make use of TLB to implement Paging. Explain how TLB
50 CO3 BL3
improves performance of memory management scheme. (Hint: Effective access time)
Demonstrate the following page table structures
i. Hierarchical Paging (Two Level Paging)
51 CO3 BL3
ii. Hashed Page table
iii. Inverted page table
Consider a computer system with a 32-bit logical address and 4-KB page size. The
system supports up to 512MB of physical memory. How many entries are there in
52 each of the following? (Hint: For any memory structure question can be). CO3 BL3
a. A conventional single-level page table
b. An inverted page table
 Identify how user view of memory organization is possible? Explain with a neat
53 CO3 BL3
diagram how it is implemented. (Hint: Segmentation)
Consider the following segment table:
Segment Base Length
0 219 600
1 2300 14
2 90 100
3 1327 580
54 4 1952 96 CO3 BL3
What are the physical addresses for the following logical addresses?
a. 0,430
b. 1,10
c. 2,500
d. 3,400
e. 4,112
Illustrate the implementation of virtual memory system. Identify the benefits of
55 CO3 BL2
Virtual memory system. (Hint: Demand Paging)
Describe the following page replacement algorithms.
i. FIFO Page replacement
56 CO3 BL2
ii. LRU Page Replacement
iii. Optimal Page Replacement (OPT)
How many page faults occur for the following reference string using FIFO, LRU and
OPT Page replacement.
57 CO3 BL3
i) 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2. (4 Frames)
ii) 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. (3 Frames)
58 Identify the problem with FIFO page replacement and explain how it is resolved. CO3 BL3
59 Select the appropriate frame allocation methods for memory management. CO3 BL3

60 Identify the difficulty of high paging? Explain how it can be resolved. (Hint: Thrashing) CO3 BL2
FILE SYSTEM
61 List the attributes of a file in general purpose operating system. CO4 BL2

62 Choose the various file access methods to retrieve data from file. CO4 BL2
Identify the role of the following (Hint : File System Structure)
i) Logical file system
63 CO4 BL2
ii) File Organization Module
iii) Basic File System
Demonstrate with example the following directory structures.
i) Single level Directory Structure
64 ii) Two Level Directory Structure CO4 BL3
iii) Tree Structured Directory
iv) Acyclic graph directory
“Since a system has more directory entries. List the directory implementation
65 CO4 BL3
methods and select the best approach for it. (Hint: Directory implementation)
66 Illustrate with example the various file allocation methods. CO4 BL3
“The operating system must utilize the free space on the disk effectively”. Explain
67 CO4 BL3
different methods of it. (Hint: Free Space Management)
MASS-STORAGE STRUCTURE
 Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is
currently serving a request at cylinder 143, and the previous request was at cylinder
105. The queue of pending requests in FIFO order is:
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, what is the total distance that the disk arm
moves to satisfy all the pending requests for each of the following disk-scheduling
68 CO4 BL3
algorithms?
i. FCFS
ii. SRTF
iii. SCAN
iv. C-SCAN
v. LOOK / C-LOOK
Choose the various methods for Swap Space Management in operating system
69 CO4 BL2
designs.
Define the terms
i. Seek time
70 ii. Rotational Latency CO4 BL1
iii. Access Time of the Disk
iv. Cylinder
DEADLOCKS

71 Identify the necessary conditions for deadlock. CO5 BL2

Construct a resource allocation graph to show the deadlock for multiple instances of a
72 CO5 BL2
resource type. What is the necessary and sufficient condition?
“In a system with multiple instances of a resources type, does not lead to deadlock in a
73 CO5 BL3
resource allocation graph with cycle.” Justify with an example.
“In a multiprogramming system select the protocols (solutions) to prevent a deadlock to
74 CO5 BL3
occur.(Hint: Deadlock Prevention)
Consider the following snapshot of a system with four processes P1-P4 and four
resource types A, B, C, & D.
Allocation Max. Available
A B C D A B C D A B C D
P1 0 0 1 3 0 0 1 2 1 5 2 0
P2 1 0 0 0 1 7 5 0
P3 1 3 5 4 2 3 5 6
75 P4 0 6 3 2 0 6 5 2 CO5 BL3

Answer the following question using the Banker’s algorithm:

a) What is the content of matrix “Need”?
b) What are the maximum instances of each recourse type?
c) Identify the system is in safe state or not?
d) If a request from process P1 arrives for (0, 4, 2, 0) can the request be
granted immediately?
Illustrate with an example how to detect a deadlock in a system with single instance
76 CO5 BL3
of a resource type. (Hint: Wait For Graph)
77 Construct the wait for graph for the following RAG CO5 BL3
 Consider the following snapshot of a System
Allocation Request Available
ABC ABC ABC
Po 010 000 000
P1 200 202
78 CO5 BL3
p2 303 0 00
p3 211 1 00
p4 002 0 02
Suppose now that process P2 makes one additional request for an instance of type
C. Is it detects a deadlock or not. (Hint: Deadlock Detection)
“A system does neither employ any deadlock avoidance algorithm nor taken any
79 prevention measure in multiprogramming system”. If the system detects a deadlock CO5 BL2
identify the approaches to resolve it. (Hint: Recovery from deadlock)
80 How would you avoid deadlock in system with single instance of a resource type. CO5 BL3