Question Bank (Operating System BCSE 2010)

Bloom’s Competitive
Serial Taxonomy Difficulty Exam Ques
No. Questions CO Level Level Y/N Area
1 Define an Operating system. Explain the functions of an operating system. CO1 K1 Medium N Operating System
2 Explain the classification of operating system in detail. CO1 K2 Medium N Operating System

Choose among the following the correct example of a spooled device?

a) terminal used to input data for a program being executed
b) Secondary memory device in a virtual memory system
3 c) a line printer used to print the output of a number of Jobs. CO1 K2 Medium Y Operating System
4 Define batch systems? How they are different from time sharing systems? CO1 K1 Medium N Operating System

Choose among the following instructions should be privileged (can only be executed
in kernel mode)?
a) Change memory management registers
b) write the program counter
c) read the time of day clock
d) set the time of day clock
e) Change Processor priority
5 Justify your answers. CO1 K5 Medium Y Operating System

Classify the following applications as batch-oriented or interactive:

a) Word processing
b) Generating monthly bank statements
6 c) Computing pi to a million decimal places CO1 K2 Medium Y Operating System
7 Define a real time system or interactive system. Define its characteristics? CO1 K1 Low N Operating System
Define the term virtual machine? Define the benefit of viewing a system such as an
8 operating system as a set of layers? CO1 K1 Medium Y Operating System
9 Define a kernel. Define different types of kernels? CO1 K1 Low N Operating System
10 Explain the differences between multiprocessor and multi-tasking systems. CO1 K2 Medium N Operating System
11 Define a process in operating system? Explain Process management. CO1 K1 Medium N Operating System
12 Define Reentrant Kernel. CO1 K1 Low N Operating System
13 Describe Monolithic and Microkernel Systems. Define the differences between them? CO1 K2 Medium Y Operating System
14 Explain the benefits of multithreaded programming? CO1 K2 Medium N Operating System
15 Is operating system supplied with the computer? Explain your answer. CO1 K2 Medium Y Operating System
Explain the idea/concept behind Multiprogramming? How multi-programming
16 is different from multi-tasking? CO1 K2 Medium Y Operating System
17 Define mainframe systems? Define its advantages and disadvantages? CO1 K1 Medium N Operating System
18 Define
Define Multiprocessor System?
clustered system? How itDefine the advantages
is different of multiprocessing?
from non-clustered CO1 K1 Medium N Operating System
19 systems? CO1 K1 Medium N Operating System
20 EXPLAIN Why must a compute start in kernel mode when power is first turned on? CO1 K2 Medium N Operating System
21 Discuss what does the CPU do when there are no programs to run? CO1 K2 Medium N Operating System
Describe Non modifiable procedures?
22 Are Reentrant
Define procedures
Real time systems?and Non modifiable
Define procedures
the applications different?
of real-time systems? CO1 K2 High Y Operating System
23 How are they different from time-sharing system? CO1 K1 High N Operating System
24 Define Hard Real time systems? Give example. CO1 K1 Medium N Operating System
25 Define
Define soft real time
distributed system?Define
systems? Give example.
the differences between a CO1 K1 Medium N Operating System
26 distributed system and non-distributed system? CO1 K2 Medium N Operating System
27 State the advantages and disadvantages of distributed systems. CO1 K4 Medium N Operating System
28 Define the different Operating Services? Explain them in detail. CO1 K1 Medium N Operating System
29 Explain the concept of monolithic and non- monolithic system. CO1 K2 Medium N Operating System
30 Explain the functions of an operating system. CO1 K2 Medium N Operating System
31 Differentiate between tightly coupled and loosely coupled systems? CO1 K4 Medium N Operating System
32 Explain the Layered structure of an operating system. CO1 K2 Medium N Operating System
33 Define operating system? CO1 K2 Low Y Operating System
34 Differentiate between mainframe and personal computers? CO1 K4 Medium N Operating System
35 Differentiate between
Multiprogramming Monolithic
systems executeand Microkernel
more Systems?
jobs in the same time period than single CO1 K4 Medium N Operating System
36 programming systems. Is this statement true or false? Explain your answer. CO1 K2 Medium Y Operating System
37 Compare real time systems and time sharing systems. CO1 K4 High N Operating System
Are the below examples of distributed OS?
38 Define
a. Amoebathe advantages of multiprocessing systems? CO1 K1 Medium N Operating System
b. UNIX
39 Define a thread? Explain multi-threading in operating system. CO1 K1 Medium N Operating System
c. MS-DOS
40 Differentiate
d. MULTICS between a trap and an interrupt? CO1 K4 Medium N Operating System
41 Explain DOS. CO1 K4 High Y Operating System
42 Explain the different system components of operating system in detail. CO1 K2 Medium N Operating System
43 Define the different layers of operating system? Explain them. CO1 K1 Medium N Operating System
44 List the advantages of multiprocessing systems and multiuser systems. CO1 K1 High N Operating System

