30-10-2012, 12:52 PM
IV B.Tech I Semester Regular Examinations - OPERATING SYSTEMS
OPERATING SYSTEMS.pdf (Size: 76.23 KB / Downloads: 28)
1. With the help of neat block diagram, describe the computer components with an
example. [16]
2. (a) Describe various operations on threads.
(b) Discuss about threads synchronization.
© Write about Kernel level threads. [6+5+5]
3. (a) Explain busy waiting and blocking wait.
(b) Is busy waiting always less efficient (in terms of using process or time) than a
blocking wait? Explain. [8+8]
4. (a) How mutual exclusion, hold and wait and circular wait are different from each
other? Explain with the help of examples.
(b) Write an algorithm to detect the occurrence of deadlocks. [8+8]
5. (a) Cleary explain how, in general a virtual address generated by the CPU is
translated into a physical main address.
(b) A process contains eight Virtual Pages in disk and is assigned a fixed allocation
of four page frames in main memory. The following page trace occurs: 1, 0,
2, 2, 2, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5 .
i. how the successive pages residing in the four frames using the LRU re-
placement policy. Compute the hit ratio in main memory. Assume the
frames are initially empty.
ii. for FIFO replacement policy. [8+8]
6. (a) Discuss about various criteria used for short-term scheduling.
(b) Discuss about fair share scheduling method. [8+8]
7. Write about
(a) Free space management.
(b) Reliability of a file allocation. [8+8]
8. What do you understand by Trusted systems? Draw a figure of reference monitor
concept and explain.