0% found this document useful (0 votes)
79 views2 pages

OS W2020 3140702 APY Material

This document contains instructions for an Operating System exam with 8 questions. Students are instructed to attempt any 4 questions out of the 8. Each question is divided into multiple parts with varying point values. The questions cover topics like OS structure, process scheduling algorithms, distributed OS features, concurrency, deadlocks, demand paging, access control lists, process control blocks, thread scheduling, mutual exclusion, producer-consumer problem, virtual machines, memory allocation strategies, and RAID levels. Sample problems are provided for some questions to solve.

Uploaded by

Prince Patel
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
0% found this document useful (0 votes)
79 views2 pages

OS W2020 3140702 APY Material

This document contains instructions for an Operating System exam with 8 questions. Students are instructed to attempt any 4 questions out of the 8. Each question is divided into multiple parts with varying point values. The questions cover topics like OS structure, process scheduling algorithms, distributed OS features, concurrency, deadlocks, demand paging, access control lists, process control blocks, thread scheduling, mutual exclusion, producer-consumer problem, virtual machines, memory allocation strategies, and RAID levels. Sample problems are provided for some questions to solve.

Uploaded by

Prince Patel
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 2020
Subject Code:3140702 Date:09/02/2021
Subject Name:Operating System
Time:02:30 PM TO 04:30 PM Total Marks:56
Instructions:
1. Attempt any FOUR questions out of EIGHT questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Marks
Q.1 (a) Explain structure of Operating System. 03
(b) Draw and explain five state Process State Transition Diagram. 04
(c) Solve following example by FCFS and SJF CPU scheduling 07
algorithm. Draw Gantt Chart and calculate Average Waiting Time
and Average Turnaround time.
Process Arrival Time Burst Time
P0 0 10
P1 1 6
P2 3 2
P3 5 4

Q.2 (a) State features of distributed operating system. 03


(b) Explain principle of concurrency in brief. 04
(c) Explain Dining philosopher problem and its solution using 07
semaphore.

Q.3 (a) Explain pure virtualization in brief. 03


(b) What is deadlock? List the conditions that lead to deadlock. 04
(c) State the need of demand paging. Explain the steps to handle a page 07
fault using demand paging.

Q.4 (a) Explain Access Control List in brief. 03


(b) Write a Shell script to find Factorial of a given number. 04
(c) Disk requests come in to the disk driver for cylinders 10, 22, 20, 2, 07
40, 6, and 38, in that order. A seek takes 6 msec per cylinder moved.
How much seek time is needed for
(a) First-come, first served.
(b) Closest cylinder next.
In all cases, the arm is initially at cylinder 20.

Q.5 (a) Explain different services provided by operating system. 03


(b) Explain process control block with diagram. 04
(c) Explain Thread Scheduling with suitable example. 07

Q.6 (a) Give the difference between multitasking OS and multiprogramming 03


OS.
(b) Explain Mutual Exclusion in brief. 04

1
(c) Explain producer-consumer problem and solve it using semaphore. 07
Write pseudo code for the same.

Q.7 (a) Explain need of Virtual Machines. 03


(b) How Resource Trajectories can be helpful in avoiding the deadlock? 04
(c) Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 07
600 KB (in order), how would each of the first-fit, best-fit and worst-
fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426
KB (in that order) ? Which algorithm makes the most efficient use of
memory?

Q.8 (a) Write a note on Generic Security Attacks. 03


(b) Explain Unix Commands – grep, sort, cat, chmod. 04
(c) Explain RAID level system in detail. 07
*********

You might also like