1
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA SEMESTER- III EXAMINATION WINTER 2018
Subject Code: 2630004 Date: 07-01-2019
Subject Name: Operating Systems
Time: 10.30 am to 1.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

Fill in the following blanks:
i. interrupt is generated at the end of a time slice.
ii. is a faster memory lies between CPU and Main memory.
iii. Principal objective provided by Batch Multiprogramming is .
iv. A resource is one that can be created and destroyed.
v. Thread is also known as
vi. A is a situation in which a runnable process is overlooked indefinitely by the scheduler; although it is able to proceed, it is never chosen.
vii. placement algorithm begins to scan memory from the location of last placement and chooses the next available block that is large enough.
01
01
01
01
01
01
01

State whether the following statements are TRUE FALSE
i. An inverted page table structure is an alternative approach to the use of one or multiple-level page tables.
ii. Short term scheduler is invoked when I/O interrupt occurs in the system.
iii. Gang scheduling is a set of related threads scheduled to run on a set of processors at the same time, on a one-to-one basis.
iv. RAID level 1 requires N 1 data disks.
v. Logical I/O module of File System Software Architecture deals with file records.
vi. In sequential file organization key field is the first field in the record and is used to uniquely identify the record.
vii. API is a set of functions and call programs that allows clients and servers to intercommunicate.
01
01
01
01
01
01
01
Q.2

Do as directed
i. What is kernel?
ii. State memory management requirements.
iii. What is thrashing?
iv. List five categories of parallelism that differ in the degree of granularity.
v. What is FAT?
vi. Draw the timing diagram of a disk I/O transfer.
01
01
01
01
01
02

i. Explain Distributed Message Passing.
ii. What do you mean by 'Appending' access right?
06
01
OR
2

i. Explain RPC.
ii. What do you mean by 'Changing protection' access right?
06
01
Q.3

Explain Seven-state process model.
07

Explain Buddy System.
07
OR
Q.3

Explain types of Threads.
07

Explain Cleaning policy and Load Control policy of OS for Virtual Memory.
07
Q.4

Explain Binary Semaphore.
07

Explain SSTF and SCAN disk scheduling policies with suitable example.
07
OR
Q.4

Discuss Bounded-Buffer Producer Consumer problem and its appropriate solution.
07

Explain file organization.
07
Q.5

Explain working of Banker's algorithm.
07

Explain Round-Robin policy. Why Virtual Round-Robin policy is needed?
07
OR
Q.5

Explain Deadlock detection algorithm with suitable example.
07

Explain Thread scheduling.
07