1 (a)
What are the two goals of an operating system (OS)? Explain briefly.
4 M
1 (b)
Describe the batch processing system and functions of scheduling and memory management for the same.
8 M
1 (c)
Why I/O bound programs should be given higher priorities in a multiprogramming environment? Illustrate with timing diagram.
8 M
2 (a)
Explain system generation operations.
4 M
2 (b)
Compare Kernel based and micro kernel based OS function.
8 M
2 (c)
Explain layered OS structure. How is it superior compared to monolithic structure?
8 M
3 (a)
Mention the three kinds of entities used for concurrency within a process in threads in solaris, along with a diagram.
4 M
3 (b)
With a state transition diagram and PCB structure, explain the function of the states. State transitions and the functions of a schedule.
8 M
3 (c)
Explain the race condition in airlines reservation system with an algorithm.
8 M
4 (a)
Compare static and dynamic memory allocation. What are the four program components for which the memory is to be allocated?
4 M
4 (b)
Describe i) Best fit technique for free space allocation and ii) Variable partitioned allocation with their merits and demerits.
8 M
4 (c)
Describe buddy system allocator for program controlled data. How does it differ from process-of-two allocator?
8 M
5 (a)
Explain "page out daemon" for handling virtual memory in UNIX OS.
4 M
5 (b)
Describe the address translation using ATU and TLB in demand paged allocation with a block diagram.
8 M
5 (c)
Determine the number of page faults in FIFO and LRU policies for the following page reference string, Pages: 5,4,3,2,1,4,3,5,4,3,2,1. Assume that there are 3 page frames and all are initially empty and the first page loaded causes a page fault. Also compare these two techniques.
8 M
6 (a)
Compare sequential and direct file organization.
4 M
6 (b)
Describe the interface between file system and IOCS.
8 M
6 (c)
Explain the file system actions when a file is opened and a file is closed.
8 M
7 (a)
What are the functions of medium and short term schedulers?
4 M
7 (b)
Determine mean turn around time for SJN and RR scheduling, assuming a time slice of 1 second for the following table:
Process |
Arrival time in seconds |
Execution time in second |
Deadline in seconds |
P1 P2 P3 P4 P5 |
0 2 3 5 8 |
3 3 2 5 3 |
4 14 6 11 12 |
8 M
7 (c)
Describe the various blocks in a long term scheduling with JCB structure.
8 M
8 (a)
Explain the primitives used for the transmission and reception of message in an OS.
4 M
8 (b)
Describe message delivery protocols and the exceptional conditions during message delivery with an example.
8 M
8 (c)
Explain the interprocess communication mechanisms in UNIX OS.
8 M
More question papers from Operating Systems