Tribhuvan University
Bachelor of Information Technology
Semester 3 · TU Board 2078
Course Title: Operating System (BIT204)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
Group A
Attempt any Two questions.(2 × 10 = 20)
- 1.10
Suppose that a disk has 100 cylinders, numbered 0 to 99. The drive is currently serving a request at cylinder 45. The queue of pending request, in FIFO order is: 88, 72, 13, 74, 48, 9, 22, 50, 35 and 50. What is the total distance (in cylinders) that the disk arm moves to satisfy all pending request for each of the following disk scheduling algorithms? a) FCFS b) SCAN c) SSTF
Answer comingAlso asked in 2080
- 2.10
Why virtual memory technique is used in the computer system? What is logical address? Explain the process of conversion of logical address to physical address in single level paging scheme.
Answer comingAlso asked in 2080
- 3.10
What is critical section? What are the operations that can be performed on the semaphore? Explain the solution to producer consumer problem using semaphore.
Group B
Attempt any Eight questions(8 × 5 = 40)
- 4.5
Draw and describe the 5-state process model.
Answer comingAlso asked in 2080, 2079
- 5.5
What is kernel? Differentiate between monolithic and microkernel structure.
- 6.5
What is DMA? Explain how it works in brief with suitable diagram.
- 7.5
What are different types of file? Describe the sequential and random access of files.
- 8.5
What is deadlock? What are necessary conditions for deadlock? Explain.
- 9.5
What is thread? Explain user level thread and kernel level thread.
Answer comingAlso asked in 2079
- 10.5
A 2 GB hard disk has 2 KB block size, calculate the size of bitmap for bitmap based free space management.
- 11.5
What is an operating system? Differentiate between time sharing and real time operating system.
Answer comingAlso asked in 2083, 2079
- 12.5
Consider the following set of processes, with the length of CPU brust time given in milli seconds.ProcessCPU Burst (ms)PriorityArrival Time (ms)A830B91 (Lowest)0C1020D64 (Highest)0
— The End —