Multiprocessing systems execute job faster than single processor

45 systems. Is this statement true or false? Explain your answer. CO1 K4 High Y Operating System
46 Give examples of distributed and time sharing systems. CO1 K4 High N Operating System
47 Demonstrate how time sharing of different processes is done in an operating system? CO1 K3 High N Operating System

Choose among the following, ready to execute processes must be present in RAM?
a. multiprocessing
b. multiprogramming
c. Multitasking
48 Justify your answer. CO1 K4 High Y Operating System
49 Expalin the classification of operating Systems in deatail. CO1 K2 High N Operating System
Does the operating systems consists of programs that help in the operation of
50 computer? Explain your answer. CO1 K4 High Y Operating System
51 Define
Describeaprocess
process.control
Draw and explain
block? Drawprocess state diagram.
a neat diagram to show the structure of PCB. CO2 K1 High N Operating system
52 Explain the different information to be stored in it. CO2 K2 High N Operating system
53 Explain how do weDraw
For the processes, K6 a process inillustrating
the chart operating system?
their execution time: CO2 K2 High N Operating system
Process Arrival Time
54 Define threads. Define the main purpose Processing timethe threads?
behind CO2 K3 High N Operating system
A 0.0000 3
55 Describe
B multithreading?
1.001 6 CO2 K2 Low N Operating system
56 C
Define inter process4.001
communication? Explain 4 the communication models. CO2 K1 High N Operating system
For
D the processes, Draw 6.001the chart illustrating
2 their execution time:
57 Process
Discuss different
a) Compute types
ArrivalofTime
the Average multi-threading
throughput usingmodels?
Processing
FCFS,time
SJF and Round-robin( quantum=2). CO2 K2 Medium N Operating system
A 0.0000 3
58 b) Compute the wait time using Shortest Remaining Time scheduling. CO2 K5 High Y Operating system
B 1.001 6
59 Define
C schedulers?
Differentiate between Define
4.001 context
long term, shortswitching.
term4 and medium term CO2 K2 Medium N Operating system
60 D
schedulling. 6.001 2 CO2 K4 High N Operating system
a) Compute the Average turnaround time using Round-robin( quantum=2), Round-
61 Explain Round-robin CPU scheduling using example.
robin( quantum=1). CO2 K4 High N Operating system
62 b) Compute the wait time using Round-robin( quantum=2), Round-robin( quantum=1). CO2 K5 High Y Operating system
63 Explain the following process scheduling algorithm CO2 K2 High N Operating system
a) Priority scheduling
b) Shortest job first scheduling
64 Explain FCFS Scheduling with example. CO2 K2 High N Operating system
65 Explain Belody's anomaly using example. CO2 K2 High N Operating system
66 List the advantage of SJF over FCFS? CO2 K1 High N Operating system
67 Consider following processes with length of CPU burst time in milliseconds CO2 K5 High Y Operating system
Process Burst time
P1 5
P2 10
P3 2
P4 1
All process arrived in order p1, p2, p3, p4 all time zero
a) Draw Gantt charts illustrating execution of these processes for SJF and round robin
(quantum=1)
b) Calculate waiting time for each process for each scheduling algorithm
c) Calculate average waiting time for each scheduling algorithm
68 Explain the priority CPU scheduling with example. CO2 K4 High N Operating system
69 Consider following processes with length of CPU brust time in millisecond CO2 K5 High Y Operating system
Process Brust time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
All
Forprocesses arrived
the processes, in order
Draw p1, p2,
the chart p3, p4, p5
illustrating all at
their time zero.
execution time:
Process Arrival Time Processing time
1) Draw Gant charts illustrating execution of these processes for SJF
A 0.0000 3
B& priority scheduling1.001 6
C
2) Calculate turnaround4.001time for each process 4 for scheduling algorithm in part (1)
D 6.001 2
3) Calculate the
a) Compute waiting timeturnaround
Average for each scheduling
time using algorithm
FCFS, SJF.in part (1)
70 b) Compute the wait time using FCFS, SJF. CO2 K5 High Y Operating system
71 Explain
DescribeShortest Remaining
Deadlocks? DefineTime algorithm using
the necessary an example.
conditions for CO2 K4 High N Operating system
72 deadlocks to occur? Explain them. CO2 K2 High N Operating system
73 Define a process switcH. Define a context switch. CO2 K1 High N Operating system
74 Define a safe state and an unsafe state? CO2 K1 Low Y Operating system
75 Explain
Explain Shortest Job First
the Resource algorithm
allocation graph using
withanexample.
example.Differentiate between CO2 K3 High N Operating system
76 resourse allocation graph and wait for graph. CO2 K3 High Y Operating system
Explain how the resources could be allocated to diferent processes when each
77 resource has more than one instance. Give example. CO2 K4 High Y Operating system
78 Explain deadlock prevention and avoidance. CO2 K2 High N Operating system
79 Explain the concept of Deadlock recovery. Define Ostrich agorithm? CO2 K2 High N Operating system
80 Compare swapper and a dispatcher? CO2 K4 Medium N Operating system
81 Explain multi level queue scheduling and multilevelfeedback queue. CO2 K2 Low N Operating System
82 Define CPU scheduling. Explain preemptive and nonpreemptive scheduling. Give examCO2 K1 High N Operating System
83 Explain the scheduling agorithm which require timer interrupt for the CPU? CO2 K1 High N Operating System
84 Explain a user level thread and a kernel level thread with the help of diagram. CO2 K2 High N Operating System
85 List the various scheduling criteria for CPU scheduling? CO2 K1 High N Operating System
Define the following:
86 Explain Round robin algorithm using an example. CO2 K2 High N Operating System
Consider a system having five processes: P0,P1,P2,P3,P4 and three resource types:
a) Wait time
87 A,B,C.
Define throughput.
b) Response time Define turnaround time? CO2 K1 Low N Operating System
Allocation
88 c) Turnaround time Max Available CO2 K1 High Y Operating System
A B C A B C A B C
89 P0
Define race
Can a 1single condition.
1 processor
2 4 3 has
system 3 no processes
2 1 0in the ready queue? Expain CO2 K1 Low N Operating System
P0 2 1 2 3 2 2
90 what can happen in such a situation. CO2 K3 High N Operating System
P0 4 0 1 9 0 2
P0
Define0 a critical
2 0 section? 7 List
5 the
3 requirements that a solution to the critical section
91 P0
problem1 must
1 2satisfy? 11 2 3 CO2 K2 High Y Operating System
1) Determine the total amount of resources of each type.
92 Explain
2) Drawsafety algorithm
the need matrix.in deadlock in detail. CO2 K2 High N Operating System
93 3) Determine if this state is "safe" using Safety algorithm. CO2 K5 High Y Operating System
94 Define a Dispatcher? Define dispatch latency? CO2 K1 High N Operating System
95 Explain the four conditions for a deadlock to occur. CO2 K2 High Y Operating System
Which among below is a solution to the Dining Philosophers Problem which avoids
deadlock:
(a) ensure that all philosophers pick up the left fork before the right fork
(b) ensure that all philosophers pick up the right fork before the left fork
(c) ensure that one particular philosopher picks up the left fork before the right fork,
96 and that all other philosophers pick up the right fork before the left fork CO2 K4 High Y Operating System
97 Which algorithm
Describe is address
a process used to detect a deadlock?
space and Explainspace?
process control CO2 K2 High N Operating System
98 Define a multiprocessor schedulling? CO2 K2 High Y Operating System
99 Explain the following:
banker's algorithm in detail to avoid the deadlock. CO2 K2 High Y Operating System
(a) Mutual exclusion
100 Explain the different
(b) Bounded waiting states of a process with the help of the diagram. CO2 K2 High N Operating System
101 (c) Race condition CO3 K2 High Y Operating System
102 Explain critical section problem in concurrency. CO3 K2 Medium N Operating System
103 Explain wait and signal operations in semaphore. CO3 K2 High Y Operating System
104 Does
Describe
the asolution
binary semaphore.
to the DiningDefine the domain
Philosophers of a avoids
Problem Counting semaphore?
deadlock to ensure that CO3 K2 High Y Operating System
all philosophers pick up the left fork or right fork first or one particular philosopher
105 Explain
picks upbusy waiting
the left fork for a semaphore.
before Howand
the right fork, canthat
we overcome busy waiting?
all other philosophers pick up the CO3 K4 High Y Operating System
106 right fork before the left fork? Explain. CO3 K4 High Y Operating System
107 Define critical section in concurrency in operating system. CO3 K1 Low Y Operating System
108 Describe a semaphore? CO3 K2 Medium N Operating System
109 Explain the wait and signal operations for monitors in detail. CO3 K2 High N Operating System
110 Explain briefly about the various classic problems of synchronization . CO3 K2 Medium Y Operating System
111 Define race condition. Explain in detail how it can be resolved. CO3 K1 Medium Y Operating System
112 Explain message passing in interprocess communication. CO3 K2 Medium N Operating System
113 Explain shared memory systems in interprocess communication. CO3 K2 High N Operating System
114 Explain busy waiting and spinlock. CO3 K2 Medium N Operating System
115 Explain solution to producer-consumer problem using semaphores. CO3 K2 High Y Operating System
116 State the dining philosopher’s problem. CO3 K1 High N Operating System
117 State Bounded buffer problem and give a solution to this problem CO3 K1 High N Operating System
List and describe different types of semaphore? Which semaphore is used to solve
118 Producer consumer problem? CO3 K2 High N Operating System
119 Explain
Describesolution to diningGive
a semaphore? philosopher problem
difference using
between monitor.
a semaphore CO3 K3 High N Operating System
120 and mutex. CO3 K3 High Y Operating System
List the different types of semaphores. Which problem is solved by counting
121 semaphore? CO3 K2 High N Operating System
Define the Principle of Concurrency? Explain Producer / Consumer Problem
122 in detail. CO3 K2 High Y Operating System
123 Explain Dekker’s solution to the concurrency problem. CO3 K2 High Y Operating System
124 Explain deadlock and starvation in a semaphore. CO3 K2 High N Operating System
125 Is Mutex() operation atomic? Explain your answer. CO3 K4 High Y Operating System
126 Define a Semaphore. Define Test and Set operations? CO3 K1 Medium N Operating System
127 Explain busy waiting and spinlock in a semaphore. CO3 K2 Medium N Operating System
128 Define the Classical Problems in Concurrency? Explain Dining Philosopher Problem. CO3 K2 High N Operating System
129 Explain Peterson’s solution to the concurrency problem. CO3 K2 High N Operating System
130 Describe how Process generation takes place in operating system? CO3 K2 Medium N Operating System
131 Explain the Critical Section Problem in detail and how it can be solved. CO3 K2 High N Operating System
132 State
Definethe Sleeping
the meaningBarber Problem.
of busy Explain
waiting? What briefly.
other kinds of waiting are there in an CO3 K2 High N Operating System
133 operating system? Can busy waiting be avoided altogether?
Explain the structure of consumer process and producer Explain
process your answer.
to show the bounded CO3 K4 High N Operating System
134 buffer problem. CO3 K3 High Y Operating System
135 Explain in detail the readers writers problem and its solution. CO3 K2 High Y Operating System
136 Explain Inter Process Communication Schemes. CO3 K2 High N Operating System
137 Explain different solutions of Dining Philosopher Problem. CO3 K4 High N Operating System
138 Explain the solution of Sleeping Barber Problem. CO3 K4 High N Operating System
139 Suppose there is a hostel mess following FCFS to serve students.Now create an CO3 K6 High N Operating System
algorithm to accommodate the guests for a dinner, with guests having higher priority
140 Define concurrency. Explain how Mutual Exclusion can be achieved in concurrency. CO3 K4 High N Operating System
141 Describe how processes communicate with each other in operating system? CO3 K2 High N Operating System
Write and explain the structure of a reader and writer process of the Reader-Writer
142 problem. CO3 K2 High N Operating System
143 Define a cooperating process? How it is related to concurrency? CO3 K1 High N Operating System
144 Explain process synchronization among cooperating processes. CO3 K2 High N Operating System
145 Write and explain TestAndSet instruction in synchronization. CO3 K2 Medium Y Operating System
146 List down the concurrency problems? CO3 K1 High N Operating System
147 Explain how mutual exclusion is preserved in Peterson's solution in concurrency. CO3 K2 High N Operating System
148 Create a system to synchronize traffic lights for a crossing of roads with CO3 K2 Medium N Operating System
giving a window of atleast 30 seconds for pedestrians.
149 Explain how mutual exclusion implementation is done using TestSet in concurrency? CO3 K4 High N Operating System
150 Define a base and limit register? CO3 K1 Medium Y Operating System

