1 (a)
Explain the goal of an operating system.
6 M
1 (b)
Explain the designer's view of operating system.
4 M
1 (c)
Explain modes of performing I/O operations.
5 M
1 (d)
Explain the benefits / features of distributed operating system.
5 M
2 (a)
Explain the functions of an operating system.
5 M
2 (b)
Explain the layered design of operating system.
8 M
2 (c)
Explain the concept of VMOS with example.
7 M
3 (a)
Explain the contents of process control block.
6 M
3 (b)
List the different types of process interaction and explain them in brief.
6 M
3 (c)
Explain with a neat diagram, the different states of process in UNIX operating system.
8 M
4 (a)
Describe static and dynamic memory allocation.
4 M
4 (b)
Compare the contiguous and non-contiguous memory allocation.
4 M
4 (c)
What is boundary tag? Explain merging of free areas using boundary tags?
8 M
4 (d)
Explain the lazy buddy allocator.
4 M
5 (a)
Explain the important concepts in the operation of demand paging.
12 M
5 (b)
Find the number of page faults for following page reference string, using the FIFO and LRU page replacement policies.
Reference string: 5,4,3,2,1,4,3,5,4,3,2,1,5. (Assume page frames=3).
Reference string: 5,4,3,2,1,4,3,5,4,3,2,1,5. (Assume page frames=3).
8 M
6 (a)
Describe the different operations performed of files.
8 M
6 (b)
Explain the organization of sequential access and direct access files.
8 M
6 (c)
Describe file system actions during a file operation.
4 M
7 (a)
Compute mean turn around time and mean weighted turn around time for following set of process, using FCFS and SRN scheduling.
Processes | P1 | P2 | P3 | P4 | P5 |
Arrival time | 0 | 2 | 3 | 5 | 8 |
Service time | 3 | 3 | 2 | 5 | 3 |
10 M
7 (b)
Explain the process schedule with a neat schematic diagram.
5 M
7 (c)
Summarize the approaches to real time scheduling.
5 M
8 (a)
Explain Buffering of interprocess message.
6 M
8 (b)
Describe the delivery of interprocess messages.
6 M
8 (c)
Write a short note on mailbox.
8 M
More question papers from Operating Systems