1
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA Integrated SEMESTER- IV-EXAMINATION WINTER 2018
Subject Code: 4440603 Date: 04-12-2018
Subject Name: Operating Systems
Time: 02.30 pm to 5.00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks
Q.1

Answer following in short.
Discuss the possible reasons for process migration.
Define F-SCAN policy.
What is the relation between FIFO and clock page replacement algorithm?
List characteristics of Real time Operating system.
What delay elements are involved in a disk read or write?
What is access time?
Define Race Condition.
07

Do as Directed
1. is a technique for overcoming external fragmentation. (Fill in the Blank)
2. is known as the management of multiple processes within a uni-processor system. (Fill in the Blank)
3. A is a state in which there is at least one sequence of resource allocation to processes that does not result in a deadlock. (Fill in the Blank)
4.
When a program tries to access a page that is mapped in address space but not loaded in physical memory, then
segmentation fault occurs
fatal error occurs
page fault occurs
no error occurs
5.
Which of the following condition is required for deadlock to be possible?
mutual exclusion
a process may hold allocated resources while awaiting assignment of other resources
no resource can be forcibly removed from a process holding it
all of the mentioned
6.
First-in-first-out scheduling is
Non pre-emptive scheduling
Pre-emptive scheduling
Fair share scheduling
Deadline scheduling
7.
Which one of the following is not a function of Operating System
Resource management
File management
Networking
Process management
07
2
Q.2

Draw neat seven state Process State Transition diagram. Explain in detail.
07

Describe the necessary condition for deadlock occurrence. Discuss the deadlock avoidance using Banker's algorithm.
07
OR

What is semaphore? Give and explain the algorithm of producer/consumer
Problem with bounded using general semaphore.
07
Q.3

What is mutual exclusion? Define Semaphore, the permissible operations with Semaphore and how they are used to achieve the mutual exclusion.
07

What is segmentation? How it differs with paging? Explain address translation in segmentation with paging.
07
OR
Q.3

Define Reader/Writer Problem. What are the conditions generally associated with this problem? How can this problem be solved using Semaphores?
07

Differentiate between Reusable and consumable resources.
Discuss Gang Scheduling and Load Sharing with its advantages and
Disadvantages.
03
04
Q.4

Briefly explain the different RAID levels. Support your illustrations with neat sketches.
07

Explain thrashing. What is the purpose of Translation Look aside Buffer? Explain in brief.
07
OR
Q.4

Explain briefly the three techniques for performing I/O.
What are typical operations that may be performed on a directory?
07

What do you mean by Page replacement policy? Solve following example using Optimal, LRU, FIFO and Clock polices.
Consider a program with five pages and main memory with three page frames. Given below is the page address stream formed by executing the program
2 3 2 1 5 2 4 5 3 2 5 2
07
Q.5

Briefly Define FCFS and Round-Robin processor scheduling.
07

List and Briefly define four techniques for thread scheduling.
07
OR
Q.5

Explain different classes of Client Server architecture. What do you mean by three tier Client Server architecture?
07

Write a short note on Distributed Message Passing.
07