Title 3140702 - OS 2023W.pdf ✅

1 Seat No.: ________ Enrolment No.___________ GUJARAT TECHNOLOGICAL UNIVERSITY BE - SEMESTER–IV (NEW) EXAMINATION – WINTER 2023 Subject Code:3140702 Date:11-01-2024 Subject Name: Operating System Time:10:30 AM TO 01:00 PM Total Marks:70 Instructions: 1. Attempt all questions. 2. Make suitable assumptions wherever necessary. 3. Figures to the right indicate full marks. 4. Simple and non-programmable scientific calculators are allowed. Marks Q.1 (a) Define true virtualization with example. 03 (b) Write a shell script to find factorial of an user-defined natural number. 04 (c) Draw and explain seven state process state transition diagram in detail. 07 Q.2 (a) Explain the main function of a dispatcher in brief. 03 (b) List and briefly define four classes of real-time scheduling algorithms. 04 (c) Five batch jobs A, B, C, D and E arrive at same time. They have estimated running times 10, 6, 3, 4 and 8 ms. For each of the following algorithm determine mean process turnaround time. Consider process swapping overhead is 1 ms. 1) FCFS 2) Round-Robin (Time quantum = 2 ms) 07 OR (c) Five batch jobs P1, P2, P3, P4 and P5 arrive at 0, 1, 2, 3 and 4 ms. They have estimated running times 14, 12, 8, 3 and 6 ms. Their priorities are 3, 5, 2, 1 and 4 respectively with 5 being highest priority. For each of the following algorithm determine mean process turnaround time. Consider process swapping overhead is 0.5 ms. 1) SJF (Non-preemptive) 2) Priority Scheduling (Preemptive) 07 Q.3 (a) Give the difference between weak semaphore and strong semaphore. 03 (b) Briefly explain critical section. 04 (c) Explain producer-consumer problem and solve it using semaphore. Write pseudo code for the same. 07 OR Q.3 (a) Give the key difference between a mutex and a binary semaphore. 03 (b) List the requirements for mutual exclusion. 04 (c) Explain Dining philosopher problem and its solution using semaphore. 07 Q.4 (a) Explain I/O buffering in brief. 03 (b) Write a short note on Access Control List. 04 (c) Write and explain Banker’s Algorithm for deadlock avoidance with suitable example. 07 OR Q.4 (a) Compare RAID level 3 with RAID level 4. 03 (b) Write a short note on design principles of OS security. 04 (c) Write and explain deadlock detection algorithm with suitable example. 07