151 Explain logical and physical address space generated by CPU? CO4 K2 Medium Y Operating System
Differentiate between dynamic loading and dynamic linking. Discuss dynamic
152 relocation. CO4 K4 Low N Operating System
Define swapping? Draw and explain a neat diagram depicting swapping
153 of processes using a disk. CO4 K3 Low Y Operating System
154 Define a fragmentation? Explain the types of fragmentation. CO4 K2 Medium N Operating System
155 List down the disadvantages of single contiguous memory allocation? CO4 K1 High N Operating System
156 Explain different solutions to dynamic storage allocation problem in detail. CO4 K2 High Y Operating System
0,1,4,2,0,2,6,5,1,2,3,2,1,2,6,2,1,3,6,2
Explain
how many thepage
following:
faults will occur if the program has three page frames available to it
(a) Overlay
and uses:
(b) Resident
a) FIFO monitor
replacement
157 (c)
b) Compaction CO4 K2 High Y Operating System
TheLRU replacement
main memory size is assumed to be 4KB and page size is 1 KB. If LRU algorithm is
158 c) Optimal replacement
used for page replacement then what pages should reside in the main memory at the CO4 K5 High Y Operating System
159 end of the following sequence of page references: 4,8,2,3,2,8,3,1,2,6,7 CO4 K5 High Y Operating System
Choose among the following suffer from Belady's anomaly and which of them not.
Explain.
a) LRU replacement
b) FIFO replacement
160 c) Optimal replacement CO4 K4 High Y Operating System
Define virtual memory. Why a page fault occurs? Discuss the concept of dirty bit.
161 Define paging? Draw and explain the diagram showing the hardware support for CO4 K1 High Y Operating System
162 paging. CO4 K3 High Y Operating System
163 Explain
Define athe paging
page and model of logical
page table? andthe
Explain physical
pagingmemory
examplein for
detail.
a 32-byte memory with CO4 K2 High N Operating System
164 4-byte pages. CO4 K4 High Y Operating System
165 Define segmentation? Explain the basic method of segmentation. CO4 K2 High N Operating System
166 Define demand paging. Define the need for a lazy swapper? CO4 K1 High Y Operating System
167 Define
Explain athevirtual memory? State its advantages?
following: CO4 K1 Medium N Operating System
168 List down the stepsRegister
a) Page Table Base involved in handling a page fault in demand paging. CO4 K1 High N Operating System
b) TLB Miss
169 Explain
c) various page replacement algorithms used for for page replacement. CO4 K2 High Y Operating System
OnValid- Invalid
a simple bit system
paging with 2^24 bytes of physical memory, 256 pages of logical
170 d) Effective
address memory
space, and aaccess time
page size of 2^10 btes, Calculate the number of bits that are CO4 K2 High Y Operating System
171 present in a page frame?
Define page replacement? Define the need of page replacement? Elaborate it via CO4 K5 High Y Operating System
172 diagram. CO4 K3 High N Operating System
173 Explain belady's anomaly in FIFO page replacement in detail. CO4 K2 High Y Operating System
In each of the following, briefly describe the functions performed by the memory
174 Define thrashing?
management Explain the cause of thrashing.
hardware: CO4 K2 Medium Y Operating System
a) Single partition
175 Explain the variable
b) Multiple working partition
set model in detail. Explain page fault frequency. CO4 K2 High N Operating System
176 c) Simple paging CO4 K2 High Y Operating System
177 Examine why are segmentation and paging combined into one scheme? CO4 K4 High N Operating System

