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 with on-delete cascade and on-update cascade. In table T2, R is the primary key and S is the foreign key referencing P in the table T1 with on-delete set NULL and on-update cascade. In order to delete record (3,8) from table, numbers of additional record that need to be deleted from table T1 is ______. Note: This question appeared as Numerical Answer Type.

• 0
• 1
• 2
• 3

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 graph above.

• MNOPQR
• NQMPOR
• QMNROP
• POQNMR

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 been called. Which of the following statements is/are correct ?

I. A connected UDP socket can be used to communicate
   with multiple peers simultaneously.
II. A process can successfully call connect function
    again for an already connected UDP socket.

• I only
• II only
• Both I and II only
• Neither I nor II

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 ∪ L2 is context-free.
II. L1\' is context-free.
III. L1-R is context-free.
IV. L1 ∩ L2 context-free.

• I, II and IV only
• I and III only
• II and IV only
• I only

Question 25

Match the following:

• P-->(ii), Q-->(iv), R-->(i), S-->(iii)
• P-->(ii), Q-->(i), R-->(iv), S-->(iii)
• P-->(ii), Q-->(iv), R-->(iii), S-->(i)
• P-->(iii), Q-->(iv), R-->(i), S-->(ii)

Question 26

Identity the language generated by following grammar where S is the start variable.

S --> XY
X --> aX | a
Y --> aYb | ∈

• {a^m bⁿ| m>=n, n>0 }
• {a^m bⁿ| m>=n, n>=0 }
• {a^m bⁿ| m>n, n>=0 }
• {a^m bⁿ| m>n, n>0 }

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 n is ________

• 4
• 8
• 16
• 24

Question 28

The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w₁aw₂ | w₁, w₂ ∈{a,b}^* , |w₁| = 2, w₂>=3} is_______

• 3
• 5
• 8
• 7

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:

• 1.45 X 10¹
• 1.45 X 10^-1
• 2.27 X 10^-1
• 2.27 X 10¹

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 exactly two pointers FRONT and REAR pointing to the front node and rear node of queue. Which of the following statements is/are correct for circular queue so that insertion and deletion operations can be performed in O(1) i.e. constant time.

I. Next pointer of front node points to the rear node.
II. Next pointer of rear node points to the front node.

• I only
• II only
• Both I and II
• Neither I nor II