## GATE | GATE-CS-2017 (Set 2) | Question 35

Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x = 0; ptr = &x; y = *ptr; *ptr… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 34

Which of the following is/are shared by all the threads in a process? I. Program Counter II. Stack III. Address space IV. Registers (A) I… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 33

The minimum number of ordered pairs that need to be added to R to make (X, R) a lattice is _____. Note: This question appeared… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 32

Consider a quadratic equation x2 – 13x + 36 = 0 with coefficients in a base b. The solutions of this equation in the same… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 31

Which of the following statements about the parser is/are correct? I. Canonical LR is more powerful than SLR. II. SLR is more powerful than LALR.… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 30

A Circular queue has been implemented using singly linked list where each node consists of a value and a pointer to next node. We maintain… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 29

Given the following binary number in 32 bit (single precision) IEEE-754 format: 00111110011011010000000000000000 The decimal value closest to this floating-point number is: (A) 1.45 X… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 28

The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w1aw2 | w1, w2 ∈{a,b}* , |w1|… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 27

G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 26

Identity the language generated by following grammar where S is the start variable. S –> XY X –> aX | a Y –> aYb |… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 25

Match the following: (A) P–>(ii), Q–>(iv), R–>(i), S–>(iii) (B) P–>(ii), Q–>(i), R–>(iv), S–>(iii) (C) P–>(ii), Q–>(iv), R–>(iii), S–>(i) (D) P–>(iii), Q–>(iv), R–>(i), S–>(ii) Answer: (A)… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 24

Let L1 and L2 be any context-free language and R be any regular language. Then, which of the following is correct ? I. L1 ∪… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 23

Consider a socket API on Linux machine that supports UDP socket. A connected UDP socket is a UDP socket on which connect function has already… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 22

Breath First Search(BFS) has been implemented using queue data structure. Which one of the following is a possible order of visiting the nodes in the… Read More »

## GATE | GATE-CS-2017 (Set 2) | Question 21

Consider the following tables T1 and T2: In table T1, P is the primary key, Q is the foreign key referencing R in table T2… Read More »