What is an Operating System? explain any one type of operating system.
[3 marks]Difference between process and thread.
[4 marks]Explain the Thread Life Cycle with a diagram.
[7 marks]Define the following term. 1) Critical Section 2) Waiting Time 3) Race condition
[3 marks]Write short note: 1) Semaphores 2) Monitors
[4 marks]Explain Swapping and Fragmentation in detail.
[7 marks]What are the necessary conditions for a Deadlock? Explain Deadlock recovery in brief.
[7 marks]If the machine is a 32-bit machine with a page size of 4 KB, then find out the page number and page offset.
[3 marks]Explain the IPC Problem known as the Dining Philosopher Problem.
[4 marks]Define the terms Scheduler, Scheduling, and Scheduling Algorithm with examples.
[7 marks]What is Mutual exclusion? Explain Peterson’s solution for the mutual exclusion problem.
[3 marks]Explain Context Switching. Discuss performance evaluation of FCFS (First Come First Serve) & RR (Round Robin) scheduling.
[4 marks]Define the following terms. 1. Throughput 2. Waiting Time 3. Turnaround Time 4. Response Time 5. Granularity 6. Short Term Scheduler 7. CPU Utilization
[7 marks]Differentiate between preemptive and non-preemptive scheduling.
[3 marks]Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst-fit
[4 marks]What is Paging? Explain the paging mechanism in MMU with an example.
[7 marks]Briefly describe SCAN.
[3 marks]Write a short note: RAID levels.
[4 marks]Consider the following reference string. Calculate the page fault rates for below page replacement algorithm. Assume the memory size is 4 page frame. 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2 1. FIFO 2. OPTIMAL1
[7 marks]What is called TLB? How does it help to speed up paging?
[3 marks]Explain the Linux kernel and its functions in brief.
[4 marks]Explain the following commands in UNIX: grep, chmod, man, finger, ls, cat, ps
[7 marks]What is I-node? Explain in detail.
[3 marks]List the different file implementation methods and explain them in detail.
[4 marks]Suppose the Disk drive has 300 cylinders. The current position of head is 90. The queue of pending request is 36,79,15,120,199,270,89,170 Calculate head movement for the following algorithms. 1. FCFS 2. SSTF -------2
[7 marks]