Define OS. Explain the basic functions of OS.
[3 marks]List types of OS structure and Differentiate between Monolithic and Microkernel.
[4 marks]What is system call? Explain steps for system call execution with neat diagram.
[7 marks]What is PCB? Discuss its major fields.
[3 marks]Explain process states model along with transition by a labelled diagram.
[4 marks]What do you mean by scheduling? Discuss in brief types of scheduling and kind of schedulers too. Of data of a data warehouse.
[7 marks]Consider Five Processes P1 to P5 arrived at same time. They have estimated running time 10,2,6,8 and 4 seconds, respectively. Their Priorities are 3,2,5,4 and 1, respectively with 5 being highest Priority. Find the average turnaround time and average waiting time for Round Robin (q=3) and Priority Scheduling algorithm.
[7 marks]Give the functions of following UNIX commands: ps, fork, join
[3 marks]What is deadlock? List the necessary conditions that lead to the deadlock. How deadlock can be prevented?
[4 marks]What is Semaphore? Give the implementation of Bounded Buffer (Producer Consumer) Problem using Semaphore.
[7 marks]Explain Race condition, mutual exclusion and critical region.
[3 marks]Explain the use of Banker’s Algorithm for deadlock avoidance.
[4 marks]What is Critical section Problem and list the requirements to solve it. Write Peterson’s Solution for the same.
[7 marks]Give difference between Internal and External Fragmentation.
[3 marks]Discuss DMA in brief.
[4 marks]What is Paging? Explain paging mechanism in MMU with example
[7 marks]Give difference between Paging and Segmentation
[3 marks]What is Buffering? Why is it required in I/Ohandling?
[4 marks]Consider the page references 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, with 4 page frame. Find number of page fault using Optimal Page replacement and Least Recently Used algorithm
[7 marks]Explain Device controller in brief
[3 marks]How virtual address is converted into physical address with example1
[4 marks]Define seek time and rotational latency. Assume that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently serving a request at cylinder 100. The queue of pending requests is 23, 89, 132, 42, 189. Calculate seek time for FCFS and SSTF disk scheduling algorithm.
[7 marks]What is RAID? Explain in brief.
[3 marks]Explain memory management with bitmaps.
[4 marks]Explain virtual machine and virtualization concepts in brief.
[7 marks]