TRIBHUVAN UNIVERSITY
INSTITUTE OF SCIENCE AND TECHNOLOGY
2079 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.
- 1Discuss about single level and two-level directory system. Consider the following process and answer the following questions. A. What is the content of matrix Need? B. Is the system in safe state? C. If P1 request $(0,4,2,0)$, can the request be granted immediately.

- 2When does race condition occur in inter process communication? What does busy waiting mean and how it can be handled using sleep and wakeup strategy?
- 3Define shell and system call. Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At same time the disk arm is at cylinder $95$, and there is a queue of disk access requests for cylinders $82, 170, 43, 140, 24, 16$ and $190$. Calculate the seek time for the disk scheduling algorithm FCFS, SSTF, SCAN and C-SCAN.
Group B
Short Answer QuestionsAttempt any Eight questions.
- 4Distinguish between starvation and deadlock. How does the system schedule process use multiple queues?
- 5List any two demerits of disabling interrupt to achieve mutual exclusion. Describe about fixed and variable partitioning.
- 6For the following dataset, compute average waiting time for SRTN and SJF.

- 7Discuss the advantages and disadvantages of implementing file system using Linked List.
- 8Consider the page references $7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2$. Find the number of page fault using OPR and FIFO, with $4$ page frame.
- 9Describe the working mechanism of DMA.
- 10What is the task of disk controller? List some drawback of segmentation.
- 11Write the structure and advantages of TLB.
- 12Why do we need the concept of locality of reference? List the advantages and disadvantages of Round Robin algorithm.