# Tag Archives: GATE-CS-2014-(Set-1)

## GATE | GATE-CS-2014-(Set-1) | Question 50

Consider the following C function in which size is the number of elements in the array E: The value returned by the function MyX is… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ______________. (A) 148 (B) 147 (C) 146 (D)… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 48

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

There are 5 bags labeled 1 to 5. All the coins in a given bag have the same weight. Some bags have coins of weight… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

Which of the regular expressions given below represent the following DFA? I) 0*1(1+00*1)* II) 0*1*1+11*0*1 III) (0+1)*1 (A) I and II only (B) I and… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 45

Let L be a language and L’ be its complement. Which one of the following is NOT a viable possibility? (A) Neither L nor L’… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 44

A canonical set of items is given below S –> L. > R Q –> R. On input symbol < the set has (A) a… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3,… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds. Process Name Arrival… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 40

Given the following two statements: S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. S2: AB->C, D->E, E->C is a… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x)… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is… Read More »

## GATE | GATE-CS-2014-(Set-1) | Question 65

Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is… Read More »