On a system using first-fit allocation, assume memory is allocated as below before

additional requests for 20K, 10K, 5K are received.
Used Hole Used Hole Used Hole Used Hole Used Hole Used Hole
In
10each of the20K
following,
30K briefly describe the
30Kfunctions performed
15K by the operating
On aK system
system
10K using best-fit
software:
10K 5Kassume
allocation, 20K is
memory 10K
allocated as20K 20K in
mentioned
178 At what
ques starting
178, beforeaddress will
additional each of
requests the
for additional
20K, 10K, requests
5K are be allocated?
received. At what starting CO4 K5 High Y Operating System
a) Single partition
179 address will each of the additional
b) Multiple variable partition requests be allocated? CO4 K5 High Y Operating System
180 c) Simple paging CO4 K2 High N Operating System
On a system using worst-fit allocation, assume memory is allocated as mentioned in
ques 178, before additional requests for 20K, 10K, 5K are received. At what starting
181 address will each
On a simple ofsystem
paging the additional
with 2^24requests
bytes ofbephysical
allocated?memory, 256 pages of logical CO4 K5 High Y Operating System
182 address space, and a page size of 2^10 btes, how many
On a simple paging system with 2^24 bytes of physical memory, bits are in a logical
256 pages address?
of logical CO4 K5 High Y Operating System
183 address space, and a page size of 2^10 btes, how many bits are in a page table? CO4 K5 High Y Operating System
184 Explain Contiguous and Non contiguous memory allocation with example CO4 K3 High N Operating System
Given memory
185 Differentiate partitions
between of 100 KB, 500
segmentation and KB, 200 KB, 300 KB, and 600 KB( in order),
paging? CO4 K4 High N Operating System
Distinguish
how would between physical
each off the address
first fit, space
best fit, and and logical
worst address space
fit algorithms place of
processes of
186 a212
process.
KB, 417 KB, 112 KB, and 426 KB (in order) ? Which algorithm makes the most CO4 K4 High N Operating System
187 efficient use of memory? CO4 K5 High Y Operating System
188 Define Segmented Paging. Illustrate why segmented paging is required. CO4 K4 High N Operating System
On a system using demand paging, it takes 120 ns to satisfy a memory request if the
page is in memory. If the page is not in memory, the request takes 5 ms. What would
189 be the page fault rate needed to achieve an effective access time of 1 microsec. CO4 K5 High Y Operating System
190 Illustrate the Belady’s Anomaly effect FIFO page replacement with an example. CO4 K4 High Y Operating System
191 Explain Least Recently Used algorithm in detail. CO4 K4 High Y Operating System
192 Distinguish
Define thebetween
different Associative and Set Explain
levels of memory? Associative
Cache Cache Mapping in
performance in detail
detail with CO4 K4 High N Operating System
193 formulaes. CO4 K4 High N Operating System
194 Compare Paging and Segmented paging briefly. CO4 K4 High N Operating System
195 Explain Virtual Memory concept in detail. CO4 K4 High Y Operating System
196 Explain briefly about Performance of Demand Paging. CO4 K6 High N Operating System
197 Explain causes of thrashing in detail. CO4 K5 High N Operating System
198 Discuss the concept of Swapping in Demand Paging. CO4 K2 High N Operating System
Suppose the following disk request sequence (track numbers) for a disk with
199 Explain
100 different
tracks
Explain types
theistranslation
given: 45, of
20,Mapping
of with
60,its
90, 10,Address
logical 50, features
80,
to 25, 70.in
Physical Cache.in
Assume
Address that the initial position of
Segmented CO4 K4 High N Operating System
the R/W
200 Paging head
using is on
example.
Write short notes on: track 50. Compute the additional distance in tracks that will be CO4 K4 High N Operating System
traversed
a. Devices by the R/W
independent head when the Shortest Seek Time First (SSTF) algorithm and
201 Explain
SCAN interrupt
(Elevator) handlerI/O
algorithm
software
inare
detail.
used (assuming that SCAN algorithm moves towards CO5 K2 High N Operating System
b. Device Controller
202 Consider
100 whenaitdisk
starts execution).
queue with CO5 K5 High Y Operating System
c. Interrupt
Suppose handler
a disk drive has 400request for ,input/output
cylinders numbered 0 to to 399.The
block cylinders
driver is currently
98, 183,
203 serving 37,
d. I/O Devices. 122, 14, 124, 65, 67 in that order. Assume
a request at cylinder 143.The queue of pending request that disk head is initially
in FIFO order is: CO5 K2 High N Operating System
positioned at cylinder 53 and
86,147,312,91,177,48,309,222,175,130. moving towards cylinder
Starting from number
the 0.
current Compute
head the total
position
204 Discuss
number the
of following:
head a) Magnetic
movements using disk b) CDs
Shortest Seekc) Time
DVDsFirst
d) Formatting
(SSTF) and Disk.
SCAN CO5 K2 Medium N Operating System
Define the total distance in cylinders that the disk to satisfy all the pending request
205 algorithms
for each of are
the respectively
following disk scheduling algorithms? CO5 K5 High Y Operating System
206 1] SCAN 2] C-SCAN
Define file management system? CO5 K5 High Y Operating System
207 Write
Defineshortthe notes on: of the file management system?
main tasks CO5 K1 High N Operating System
1. Device drivers
208 Define the different
2. Disk space managementFile system operations? Write the different file attributes. CO5 K4 High N Operating System
209 3. Disk scheduling algorithm CO5 K2 High N Operating System
210 List down and briefly explain file organization methods. CO5 K1 High N Operating System
211 Compare different file organization methods and and access mechanisms. CO5 K4 Medium N Operating System
212 Explain contigous allocation in file management in detail. CO5 K4 High N Operating System
213 Explain different levels of disk structure in detail. CO5 K4 High N Operating System
214 Define the typical access rights that may be granted or denied to a particular user for aCO5 K1 High N Operating System
215 Define directory?Which are the typical operations performed on file/directory? ? Defi CO5 K1 Medium N Operating System
216 Explain linked list allocation. CO5 K2 High N Operating System
217 Explain RAID structure in detail. CO5 K2 High N Operating System
218 Explain file system reliability & performance. CO5 K2 High N Operating System
219 Explain the following:
B+ Tree structure used for files in file management in detail. CO5 K4 High N Operating System
a) Interleaving
220 Explain linked list allocation of file.
b) pipelining CO5 K2 High N Operating System
221 c)Hard disk performance CO5 K2 High Y Operating System
222 Explain indexed allocation of file in detail. CO5 K2 High N Operating System
223 Explain file system implementation using linked list with index and i-node? CO5 K3 High N Operating System
224 Explain different file allocation methods. CO5 K2 High N Operating System
225 Define points to be considered in file system design? Explain linked list allocation & in CO5 K4 High N Operating System
226 Differentiate
Suppose a disk between
has 201windows
cylinders,and unix file from
numbered system.0 to 200. At some time the disk CO5 K4 Medium N Operating System
227 For
arm which
is at device
cylinder would
100, andpolling
therebeis a
a better
queue option
of disk : an output
access device
requests such
for as a
cylinders 30, CO5 K4 High N Operating System
printer
85, or an105,
90, 100, input device
110, 135 such as a mouse?
and 145. Why? Time First (SSTF) is being used for
If Shortest-Seek
228 Differentiate
scheduling between file and
anddatabase? Define
afterdevice independence?
servicing requests the CO5 K4 High N Operating System
Write shortthe diskon:
notes access then compute how many
229 request
a) Linux for cylinder 90 will be completed. CO5 K5 High Y Operating System
230 b) Unix CO5 K2 Medium N Operating System
231 Discuss file system with its advantages and disadvantages. CO5 K2 High N Operating System
232 Explain multi-level indexing in memory allocation to files. CO5 K2 High N Operating System
233 Explain free-space management in detail. CO5 K2 High N Operating System
234 Define disk scheduling? CO5 K1 Low N Operating System
235 Compare the performance of SCAN and SSTF scheduling and explain it using example. CO5 K4 Medium N Operating System
236 Explain swap-space mangement in detail. CO5 K2 High N Operating System
237 Explain the RAID levels useful in cases of head crashes on multiple disks? CO5 K3 High N Operating System
238 Explain file access control. CO5 K2 High N Operating System
239 Which
Which RAID Level is useful
disk schedulling in casesisofpreferably
algorithm failure of in
a single disk?
a single-processing enviornment that CO5 K3 High N Operating System
240 uses blocking I/O? Why? CO5 K3 High N Operating System
241 Explain which RAID level offer better performance under amost all typical loads. CO5 K4 High Y Operating System
242 Which disk schedulling agorithm would best optimize the performance of a RAM disk? CO5 K4 High Y Operating System
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14,
124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the
requests then compte the total number of head movements if the disk head is initially
243 at 53 CO5 K5 High Y Operating System
244 Define the principles of file protection. CO5 K1 Medium N Operating System
245 Compare
List down the
the performance ofof
different types FIFO andofSSTF
users scheduling and
files/directories. explain
Also list theit different
using example.
access CO5 K4 High N Operating System
246 rights that could be given to these users? CO5 K2 Medium N Operating System
247 Explain
Compare memory mapped Input/Output.
the performance of C-SCAN and SCAN scheduling and explain it using CO5 K2 Medium N Operating System
248 example. CO5 K4 High N Operating System
249 List down the different types of program threats in a file? CO5 K1 Medium N Operating System
250 Compare the different levels of RAID organization. CO5 K4 Medium N Operating System
Topic Unit Marks
OS functions 1 6
Classification of OS 1 6

