STUPIDSID
1 (a)
List and explain services provided by an operating system that are design to make using computer system more convenient for users.
8 M
1 (b)
Is seperation of mechanism and policy desirable while designing an operating system? Discuss with an example.
4 M
1 (c)
With a neat diagram of VM-WARE architecture, explain the concept of Virtual Machine (V M) and the main advantages of using VM architecture.
8 M
2 (a)
What is a Process Control Block (PCB)? What are the different states in which a process can be in its life cycle, discuss with the help of state transition diagram.
5 M
2 (b)
Is CPU scheduling necessary? Discuss the five different scheduling criteria used in comparing scheduling mechanisms.
6 M
2 (c)
Consider the following ser of processes, with length of the CPU burst time given in milliseconds:
(i) Draw four Gantt charts illusterating the execution of these processing using FCFS, SJF, a non preemptive priority and RR (Quantum=2) scheduling.
(ii) What is the turn around time of each processes for each shceduling algorithm in (i)
(iii) What is the waiting time of each process for each of the shceduling algorithm in (i)
| Process | Arrival time | Burst-time | Priority |
| P1 | 0 | 10 | 3 |
| P2 | 0 | 1 | 1 |
| P3 | 3 | 2 | 3 |
| P4 | 5 | 1 | 4 |
| P5 | 10 | 5 | 2 |
(i) Draw four Gantt charts illusterating the execution of these processing using FCFS, SJF, a non preemptive priority and RR (Quantum=2) scheduling.
(ii) What is the turn around time of each processes for each shceduling algorithm in (i)
(iii) What is the waiting time of each process for each of the shceduling algorithm in (i)
9 M
3 (a)
Describe an N-process solution to critical section problem which uses test and test() atomic instruction. Also explain how the algorithm satisfies all the requirements of critical section.
8 M
3 (b)
Serves can be designed to limit the number of open connections. For example, a sever may wish to have only N socket connections at any point in time. As soon as N connections are made, the server will not accept another incoming connection until an existing connections is released. Explain how semaphore can be used by a server to limit the number of concurrent connections.
4 M
3 (c)
Explain the range of monitors with a schematic view of its structure; write a monitor solution to bounded-buffer problem.
8 M
4 (a)
What is a dead lock? Consider the trafic deadlock depicted in the figure given below, explain that the four necessary conditions for dead lock indeep hold in this examples.
5 M
4 (b)
Consider the following snapshot of a system:
Answer the following questions using Banker's algorithm:
Is the system in a "safe state"?
If a request from process P2 arrives for (002) can the request be granted immediately?
| Allocation | Max | Available | |
| ABC | ABC | ABC | |
| P0 | 002 | 004 | 102 |
| P1 | 100 | 201 | |
| P2 | 135 | 137 | |
| P3 | 632 | 842 | |
| P4 | 143 | 157 |
Answer the following questions using Banker's algorithm:
Is the system in a "safe state"?
If a request from process P2 arrives for (002) can the request be granted immediately?
10 M
4 (c)
What are the methods used to handle the dead locks? Explain how circular wait condition can be prevented from occuring.
5 M
5 (a)
What are the drawbacks of contiguous memory allocation? Give five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order), how would each of the first fit. Best fit and worst fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in order)? which algorithm makes the most efficient use of memory?
6 M
5 (b)
Consider a paging system with the page table stored in memory.
(i) If a memory reference takes 200 nano seconds, how long does a paged memory reference take?
(ii) If we add associative register and 75 percentage of all page table reference are found in the associative registers, what is the effective memory access time? (Assume that finding a page table entry in the associative memory/ register takes zero time. if the entry is found).
(i) If a memory reference takes 200 nano seconds, how long does a paged memory reference take?
(ii) If we add associative register and 75 percentage of all page table reference are found in the associative registers, what is the effective memory access time? (Assume that finding a page table entry in the associative memory/ register takes zero time. if the entry is found).
4 M
5 (c)
Consider the following page reference string: 70 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 for a memory with three frames. How many page faults would occur for LRU. FIFO and optimal page replacement algorithms? Which is the most efficient among them?
10 M
6 (a)
Explain the various file operations supported by the operating system, also differentiate mandatory lock and advisory lock mechanisms used on files by the operating system.
5 M
6 (b)
Describe the methods used for implementing the directories.
8 M
6 (c)
Explain various file protection mechanisms.
7 M
7 (a)
Suppose that the risk drive has 5000 cylinders numbered from 0 to 4999. The drive is currently serving 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 (location) head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk-scheduling algorithms?
(i) FCFS; (ii) SSTF; (iii) SCAN; (iv) LOCK; (v) C-SCAN
(i) FCFS; (ii) SSTF; (iii) SCAN; (iv) LOCK; (v) C-SCAN
15 M
7 (b)
Discuss the strength and weakness of implementing an access matrix using access lists that are associated with objects.
5 M
Write short notes on:
8 (a)
Portability issues in LINUX
5 M
8 (b)
Performance of demand paging
5 M
8 (c)
Multithreading models
5 M
8 (d)
Network structure in LINUX
5 M
More question papers from Operating Systems