B.TECH - Semester 5 operating systems Question Paper 2020 (feb)
Practice authentic previous year university questions for better exam preparation.
Sample Questions
- (a) Explain the file system calls with examples.
- (b) Discuss the various issues of implementation of file systems.
- How does multiprogramming help in improving the performance of a computer system.
- Discuss (i) Multilevel queue scheduling (ii)Multilevel feedback queue scheduling
- Explain the Readers and Writers problem and its implementation using Semaphores.
- Explain the mechanism of paging with example.
- Explain the deadlock detection mechanism.
- Discuss the essential properties of the following types of operating systems. (i) Batch (ii) Interactive (iii) Time sharing (iv) Real time (v) Network
- (a) Explain the process state and process control block with neat diagrams.
- (b) Discuss two fundamental models of interprocess communication.
- (a) Calculate the average turnaround time, average waiting time and draw the Gantt chart for the following Table using preemptive priority algorithm. Assume low priority value has highest priority. | Table 1 Process | Arrival Time | Burst Time | Pri...
- (b) What are counting semaphores? Describe the bounded buffer producer and consumer problem. Write the solution for the same using semaphores and highlight the significance of the use of counting semaphores.
- (a) Explain the procedure for handling page fault with a neat diagram.
- (b) Explain the different disk scheduling algorithms.
- (a) Distinguish between:
- (i) Logical address space and Physical address space (ii) Internal fragmentation and External Fragmentation (iii) Paging and Demand Paging (iv) Swapping and Overlays
- (v) Local page replacement and global page replacement.
- (b) Consider the page reference string: $12,13,14,15,13,12,16,17,13,12,13,14,11$, $17,11,14,13,12,13,14,17$ for a program of page size 1 KB . If 3 KB of primary memory is allocated to this program, calculate the number of page faults for FIFO, LRU an...
- Explain the effective implementation of access matrix. Discuss the strengths and weaknesses of implementing an access matrix using access lists that are associated with objects.
- Consider the following snapshot of the system, with four types of resources and 3 processes, P1, P2 and P3. Available resources vector A: [4 1 0 1 ]; Current matrix $\mathrm{R}: \mathrm{P} 1\left[\begin{array}{llll}3 & 4 & 4 & 0\end{array}\right] ; ...
- Consider the following snapshot of the system, with four types of resources and 3 processes, P1, P2 and P3. Available resources vector A: [4 1 0 1 ]; Current matrix $\mathrm{R}: \mathrm{P} 1\left[\begin{array}{llll}3 & 4 & 4 & 0\end{array}\right] ; ...