Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV (NEW) EXAMINATION – SUMMER 2021
Subject Code:3140702 Date:03/09/2021
Subject Name:Operating System
Time:02:30 PM TO 05: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.

Q.1 (a) Define the essential properties of the following types of operating systems: 03
(1) Batch (2) Time-sharing (3) Real-time
(b) What are the advantages of multiprogramming? 04
(c) What is the thread? What are the difference between user-level threads and kernel- 07
supported threads? Under what circumstances is one type “better” than the other?

Q.2 (a) What is Process? Give the difference between a process and a program. 03
(b) What is Process State? Explain different states of a process with various queues 04
generated at each stage.
(c) Write a bounded-buffer monitor in which the buffers (portions) are embedded within 07
the monitor itself.
OR
(c) What is Semaphore? Give the implementation of Readers-Writers Problem using 07
Semaphore.
Q.3 (a) Define the difference between preemptive and nonpreemptive scheduling. 03
(b) What are the Allocation Methods of a Disk Space? 04
(c) What is deadlock? Explain deadlock prevention in detail. 07
OR
Q.3 (a) What are the disadvantages of FCFS scheduling algorithm as compared to shortest 03
job first (SJF) scheduling?
(b) Distinguish between CPU bounded, I/O bounded processes. 04
(c) What is deadlock? Explain deadlock Avoidance in detail. 07
Q.4 (a) What is Access control? 03
(b) What are Pages and Frames? What is the basic method of Segmentation? 04
(c) Briefly explain and compare, fixed and dynamic memory partitioning schemes. 07
OR
Q.4 (a) Explain difference between Security and Protection? 03
(b) Differentiate external fragmentation with internal fragmentation. 04
(c) Explain the best fit, first fit and worst fit algorithm. 07

Q.5 (a) Explain the concept of virtual machines. 03

(b) Compare virtual machine and non virtual machine. 04
(c) What is “inode”? Explain File and Directory Management of Unix Operating System. 07
OR
Q.5 (a) What is marshalling and unmarshalling? 03
(b) What are components of Linux systems? 04
(c) Explain Disk arm scheduling algorithm. 07
*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV (NEW) EXAMINATION – SUMMER 2022
Subject Code:3140702 Date:23-06-2022
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) List any four functions of operating system? 03
(b) Explain the essential properties of 04
i) Batch system ii) Time sharing
iii) Real time iv) Distribute
(c) Explain process states and process control block in details. 07

Q.2 (a) What are the various criteria for a good process scheduling algorithm? 03
(b) What is thread? Explain classical thread model. 04
(c) How semaphores can be used to deal with n-process critical section 07
problem? Explain.
OR
(c) What is monitor? Explain solution for producer-consumer problem using 07
monitor.

Q.3 (a) Define preemption and nonpreemption. 03

(b) Explain the terms related to IPC: 04
i) Race condition ii) Critical section iii) Mutual exclusion iv) Semaphores
(c) How does deadlock avoidance differ from deadlock prevention? Write about 07
deadlock avoidance algorithm in detail.
OR
Q.3 (a) Give the Difference between Thread and Process. 03
(b) Explain the Priority scheduling algorithm. 04
(c) How to characterize the structure of deadlock? Explain the two solutions of 07
recovery from deadlock.

Q.4 (a) List out the seven RAID levels. 03

(b) Write short note on: Relocation problem for multiprogramming with fixed 04
partitions.
(c) What is paging? Discuss basic paging technique in details. 07
OR
Q.4 (a) What is the difference between logical I/O and device I/O? 03
(b) Write the first, best fit memory allocation techniques. 04
(c) Define Virtual Memory. Explain the process of converting virtual addresses 07
to physical addresses with a neat diagram.

Q.5 (a) Explain access control list. 03

(b) Differentiate between Windows and Linux file system. 04
(c) Write about Least Recently Used page replacement algorithm all its variants 07
with an example.
1
 OR
Q.5 (a) Explain domain protection mechanism. 03
(b) Write a short note: Unix kernel. 04
(c) Describe in detail about variety of techniques used to improve the efficiency 07
and performance of secondary storage.
*************

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER– IV(NEW) EXAMINATION – SUMMER 2023
Subject Code:3140702 Date:07-07-2023
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) Explain any three main functions of an Operating System. 03
(b) Describe the features of a distributed operating system. 04
(c) What is a process? Explain about various fields of process control block. 07

Q.2 (a) Define multi-threading? Explain its benefits. 03

(b) Describe the differences among long-term scheduling. short-term, and medium- 04
term scheduling.
(c) Demonstrate FIFO and Round Robin CPU scheduling algorithms with suitable 07
example.
OR
(c) What is semaphore? Explain its implementation as wait and signal for 07
providing process synchronization?

Q.3 (a) What are the advantages of inter-process communication? How communication 03
takes place in a shared-memory environment?
(b) What are the conditions under which a deadlock situation may arise? 04
(c) Explain the readers and writers problem. 07
OR
Q.3 (a) What is race condition? 03
(b) What are the methods for handling deadlocks? 04
(c) Explain the dining-philosophers problem. 07

