STUPIDSID
1 (a)
What is a distributed operating system? What are the advantages of the distributed operating system?
6 M
1 (b)
What are system calls? With examples explain different categories of system calls.
7 M
1 (c)
With a neat diagram, explain the concept of virtual machine.
7 M
2 (a)
Explain the process state transition diagram.
6 M
2 (b)
Explain multithreading models.
9 M
2 (c)
For the processes listed below, draw Gantt charts using preemptive and non preemptive priority scheduling algorithm. A larger priority number has a higher priority.
| Jobs | Arrival time | Burst time | Priority |
| J1 | 0 | 6 | 4 |
| J2 | 3 | 5 | 2 |
| J3 | 3 | 3 | 6 |
| J4 | 5 | 5 | 3 |
5 M
3 (a)
What is busy waiting in a critical section concept? How semaphore is used to solve critical section problem? What are the advantages of semaphore?
10 M
3 (b)
What is a monitor? Explain the solutions to the classical philosopher's problem. Using monitor.
10 M
4 (a)
What is a resource allocation graph (RAG)? Explain how RAG is very useful in describing deadly embrace by considering your own example.
8 M
4 (b)
System consists of five jobs (J1, J2, J3, J4, J5) and three resources (R1, R2, R3). Resource type R1 has 10 instances, resources type R2 has 5 instances and R3 has 7 instances. THe following snapshot of the system has been taken:
Find need matrix and calculate the safe sequence by using Banker's algorithm. Mention the above system is safe or not safe.
| Jobs | Allocation | Maximum | Available | ||||||
| R1 | R2 | R3 | R1 | R2 | R3 | R1 | R2 | R3 | |
| J1 | 0 | 1 | 0 | 7 | 5 | 3 | 3 | 3 | 2 |
| J2 | 2 | 0 | 0 | 3 | 2 | 2 | |||
| J3 | 3 | 0 | 1 | 9 | 0 | 2 | |||
| J4 | 2 | 1 | 1 | 2 | 2 | 2 | |||
| J5 | 0 | 0 | 2 | 4 | 3 | 3 | |||
Find need matrix and calculate the safe sequence by using Banker's algorithm. Mention the above system is safe or not safe.
8 M
4 (c)
Briefly explain the methods for handling deadlocks.
4 M
5 (a)
Distinguish between:
(i) Logical versus physical address space
(ii) Paging versus segmentation
(iii) First fit and best fit algorithm
(i) Logical versus physical address space
(ii) Paging versus segmentation
(iii) First fit and best fit algorithm
7 M
5 (b)
Mention the problem with simple paging scheme. How TLB is used to solve this problem? Explain with supporting hardware diagram and with an example.
8 M
5 (c)
On a system using simple segmentation, compute the physical address for each the logical address, logical address is given in the following segment table. If the address generates a segment fault, indicate it as "segment fault".
(i)0,9,9 (ii) 2, 78 (iii) 1, 265 (iv) 3, 222 (v) 0, 11
| Segment | Base | Length |
| 0 | 330 | 124 |
| 1 | 876 | 211 |
| 2 | 111 | 99 |
| 3 | 498 | 302 |
(i)0,9,9 (ii) 2, 78 (iii) 1, 265 (iv) 3, 222 (v) 0, 11
5 M
6 (a)
Explain the briefly different file types.
4 M
6 (b)
Explain the different types of directory structures, with examples and mention their advantages and disadvantages
8 M
6 (c)
With supporting diagrams, explain linked and indexed methods of allocating disk space.
8 M
7 (a)
Explain the following disk scheduling algorithm in brief
(i) SSTF
(ii) SCAN
(iii) LOOK
(i) SSTF
(ii) SCAN
(iii) LOOK
9 M
7 (b)
Explain in brief, the selection of a disk scheduling algorithm.
4 M
7 (c)
What is protection? Distinguish between mechanisms and policies. Explain briefly the access matrix with domains as objects.
7 M
Write short notes on (any four):-
8 (a)
Linux history
5 M
8 (b)
Linux design principles
5 M
8 (c)
Components of a Linux system
5 M
8 (d)
Optimal page replacement algorithm
5 M
8 (e)
Steps in handling a page fault.
5 M
More question papers from Operating Systems