Introduction to OS 1 2
Classification of OS 1 6

Kernel 1 6

Classification of OS 1 6
Classification of OS 1 2

Introduction to OS 1 6
Kernel 1 2
Classification of OS 1 6
Introduction to OS 1 6
Reentrant Kernels 1 2
Monolithic, Microkernel 1 6
Introduction to OS 1 6
Introduction to OS 1 2

Introduction to OS 1 6
Introduction to OS 1 6
Multiprocessor Systems 1 6
Introduction to OS 1 6
Introduction to OS 1 2
Introduction to OS 1 2

Introduction to OS 1 6
Real Time System 1 6
Real Time System 1 2
Real Time System 1 2
Classification of OS 1 6
Introduction to OS 1 6
Operating system and functions 1 6
Monolithic, Microkernel 1 6
OS functions 1 9
Introduction to OS 1 6
OS Structure-Layered structure 1 6
Kernel 1 2
Introduction to OS 1 2
Monolithic and Microkernel System 1 2
Introduction to OS 1 6
Real Time System 1 6
Multiprocessor Systems 1 6
Operating system and functions 1 6
Introduction to OS 1 6
Introduction to OS 1 6
OS Structure 1 6
OS Structure-Layered 1 6
Multiprocessor Systems 1 6

Introduction to OS 1 6
Classification of OS 1 6
Introduction to OS 1 6

