With a neat diagram, explain the layered structures of UNIX operating system.
What are the advantages and disadvantages of using the same system call interface for manipulating both file and device?
What are the advantages of inter process communication? How communication takes place in a shared memory environments Explain.
Assume the following work load in a system: Process | Arrival Time | Burst Time P1 | 5 | 5 P2 | 4 | 6 P3 | 3 | 7 P4 | 1 | 9 P5 | 2 | 2 P6 | 6 | 3 Draw a Gantt chart illustrating the execution of these jobs using Round-Robin algorithm and also calculate average waiting time and average turnaround time.
What is a Process? Explain about various fields of Process Control Block.
What is dining philosophers problem? Discuss the solution to dining philosophers problem using monitors.
Explain the concepts of demand paging in detail with neat diagram.
Given memory partition of 100 kb, 500 kb, 200 kb and 600 kb (in order). Show with neat sketch how would each of the first fit, best fit and worst fit algorithms place processes of 412 kb, 317 kb and 326 kb (in order).
What is a Virtual Memory? Discuss the benefits of virtual memory techniques.
Explain Resource Allocation Graph algorithm for deadlock avoidance.
Write in detail about file attributes, operations, and types and structures.
Explain in detail about various ways of accessing disk storage.
Explain and compare the FCFS and SSTF disk scheduling algorithm.
Explain the Indexed allocation of disk space with examples.
Discuss the following:
i) I/O buffering
ii) Kernel I/O subsystem
iii) Concurrent I/O
iv) Interrupt Driven
