Explain the following: (7) 1. Data Integrity 2. Dispatcher 3. Granularity 4. Critical Section 5. Race Condition 6. No Preemption 7. Turnaround time
[ marks]What is Operating system? Explain in brief objectives and functions of OS. (7)
[ marks]i) Define Multithreading with example. (3) ii) Write four differences between process and thread. (4)
[ marks]What is process? Explain the process state transition diagram with suspend state. (7)
[ marks]What is multithreading? Explain in brief KLT and ULT with its advantages and (7) disadvantages.
[ marks]State Producer/Consumer problem. How it is different from Readers/Writer problem. (7)
[ marks]i) Discuss 4 necessary conditions for deadlock. (2) ii) Explain in brief Deadlock avoidance with its advantages and disadvantages (5)
[ marks]What is semaphore? Give and explain the algorithm of producer/consumer problem (7) with bounded using general semaphore.
[ marks]i) Give examples of reusable and consumable resources. (3) ii) List two ways in which the No-preemption condition can be prevented. (4) Q,4 (a) What is segmentation? How it differs with paging? Explain address translation in (7) segmentation with paging.
[ marks]Describe FCFS, RR, SPN, SRT, HRRN, Feedback and Fair-share scheduling methods (7) briefly.
[ marks]Q,4 (a) Define virtual memory. Compare LRU, FIFO and Clock page replacement policies with (7) suitable example.
[ marks]Write short note: (7)
[ marks]Gang Scheduling ii) SCAN and FIFO Disk Scheduling algorithm
[ marks]How do you classify the different approaches for Real-time scheduling? State various (7) Real-time scheduling techniques available and discuss any one in detail.
[ marks]Name the File allocation methods available in File Management. Explain in detail all (7) methods.
[ marks]Explain RAID and its level 0-6 in detail. (7)
[ marks]Define client server computing and explain the classes of client server applications and (7) compare it with three tire architecture.
[ marks]