Introduction to OS 1 6
Classification of OS 1 9

Introduction to OS 1 6
Process cycle 2 6
Process cycle 2 9
Process cycle 2 6
Threads 2 6
Threads 2 2
Process comunication 2 9
Threads 2 9
CPU scheduling 2 9
CPU scheduling 2 2
CPU scheduling 2 6
CPU scheduling 2 6
CPU scheduling 2 9
CPU scheduling 2 9

CPU scheduling 2 6
CPU scheduling 2 6
CPU scheduling 2 6
CPU scheduling 2 9

CPU scheduling 2 9
CPU scheduling 2 9

CPU scheduling 2 9
CPU scheduling 2 9
Deadlocks 2 6
Process 2 6
Deadlocks 2 2
CPU scheduling 2 9
Deadlocks 2 9
Deadlocks 2 9
Deadlocks 2 9
Deadlocks 2 6
CPU scheduling 2 6
Schedulling 2 9
Schedulling 2 6
Schedulling 2 2
Threads 2 2
Schedulling 2 6
Schedulling 2 9
Schedulling 2 2
Schedulling 2 6
Deadlock 2 2
Process 2 6

Process 2 6
Deadlock 2 9
Deadlock 2 9
Process 2 6
Deadlock 2 6

Synchronization 2 6
Deadlock 2 6
Process 2 9
Deadlock 2 9
Process 2 9
Critical section 3 9
Critical section 3 6
Semaphore 3 6
Semaphore 3 6
Semaphore 3 6
Dining Philosophers Problem 3 6
Concurrent Processes 3 2
Semaphore 3 6
Monitor 3 6
Synchronization 3 6
Process 3 6
Interprocess communication 3 9
Interprocess communication 3 6
Mutual exclusion 3 6
Producer consumer problem 3 9
Dining Philosophers Problem 3 9
Synchronization 3 9

