Chapter 1: Operating System Overview
Define the terms shell and system call. How is it handled? Illustrate with a suitable example. (2079)
1 What is a system call? Describe the transition between different states of a process. (2079)
2 When does a request switch from user mode to kernel mode? Give an answer with an example. (2078)
3 What is a system call? Discuss the process of handling system calls briefly. (2078)
4 What are two modes of OS? Discuss different OS structures briefly. (2076)
5
Chapter 2: Process Management
Explain the Sleeping Barber problem. Illustrate how it can be solved. (2081)
6 Calculate the average waiting time and turnaround time using the priority algorithm (Priority 1 being the highest) for the given scenario. (2081)
7 Explain how a semaphore solves the problem of a critical section. (2081)
8 Explain Inter-Process Communication in Linux. (2081)
9 9 Define the term race condition. Justify that a race condition leads to data loss or incorrect data. (2080)
10 How do you distinguish between deadlock and starvation? (2080)
11 Find the average waiting time and average turnaround time for the following set of processes using FCFS, SJF, RR (Quantum = 3), and the shortest remaining time next. (2080)
12 When does race condition occur in inter-process communication? What does busy waiting mean and how can it be handled using sleep and wakeup strategy? (2079)
13 Distinguish between starvation and deadlock. How does the system schedule a process using multiple queues? (2079)
14 For the following dataset, compute the average waiting time for SRTN and SJF. (2079)
15 What kind of problem arises with the sleep and wakeup mechanism of achieving mutual exclusion? Explain with a suitable code snippet. (2078)
16 How do you recognize a critical section? Why do we need to synchronize it? (2078)
17 Can deadlock occur in the case of preemptive resources? List the conditions for deadlock. Define the allocation graph with an example. (2078)
18 Find the average waiting time and turnaround time for the process scheduling algorithms FCFS, Priority, and RR (Quantum = 2) in the following given dataset. (2078)
19 What is a lock variable? Discuss its working and problems associated with it in detail. (2078)
20 Discuss the concept of SJF and SRTN scheduling algorithms with a suitable example. (2078)
21 What is the problem associated with semaphores? Explain the concept of monitors in brief. (2076)
22 What are the main goals of interactive system scheduling? Discuss priority scheduling along with its pros and cons. (2080)
23 When are threads better than processes? Explain the concept of user-level threads in detail. (2076)
24 Differentiate between multi-programming and monoprogramming. What will be the CPU utilization with 6 processes with 60% I/O waiting time in memory? (2076)
25 How can you manage free disk space? Explain the linked list approach of managing free disk space with an example. [Repeated: 2078, 2076]
26 Define interactive system goals? List various interactive scheduling algorithms. Consider the following process data and compute average waiting time and average turnaround time for RR(quantum 10) and priority scheduling algorithms. (2076)
27 What makes a thread different from a process? Draw the transition diagram between the states of a process. [Repeated: 2080]
28 How threads differ from processes? Explain thread usages. [Repeated: 2080]
29 What is the main purpose of disk scheduling algorithms? Which disk scheduling technique is best but impractical? Explain the algorithm with an example. (2080)
30 List any two demerits of disabling interrupts to achieve mutual exclusion. Describe about fixed and variable partitioning. (2079)
31 When does a page fault occur? Give a structure of a page table. [Repeated: 2080]
32
Chapter 3: Process Deadlocks
How do you think deadlock can be avoided? Explain. (2081)
33 Illustrate the term safe and unsafe state in deadlock prevention with a scenario. (2079)
34 How starvation differs from deadlock? Consider the following situation of processes and resources: (2080)
35 What will happen if process P3 requests 1 resource? (2080)
36 What will happen if process P4 requests 1 resource? (2080)
37 How unsafe state differs from a deadlocked state? Consider the following initial state and identify whether the request is granted or denied for the given cases. (2078)
38 What will happen if process D requests 1 resource? (2078)
39 What will happen if process A requests 1 resource? (2078)
40 What is a resource allocation graph? Explain the process of detecting deadlocks when there is a single instance of each resource with a suitable example. (2078)
41 Differentiate between deadlock and starvation? Discuss the process of detecting deadlocks when there are multiple resources of each type. (2076)
42 Is the system in a safe state? (2079)
43 If P1 requests (0,4,2,0) can the request be granted immediately? (2079)
44
Chapter 4: Memory Management
Explain the translation of a logical address into a physical address using a segment table with a necessary diagram. (2081)
45 List advantages and disadvantages of segmentation. (2081)
46 Explain microkernels and exokernels. (2081)
47 Consider a swapping system in which memory consists of the following hole sizes in memory order: 15 MB, 2 MB, 10 MB, 6 MB, 8 MB and 20 MB. Which hole is taken for successive segment requests of: (a) 10 MB and (b) 10 MB for first fit, next fit and best fit. (2081)
48 Explain memory-mapped I/O. (2081)
49 Explain the working mechanism of TLB. (2080)
50 Why do we need virtual memory? Describe the structure of a page table. (2079)
51 Find the number of page faults using FIFO and LRU for the reference string 4, 7, 6, 1, 7, 6, 1, 2, 7, 2 with a frame size of 3. (2079)
52 Define working set. How does the clock replacement algorithm work? (2079)
53 What are the physical addresses for the following logical addresses? (2080)
54 a. 0,430 (2080)
55 b. 1,10 (2080)
56 c. 1,11 (2080)
57 d. 2,500 (2080)
58 When a page fault occurs and how it is handled? Demonstrate the second chance and LRU page replacement algorithm for memory with three frames and the following reference string: 1,3,7,4,5,2,3,6,4,5,7,8,5,1,4. (2080)
59 Consider the request for the page references 7,0,1,2,0,3,0,4,2,3,0,3,2. Find the number of page faults for FIFO and LRU with 4 page frames. (2078)
60 Explain different memory allocation strategies. (2078)
61 Differentiate between paging and segmentation. (2078)
62 What does Belady's anomaly mean? What are the benefits of multiprogramming over uniprogramming? (2078)
63 How can we achieve mutual exclusion? Describe. (2078)
64 Why OPR is the best but not a practically feasible page replacement algorithm? Calculate the number of page faults for OPR, LRU, and Clock page replacement algorithm for the reference string: 1, 3, 4, 2, 3, 5, 4, 3, 1, 2, 4, 6, 3, 2, 1, 4, 2. Assume the memory size is 3. (2078)
65 Differentiate between internal and external fragmentation? Suppose that we have a memory of 100 KB with 5 partitions of size 150 KB, 200 KB, 250 KB, 100 KB, and 300 KB. Where the processes A and B of size 175 KB and 125 KB will be loaded, if we use Best-Fit, and Worst-Fit Strategy? (2078)
66 How Second Chance page replacement algorithm differs from FIFO page replacement policy? Discuss the concept of Belady’s anomaly with a suitable example. (2076)
67 Why program relocation and protection is important? Explain the technique of achieving program relocation and protection. (2076)
68 Consider the page references 7,0,1,2,0,3,0,4,2,3,0,3,2. Find the number of page faults using OPR and FIFO, with 4 page frames. (2079)
69 Why do we need the concept of locality of reference? List the advantages and disadvantages of the Round Robin algorithm. (2079)
70
Chapter 5: File Management
List different file structures and explain them. (2081)
71 Discuss about contiguous and linked list file allocation technique. (2079)
72 Why do we need a hierarchical directory system? Explain the structure of a disk. (2079)
73 Explain directory implementation techniques employed in operating systems briefly. (2080)
74 What is an I-node? Why is it superior to other file allocation approaches? Consider a 20-GB disk with an 8-KB block size. How much memory space will be occupied if contiguous, and File Allocation Table is used for file allocation? Assume that each FAT entry takes 4 bytes. (2080)
75 Discuss contiguous and linked list file allocation techniques. [Repeated: 2079, 2078]
76 What is meant by file attributes? Discuss any one technique of implementing directories in detail. (2078)
77 What approaches are used for managing free disk spaces? Explain the linked list approaches with an example. (2078)
78 Discuss the advantages and disadvantages of implementing a file system using a Linked List. (2079)
79 What is the task of a disk controller? List some drawbacks of segmentation. (2079)
80 Discuss about single level and two level directory systems. (2079)
81
Chapter 6: Device Management
Find the seek time using SCAN, C-SCAN, Look and C-Look disk scheduling algorithms for processing the following request queue: 35, 70, 45, 15, 65, 20, 80, 90, 75, 130. Suppose the disk has tracks numbered from 0 to 150 and assume the disk arm to be at 30 and moving outward. (2081)
82 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 the head as 100. (2080)
83 Suppose a disk has 201 cylinders, numbered from 0 to 200. At the same time, the disk arm is at cylinder 10, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135, and 145. Find the total seek time for the disk scheduling algorithm FCFS and SSTF. Assume the head is moving inward. (2078)
84 What are the advantages of using interrupts? Describe. (2078)
85 Why the concept of disk interleaving is important? Explain with a suitable example. (2078)
86 What is the main objective of disk scheduling algorithms? why SSTF is not practically feasible? Assume that we have a disk with 100 tracks and currently the head is at track number 35. What will be the seek time for the algorithms SCAN and LOOK for processing IO requests queue: 52, 67, 27, 11, 43, 85, 18, 75, 92, 8? (2076)
87 When is programmed I/O suitable than other I/O handling techniques? Explain the process of I/O handling using DMA. (2076)
88 Suppose a disk has 201 cylinders, numbered from 0 to 200. At the 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. (2079)
89 Describe the working mechanism of DMA. (2079)
90 Write the structure and advantages of TLB. (2079)
91
Chapter 7: Linux Case Study
Explain Inter-Process Communication in Linux. [Repeated: 2081, 2078]
92 92 92 92 Discuss the concept of SJF and SRTN scheduling algorithms with a suitable example. [Repeated: 2078]
93 Write short notes on Linux Scheduling. (2080)
94 Write short notes on the Linux File System. (2076)