Q.4 (a) Explain the difference between logical and physical addresses. 03
(b) When do page faults occur? Describe the actions taken by the operating system 04
when a page fault occurs.
(c) Explain Banker's deadlock-avoidance algorithm with an illustration. 07
OR
Q.4 (a) Explain the following allocation algorithms: 03
1) First-fit 2) Best-fit 3) Worst-fit
(b) Explain the difference between internal and external fragmentation. 04
(c) Explain the different file access methods in detail. 07

Q.5 (a) Explain domain of protection. 03

(b) Write a short note on: system threats. 04
(c) Explain in detail Synchronization implementation in Linux. 07
OR
Q.5 (a) What are the main difference between capability lists and access lists? 03
(b) Write a short note on: program threats. 04
(c) What is virtualization? Explain the benefits of virtualization. 07
*************
1
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
*********

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV (NEW) EXAMINATION – WINTER 2021
Subject Code:3140702 Date:31/12/2021
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.

Q.1 (a) Define the followings: 03

(1) System bus
(2) Auxiliary memory
(b) What do you mean by cache memory? Explain the cache read operation. 04
(c) What is process? Explain the process creation and termination. 07

Q.2 (a) Define the term critical section. 03

(b) Difference between user level and kernel level thread. 04
(c) Consider following processes with length of CPU burst time in milliseconds 07
Process Burst time
P1 5
P2 10
P3 2
P4 1
All process arrived in order p1, p2, p3, p4 all time zero.
(1) Draw gantt charts illustrating execution of these processes for SJF and round
robin (quantum=1)
(2) Calculate waiting time for each process for each scheduling algorithm
(3) Calculate average waiting time for each scheduling algorithm
OR
(c) What are various criteria for a good process scheduling algorithm? Explain any 07
two preemptive scheduling algorithms in brief.
Q.3 (a) What is meant priority inversion? 03
(b) What is the criterion used to select the time quantum in case of round-robin 04
scheduling algorithm? Explain it with a suitable example.
(c) What is Semaphore? Give the implementation of Bounded Buffer Producer 07
Consumer Problem using Semaphore.
OR
Q.3 (a) What is Deadlock? List the conditions that lead to deadlock. 03
(b) List criterions used to evaluate the performance of CPU scheduling algorithms. 04
(c) What is advantage of using Monitor? Give the implementation of Bounded Buffer 07
Producer Consumer Problem using Monitor.
Q.4 (a) What is resource allocation graph? 03
(b) Explain paging technique. 04
(c) Explain the following allocation algorithms: 07
1
 (1) First-fit
(2) Best-fit
(3) Worst-fit
OR
Q.4 (a) When is a system in a safe state? 03
(b) Explain segmentation. 04
(c) What is fragmentation? Explain the difference between internal and external 07
fragmentation.
Q.5 (a) Explain RAID. How it is helpful to increase CPU performance? 03
(b) Explain the following Linux commands: 04
(1) mkdir
(2) touch
(3) cat
(4) rm
(c) What do you mean by security? Discuss in brief access control list. 07
OR
Q.5 (a) Explain i/o buffering. 03
(b) What is virtualization? Explain the benefits of virtualization. 04
(c) Why is segmented paging important (as compared to a paging system)? What are 07
the different pieces of the virtual address in a segmented paging?

*************

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV(NEW) EXAMINATION – WINTER 2022
Subject Code:3140702 Date:13-12-2022
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) Differentiate multiprocessing and multiprogramming operating system. 03
(b) Write the functions of operating system. 04
(c) What is process? Explain process control block with all parameters. 07

Q.2 (a) Differentiate user level and kernel level thread. 03

(b) What is scheduling? Explain the types of schedulers. 04
(c) List out various criteria for good process scheduling algorithms. 07
Illustrate non-preemptive priority scheduling algorithm.
OR
(c) Differentiate process and thread. Explain process state diagram. 07

Q.3 (a) Define following terms: 03

(i)Critical section (ii) Mutual exclusion (iii) Bounded waiting
(b) Define deadlock. Describe deadlock prevention in detail. 04
(c) Illustrate Readers and Writers IPC problem with solution. 07
OR
Q.3 (a) Explain Resource allocation graph. 03
(b) What is deadlock? List the conditions that lead to deadlock. 04
(c) Explain the Banker’s algorithm for deadlock avoidance with an 07
example.

Q.4 (a) Explain segmentation. 03

(b) What is external fragmentation? Explain the solution to external 04
fragmentation.
(c) Explain paging hardware with TLB. 07
OR
Q.4 (a) Explain address binding. 03
(b) Explain following allocation algorithm 1) First Fit 2) Best Fit. 04
(c) What is page fault? Explain steps to handle page fault with diagram. 07

Q.5 (a) Discuss the major goals of I/O software. 03

(b) What is virtualization? Explain the benefits of virtualization. 04

(c) Draw the block diagram for DMA. Write steps for DMA data transfer. 07
OR
Q.5 (a) Differentiate block and character devices. 03
(b) Explain following Unix command: grep, sort, chmod, mkdir. 04
(c) Write short note on RAID levels. 07

*************
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 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

*******