TRIBHUVAN UNIVERSITY
INSTITUTE OF SCIENCE AND TECHNOLOGY
2080 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.
- 1How DMA operation is performed? Consider a disk with $200$ tracks and the queue has random requests from different processes in the order: $45, 48, 29, 17, 80, 150, 28$, and $188$. Find the seek time using FIFO, SSTF and SCAN. Assume that the initial position of head is at $100$.
- 2How do you distinguish between deadlock and starvation? Describe the necessary conditions for deadlock. Explain the working mechanism of TLB.
- 3Why do we need to schedule process? Find the average waiting time and average turnaround time for the following set of processes using FCFS, SJF, RR (Quantum $= 3$) and Shortest Remaining Time Next.

Group B
Short Answer QuestionsAttempt any Eight questions.
- 4What is system call? Describe the transition between different states of a process.
- 5Discuss about contiguous and linked list allocation approach in implementing files.
- 6Why do we need virtual memory? Describe the structure of a page table.
- 7Illustrate the term safe and unsafe state in deadlock prevention with a scenario.
- 8How lock variable is used in achieving mutual exclusion? Describe.
- 9Why do we need hierarchical directory system? Explain the structure of a disk.
- 10Find the number of page faults using FIFO and LRU for the reference string, $4, 7, 6, 1, 7, 6, 1, 2, 7, 2$ with frame size $3$.
- 11Define working set. How does clock page replacement algorithm work?
- 12Write short notes on: a. Inodes b. RAID