Semphore 3 6
Dining Philosophers Problem 3 9
Semphore 3 6

Semaphore 3 6

Principle of concurrency 3 9
Dekker’s solution 3 9
Deadlock 3 6
Mutual exclusion 3 6
Semaphore 3 6
Semaphore 3 6
Dining Philosophers Problem 3 9
Peterson's solution 3 9
Process generation 3 6
Critical section 3 9
Sleeping barber problem 3 9
Process 3 9
Process 3 9
Synchronization 3 9
IPC 3 6
Dining Philosophers Problem 3 9
Synchronization 3 9
Concurrent Processes 3 6

Concurrent Processes 3 6
Process 3 6

Semaphore 3 9
Process 3 6
Synchronization 3 6
Synchronization 3 6
Dining Philosophers Problem 3 9
Peterson's solution 3 6
Mutual exclusion 3 6

Concurrent Processes 3 6
Peterson's solution 3 6

Memory management 4 6

Memory management 4 6

Memory management 4 9
Fragmentation 4 9
Memory allocation 4 6
Memory allocation 4 6
Memory management 4 9
Replacement Algorithm 4 9
Replacement Algorithm 4 9

Replacement Algorithm 4 9
Memory management 4 6
Paging 4 9
Paging 4 9
Paging 4 9
Segmentation 4 6
Paging 4 6
Memory management 4 6
Paging 4 9
Paging 4 9
Paging 4 9
Paging 4 9
Page replacement 4 6
Page replacement 4 6
Memory management 4 6

