Scribd
Upload
17 views2 pages

OSW2023

Operating System GTU W2023

Uploaded by

Sarvaiya Digvijaysinh Rameshsinh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views2 pages

OSW2023

Operating System GTU W2023

Uploaded by

Sarvaiya Digvijaysinh Rameshsinh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

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 07
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)
OR
(c) Five batch jobs P1, P2, P3, P4 and P5 arrive at 0, 1, 2, 3 and 4 ms. They 07
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)

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. 07
Write pseudo code for the same.
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 07
suitable example.
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

1
Q.5 (a) Explain concept of thrashing. 03
(b) Given the following track requests in the disk 04
queue, compute for the Total Head Movement
(THM) of the read/write head and seek time needed for SSTF Disk
Scheduling approach:
86, 147, 91, 230, 94, 168, 270, 30
Consider that the read/write head is positioned at location 150. A seek
takes 3 ms per cylinder move. Consider a disk drive with 300 cylinders.
(c) Explain any three memory placement algorithms with suitable example. 07
OR
Q.5 (a) Compare and contrast paging with fragmentation. 03
(b) Given the following track requests in the disk 04
queue, compute for the Total Head Movement
(THM) of the read/write head and seek time needed for C-SCAN Disk
Scheduling approach:
95, 180, 34, 119, 11, 123, 62, 64
Consider that the read/write head is positioned at location 50. A seek
takes 5 ms per cylinder move. Consider a disk drive with 200 cylinders.
(c) Explain any three page replacement algorithms with suitable example. 07

*******

You might also like