National Champion Test - GATE 2018 CS : Operating System for GATE & PSU CS Exams

Question 1

Consider n processes sharing the CPU in round robin fashion. Assuming that each process switch takes s seconds. What must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the CPU at least every t seconds?

Question 2

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?

Question 3

In the process management Round-robin method is essentially the pre-emptive version of _________

Question 4

Pre-emptive scheduling is the strategy of temporarily suspending a running process

Question 5

Which of the following statement is wrong?
I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.

Question 6

Resources are allocated to the process to non-sharable basis is

Question 7

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cylinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at a cylinder 24. A seek takes 6 msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?

Question 8

Match the following lists:
List – I
(a) Forward Reference Table
(b) Mnemonic Table
(c) Segment Register Table
(d) EQU
List – II
(i) Assembler directive
(ii) Uses array data structure
(iii) Contains machine OP code
(iv) Uses linked list data structure

Question 9

What is the size of the Unicode character in Windows Operating System?

Question 10

If a packet arrive with an M-bit value is ‘1’ and a fragmentation offset value ‘0’, then it is ______ fragment.

Question 11

Everything below the system call interface and above the physical hardware is known as ______.

Question 12

Let f be the fraction of a computation (in terms of time) that is parallelizable, P the number of processors in the system, and sp the speed up achievable in comparison with sequential execution – then the sp can be calculated using the relation:

Question 13

Which of the following is not valid with reference to Message Passing Interface (MPI)?

Question 14

Which of the following conditions does not hold good for a solution to a critical section problem?

Question 15

A semaphore count of negative n means (s = – n) that the queue contains ________ waiting processes.