Memory management 4 9
Memory management 4 9
Paging and segmentation 4 6

Memory allocation 4 9
Memory allocation 4 9
Memory management 4 9
Memory management 4 6
Paging 4 6
Paging 4 6
Memory allocation 4 6
Paging and segmentation 4 9
Memory management 4 6
Memory management 4 9
Segmented Paging 4 6

Memory management 4 9
Replacement Algorithm 4 9
Replacement Algorithm 4 9
Cache Set Associate Mapping 4 6
Cache 4 6
Paging 4 6
Virtual Memory 4 6
Demand Paging 4 9
Thrashing 4 6
Demand Paging 4 6
Cache Mapping 4 9
Segmented Paging 4 9
I/O Management and Disk Scheduli 5 9
disk scheduling 5 9
I/O Management and Disk Scheduli 5 9
I/O Management and Disk Scheduli 5 6
disk scheduling 5 9
disk scheduling 5 9
File management 5 6
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
file organization 5 9
file organization 5 6
file organization 5 6
file organization 5 9
I/O Management and Disk Scheduli 5 6
Directory 5 6
I/O Management and Disk Scheduli 5 6
RAID 5 9
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
File 5 9
File system implementation 5 6
File allocation 5 6
I/O Management and Disk Scheduli 5 6
File system 5 6
I/O Management 5 6
I/O Management 5 6
disk scheduling 5 9
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 9
disk scheduling 5 2
disk scheduling 5 9
I/O Management and Disk Scheduli 5 6
RAID 5 6
disk scheduling 5 9
RAID 5 9
I/O Management and Disk Scheduli 5 6
RAID 5 6
I/O Management and Disk Scheduli 5 6
Disk Scheduling 5 9
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
File system protection 5 6
I/O Management and Disk Scheduli 5 6
I/O Management and Disk Scheduli 5 6
File system protection 5 6
RAID 5 6