CS and IT GATE 2016 Set-2 Questions with Answer

Ques 53 Mathematics

---

The value of the expression 13⁹⁹(mod 17), in the range 0 to 16, is

A

4

B

13

C

8

D

16

See Answer Video Solution

Ques 54 Mathematics

---

Consider the systems, each consisting of m linear equations in n variables.

I. If m < n, then all such systems have a solution
II. If m > n, then none of these systems has a solution
III. If m = n, then there exists a system which has a solution

Which one of the following is CORRECT?

A

I, II and III are true

B

Only II and III are true

C

Only III is true

D

None of them is true

See Answer Video Solution

Ques 55 Operating System

---

Consider a non-negative counting semaphore S. The operation P(S) decrements S, and V(S) increments S. During an execution, 20 P(S) operations and 12 V(S) operations are issued in some order. The largest initial value of S for which at least one P(S) operation will remain blocked is ________.

See Answer Video Solution

Ques 56 Operating System

---

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first.

Process	Arrival Time	Burst Time
P1	0	10
P2	3	6
P3	7	1
P3	8	3

The average turn around time of these processes is ___________ milliseconds.

See Answer Video Solution

Ques 57 Operating System

---

Consider the following two-process synchronization solution.

Process 0
---------
Entry: loop while (turn == 1);
(critical section)
Exit: turn = 1;

Process 1
----------
Entry: loop while (turn == 0);
(critical section)
Exit: turn = 0;

The shared variable turn is initialized to zero. Which one of the following is TRUE?

A

This is a correct two-process synchronization solution.

B

This solution violates mutual exclusion requirement.

C

This solution violates progress requirement.

D

This solution violates bounded wait requirement.

See Answer Video Solution

Ques 58 Operating System

---

In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?

A

LRU (Least Recently Used)

B

OPT (Optimal Page Replacement)

C

MRU (Most Recently Used)

D

FIFO (First In First Out)

See Answer Video Solution