TRIBHUVAN UNIVERSITY
INSTITUTE OF SCIENCE AND TECHNOLOGY
2081 B.S.
Candidates are required to give their answers in their own words as far as practicable.
Group A
Long Answer QuestionsAttempt any Two questions.
- 1Explain the translation of logical address into physical address using segment table with necessary diagram. List advantages and disadvantages of segmentation.
- 2Find the seek time using SCAN, C-SCAN, Look and C-Look disk scheduling algorithm for processing the following requests queue: $35, 70, 45, 15, 65, 20, 80, 90, 75, 130$. Suppose the disk has tracks numbered from $0$ to $150$ and assume the disk arm to be at $30$ and moving outward.
- 3Explain Sleeping Barber problem. Illustrate on how it can be solved.
Group B
Short Answer QuestionsAttempt any Eight questions.
- 4Explain microkernels and exokernels.
- 5Consider a swapping system in which memory consists of the following hole sizes in memory order $15$ MB, $2$ MB, $10$ MB, $6$ MB, $8$ MB and $20$ MB. Which hole is taken for successive segment requests of a) $6$ MB b) $10$ MB c) $8$ MB for first fit, next fit and best fit.
- 6Explain how semaphore solves the problem of critical section?
- 7How do you think deadlock can be avoided? Explain.
- 8Explain Inter-Process Communication in Linux.
- 9List different file structures and explain them.
- 10Calculate the average waiting time and turn around time using priority algorithm (Priority $1$ being the highest) for the given scenario:

- 11Explain memory mapped IO.
- 12Write short notes on: a) Virtual memory b) Race condition