STUPIDSID
1 (a)
What is operating system? Explain different functions of O.S.
5 M
1 (b)
Explain role of process Control Block?
5 M
1 (c)
What is the difference between dead lock prevention and avoidance algorithms.
5 M
1 (d)
Explain critical section problem.
5 M
2 (a)
What are the different allocation methods with reference of File Systems?
10 M
2 (b)
Consider the following set of processes, with the length of CPU brust given in miliseconds.
The Processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw Gnatt charts for the following scheduling algorithms FCFS, SJF non-preemptive priority and RR (quantum=1) and also calculate turn around time, average waiting time.
| Process | Brust Time | Priority |
| P1 | 10 | 3 |
| P2 | 1 | 1 |
| P3 | 2 | 3 |
| P4 | 1 | 4 |
| P5 | 5 | 2 |
The Processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw Gnatt charts for the following scheduling algorithms FCFS, SJF non-preemptive priority and RR (quantum=1) and also calculate turn around time, average waiting time.
10 M
3 (a)
Explain Dining philosopher problem and solution to it.
10 M
3 (b)
What do you mean by process? Draw and explain process state diagram in Unix.
10 M
4 (a)
Consider the following snapshot of a system-
with reference to banker's algorithm
i) Find need matrix
ii) Is the system in a safe state?
iii) If a request from process P1 arrives for (0,4,2,0), can the request be granted immediately.
| Allocation | Max | Available | ||||||||||||
| A | B | C | D | A | B | C | D | A | B | C | D | |||
| P1 | 0 | 0 | 1 | 2 | 0 | 0 | 1 | 2 | 1 | 5 | 2 | 0 | ||
| P2 | 1 | 0 | 0 | 0 | 1 | 7 | 5 | 0 | ||||||
| P3 | 1 | 3 | 5 | 4 | 2 | 3 | 5 | 6 | ||||||
| P4 | 0 | 6 | 3 | 2 | 0 | 6 | 5 | 2 | ||||||
| P5 | 0 | 0 | 1 | 4 | 0 | 6 | 5 | 6 | ||||||
with reference to banker's algorithm
i) Find need matrix
ii) Is the system in a safe state?
iii) If a request from process P1 arrives for (0,4,2,0), can the request be granted immediately.
10 M
4 (b)
Discuss various techniques for structuring the page tables along with example.
10 M
5 (a)
Explain in details, file management in Linux.
10 M
5 (b)
Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently servicing a request at cylinder 143 and the previous request was at cylinder 125. The queue of pending requests, in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130.
Starting from the current head position, what is total distance (in Cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk scheduling algorithms
i) SCAN
ii) C-Look
Starting from the current head position, what is total distance (in Cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk scheduling algorithms
i) SCAN
ii) C-Look
10 M
Write note on the following:
6 (a)
System components in Windows Operating System.
10 M
6 (b)
Demand paging and various page replacement policies.
10 M
More question papers from Operating Systems