STUPIDSID
1 (a)
Discuss the common tasks performed by the operating systems (OS).
5 M
1 (b)
Explain the resources pre-emption resource allocation strategies of an OS.
7 M
1 (c)
What is distributed system? Discuss the key concepts, techniques and benefits of distributed OS.
8 M
2 (a)
Explain the functions of an OS.
4 M
2 (b)
Explain the kernel based operating system with a structure of time sharing system.
8 M
2 (c)
Explain the following i) System generation ii)Configuration tools iii) Dynamic configuration of supervisor.
8 M
3 (a)
Discuss the primary concerns/ reasons for process termination.
5 M
3 (b)
List the events occur during the operation of OS. With a diagram discuss the event handling actions of kernel.
8 M
3 (c)
With a diagram, explain the relationship between threads and process. Discuss the advantages of threads.
7 M
4 (a)
Explain the lazy buddy allocator and slab allocator.
8 M
4 (b)
With a diagram explain the merging of free memory areas using boundary tag.
8 M
4 (c)
Compare between contiguous and non-contiguous memory allocation.
4 M
5 (a)
With a diagram explain the following
i) Partial page replacement policy
ii) Page replacement policy using clock algorithms.
i) Partial page replacement policy
ii) Page replacement policy using clock algorithms.
9 M
5 (b)
Explain with a diagram, the copy on write for shared pages.
4 M
5 (c)
With a diagram, explain the virtual memory manager's actions in demand loading of a page.
7 M
6 (a)
Explain the following write a diagram:
i) Linked allocation
ii) File allocation table.
iii) Indexed allocation.
i) Linked allocation
ii) File allocation table.
iii) Indexed allocation.
10 M
6 (b)
Explain the operations performed on files.
5 M
6 (c)
Discuss with a diagram the directory trees of a file system.
5 M
7 (a)
With a neat diagram, explain the event handling and scheduling.
8 M
7 (b)
Determine the mean turn around time and mean weighted turn around for LCN and STG scheduling for the following table:
| Processes | Arrival time(sec) | Execution time (sec) | Dead line time (sec) |
| P1 | 0 | 03 | 04 |
| P2 | 2 | 03 | 14 |
| P3 | 3 | 02 | 06 |
| P4 | 5 | 05 | 11 |
| P5 | 8 | 03 | 12 |
8 M
7 (c)
Discuss the two fundamental techniques of scheduling.
4 M
Explain the following
8 (a) i)
Inter process message control block.
4 M
8 (a) ii)
Exceptional conditions on message passing.
3 M
8 (b)
Explain the message queues and sockets for inter process communication in unix.
8 M
8 (c)
Explain a mail box with its features and advantages.
5 M
More question papers from Operating Systems