1
GATE CSE 2014 Set 2
Numerical
+2
-0
The number of distinct minimum spanning trees for the weighted graph below is ________
2
GATE CSE 2014 Set 2
+1
-0.3
A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:
A
10, 8, 7, 3, 2, 1, 5
B
10, 8, 7, 2, 3, 1, 5
C
10, 8, 7, 1, 2, 3, 5
D
10, 8, 7, 5, 3, 2, 1
3
GATE CSE 2014 Set 2
+1
-0.3

Consider the grammar defined by the following production rules, with two operators * and +

\eqalign{ & S \to T*P \cr & T \to U\,|\,T*U \cr & P \to Q + P\,|\,Q \cr & Q \to id \cr & U \to id \cr}

Which one of the following is TRUE?

A
+ is left associative, while * is right associative
B
+ is right associative, while * is left associative
C
Both + and * are right associative
D
Both + and * are left associative
4
GATE CSE 2014 Set 2
+2
-0.6
For a C program accessing X[ i ] [ j ] [ k ], the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits and the size of a character is 8 bits.
t0 = i * 1024
t1 = j * 32
t2 = k * 4
t3 = t1 + t0
t4 = t3 + t2
t5 = X[t4] 
Which one of the following statements about the source code for the C program is CORRECT?
A
X is declared as "int X[32] [32] [8]"
B
X is declared as "int X[4] [1024] [32]"
C
X is declared as "char X[4] [32] [8]"
D
X is declared as "char X[32] [16] [2]"
GATE CSE Papers
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Joint Entrance Examination