Tribhuvan University
Institute of Science and Technology
2080-new
Bachelor Level / fourth-semester / Science
Computer Science and Information Technology( CSC264 )
Operating System
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Time: 3 Hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.
SECTION A
Attempt any TWO question.
How 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 the initial position of head as 100.
How do you distinguish between deadlock and starvation ? Describec. Explain working mechanism of TLB.
Why 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.
Process | CPU brust time | Arrival time |
P1 | 20 | 0 |
P2 | 25 | 15 |
P3 | 10 | 30 |
P4 | 15 | 45 |
SECTION B
Attempt any EIGHT question
What is system call ? Describe the transition between different states of process.
Discuss about contiguous and linked list file allocation technique.
Why do we need virtual memory? Describe the sructure of a page table.
Illustrate the term safe and unsafe state in deadlock prevention with scenario.
How lock variable is used in achieving mutual exclusion? Describe.
Why do we need hierarchical directory system? Explain structure of disk.
Find the number of page fault using FIFO and LRU for the refrence string 4, 7, 6, 1, 7, 6, 1, 2, 7, 2 with frame size 3.
Define working set. How does clock replacement algorithm works?
Write short notes on :