Unit-Wise Question Bank: 8M Questions
Unit-Wise Question Bank: 8M Questions
Unit-Wise Question Bank: 8M Questions
(OS)
UNIT 1: INTORDUCTION TO OS
8M Questions
1. Define operating system and list the basic services provided by operating system.
2. Differentiate among the following types of OS by defining their essential properties.
a) Time sharing system
b) Parallel system
c) Distributed system
d) Real time system
3. Explain the essential properties of
a) Batch System
b) Time sharing
c) Real time
d) Parallel
e) Distributed
f) Handheld
g) Embedded
h) Smart Card O.S
4. Differentiate among the following types of OS by defining their essential properties:
a) Time Sharing System
b) Parallel System
c) Simple batch System
d) Real time System
5. Explain batch system and Multiprogrammed System in detail.
6. Explain the terms :
a) Real time System
b) Distributed System
7. Explain the terms :
a) Parallel System
b) Batch System
8. Explain O.S as extended machine in detail.
9. Explain OS as resources manager
(OS)
a) Monolithic System
b) Layered Systems
c) Micro Kernels
d) Client Server Model
e) Virtual Machines
f) Exokernels
(OS)
8M Question
1) Define process and Explain process states in details with diagram
2) Explain process states and process control block in details
3) Explain the process state transition diagram used in multiprogramming environment.
Describe the fields in a process control block (PCB).What is switching overhead?
4) What is thread? Explain classical thread model
OR Explain threads in detail
5) Explain and differentiate between user level and kernel level thread.
6) List the main difference and similarities between threads and process.
7) What are various criteria for a good process scheduling algorithm? Explain any two
preemptive scheduling algorithms in brief.
8) Explain the following process scheduling algorithm
a) Priority scheduling
b) Shortest job first scheduling
9) Explain the effect of increasing the time quantum to an arbitrary large Number and
decreasing the time quantum to an arbitrary small number for round robin scheduling
algorithm with suitable example?
10) Consider following processes with length of CPU burst time in milliseconds
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
37. Consider following processes with length of CPU brust time in millisecond
Process Brust Priority
time
P1 10 3
(OS)
P2 1 1
P3 2 3
P4 1 4
P5 5 2
All processes arrived in order p1, p2, p3, p4, p5 all at time zero.
1) Draw Gant charts illustrating execution of these processes for SJF, non preemptive priority
(smaller priority number implies a higher priority) & round robin(quantum=1)
2) Calculate turnaround time for each process for scheduling algorithm in part (1)
3) Calculate waiting time for each scheduling algorithm in part (1)
38. Explain the following term related to IPC: a) Race condition b) critical region
39. What are critical sections? Why mutual exclusion required? Explain any 2 methods of
achieving mutual exclusion in detail.
40. Explain the terms related to IPC –a) Race condition b) critical section c)Mutual exclusion
d)Semaphores
41. Explain in detail the following solutions for achieving mutual exclusion a)look variable
b)TSL instruction
42. Explain Peterson’s solution for achieving mutual exclusion
43. Discuss in detail following solution for achieving mutual exclusion a) Disabling interrupts b)
Strict alteration
44. Explain semaphore in detail
45. What is semaphore? Discuss product-consumer problem with semaphore.
46. Write short note on: a) Dining philosopher problem b) System calls c) Monitors
d) Peterson’s solution for achieving mutual exclusion e) Semaphores
f) Readers & writers problem.
47. Explain the terms: a) time sharing b) mutual exclusion
48. What is monitor? Explain solution for producer-consumer problem using monitor. Explain
monitors in detail.
49. Write short on: a) message passing b) shell
50. How message passing is used in IPC.
51. What is message passing? Discuss procedure consumer problem with message passing.
52. Explain use of message passing & semaphore for inter process communication?
53. Explain dinning philosopher problem & its solution.
54. What is dinning philosopher problem? Explain its solution with monitor.
(OS)
55. What is dinning philosopher problem? Explain its solution with semaphore.
56. Explain readers & writers problem? Give its solution with semaphore.
57. Write short notes on: a) Process states b) Critical section c) Race condition
d) Starvation e) PCB f) Two level scheduling g) Round robin scheduling
(OS)
(OS)
(OS)
(OS)
108. On a simple paging system with 2^24 bytes of physical memory, 256 pages of logical
address Space, and a, page size of 2^10 bytes, how many bits are in logical address?
109. A certain computer provides its user with a virtual memory space of 2^32 bytes. The
computer has 2^35 bytes of physical memory. The virtual memory is implemented by paging the
page size is 4096 bytes. A user process generates the virtual address 11123456. Explain how the
system establishes the corresponding physical location.
110. Calculate page faults for (LRU, FIFO, OPT) for following sequences where page frame is
three.
0,1,2,1,4,2,3,7,2,1,3,5,1,2,5.
(OS)
111. Discuss briefly the following issues related to device independent i/o software.
a. Uniform interfacing for device drivers.
b. Buffering.
112. Discuss in details devices drivers.
113. Write short notes on:
a. Devices independent I/O software
b. Goals of I/O software
c. Interrupt handler
d. I/O Devices.
e. Device drivers
f. Device controllers
g. Disk space management
h. Disk arm scheduling algorithm
114. Discuss the following:
a) Magnetic disk
b) CDs
c) RAID
d) DVDs
e) Formatting Disk
115. Discuss the following related to disk space management
a) Block size
b) Keeping track of free blocks.
116. Suppose a disk drive has 400 cylinders , numbered 0 to 399.The driver is currently serving a
request at cylinder 143 and previous request was at cylinder 125 .The queue of pending request
in FIFO order is: 86,147,312,91,177,48,309,222,175,130.
Starting from the current head position what is the total distance in cylinders that the disk to
satisfy all the pending request for each of the following disk scheduling algorithms?
1] SSTS 2] SCAN 3] C-SCAN
(OS)
117. What are the conditions for deadlock? Explain deadlock detection and recovery in detail.
A/M 2011 8M.
118. Explain deadlock prevention in detail. N/D 2011 8M M/A 2009.
119. Write short notes on:
a. Deadlock modeling (DEC 2008 O/N2010) 6M(N/D2008).
b. Bankers algorithm. A/M 2011 6M.
120. Explain deadlock avoidance using banker’s algorithm in details. O/N2010 8M M/J 2009
8M.
121. What is deadlock? Explain deadlock detection with multiple resources of each type. M/A
2010 8M.
122. Explain bankers algorithm for multiple resources to avoid deadlock. M/A 2010 8M.
123. Explain various methods for recovery from deadlock.DEC 2010 8M.
124. Discuss deadlock detection with one resource of each type.DEC 2009 8M.
125. Write short notes on-
a) Bankers algorithm for single resources.
b) Ostrich algorithm. M/J 2010 6M M/A 2010.
126. Explain deadlock avoidance with suitable example using banker’s algorithm. M/J 2012
8M.
127. Consider the following snapshot-
Allocated Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
(OS)
128. What are deadlock? Explain its model with example. Explain any three methods of
dealing with deadlock. N/D 2008 8M.
129. A system has three types of resources R1 R2 R3 and their number of units are 3, 2, 2
respectively. Four processes P1 P2 P3 p4 are currently competing for these resources in
following number.
1. P1 is holding one unit of R1 and is requesting for one unit of R2.
2. P2 is holding two units of R2 and is requesting for one unit each of R1 and
R3.
3. P3 is holding one unit of R1 and is requesting for one unit of R2.
4. P4 is holding two units of R3 and requesting for one unit of R1.
Determine which if any of the processes are deadlock in this state. M/J 2012 8M.
130. Explain swap space management methods of disk in detail. N/D 2008 8M.
131. Consider system with total of 150 minutes of memory allocated to three processes as
shown. Apply banker’s algorithm to determine whether it would be safe to grant each of
following request. If yes-Indicate sequence of termination that could be possible. If no- Show
reduction of resulting allocation table.
1. A 4th process is arrived with maximum need of 60 and initial need
of 25 units.
2. A 4th process is arrived with maximum need of 60 and initial need
of 35 units.
(OS)