Operating Systems (15CS64):

Question Bank - Module 04 &

05

Questions
Following are the consolidated questions from your earlier VTU question
papers for the said portions for IAT-03.
1. Explain the different types of directory structures with examples and
mention their advantages and disadvantages.
2. With supporting diagrams, explain linked and indexed method of al-
locating disk space.
3. Explain the following disk scheduling algorithms in brief.
a) SSTF
b) SCAN
c) LOOK
4. What is protection? Distinguish between mechanisms and policies.
Explain briefly the access matrix with domains as objects.
5. Consider the following reference string for a memory with 3 frames.
How many page faults will occur for FIFO, LRU and optimal page
replacement algorithms? Which is the most efficient algorithm? Ref-
erence string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
6. Distinguish between : 1. Logical versus physical address space 2.
Paging versus segmentation 3. First fit and best fit algorithms.
7. Explain the difference between protection and security? Describe the
scheme of capability lists to implement protection.
1
2
8. What are the three methods for allocating disk space? Explain with
suitable example.
9. Explain the performance of demand paging
10. Suppose that a disk has 50 cylinders named 0 to 49. The R/W head is
currently serving at cylinder 15. The queue of pending requests are in
order “ 4 40 11 35 7 14 starting from the current head position. What
is the total distance traveled (in cylinders) by the disk arm to satisfy
the requests using algorithms FCFS, SSTF and LOOK. Illustrate with
figure in each case.
11. Consider the following page reference string 1, 2,3, 4, 2, 1, 5, 6, 2, 1,
2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the
following page replacement algorithms assuming 3 and 5 frames. 1.
LRU 2. Optimal.
12. What is thrashing? Explain the methods to handle it.
13. What is a page fault? With a supporting diagram, explain the steps
involved in handling page fault.
14. What do you mean by free space list? With suitable example, explain
any two methods of implementation of free space list.
15. What is access matrix? Explain the different methods of implement-
ing access matrix.
16. What are the three methods for allocating disk space? Explain with
suitable example.
17. Write a short note on
a) COW
b) Additional reference bit algorithm
c) Second chance algorithm
d) Enhanced second chance algorithm
e) Counting-based page replacement algorithms
f) Page-buffering algorithms
g) Design principle of Linux
h) Process management in Linux
18. What are Translation Load aside Buffers (TLB)? Explain TLB in
detail with an simple paging system with an neat diagram.
19. Explain demand paging in detail.
20. A disk drive has 5000 cylinders numbered from 0 to 4999. If the disk
head is currently at a cylinder 143, and a queue of pending requests
are 86, 1470, 913, 1774, 948, 1509, 1022 1756,130, then, derive the
total head movements to satisfy all the pending requests for FCFS,
SSTF, LOOK and SCAN disk scheduling algorithms.