1
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
What is the weight of a minimum spanning tree of the following graph? GATE CSE 2003 Algorithms - Greedy Method Question 10 English
A
29
B
31
C
38
D
41
2
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is
A
n1 is necessarily less than n2
B
n1 is necessarily equal to n2
C
n1 is necessarily greater than n2
D
None of the above
3
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
In a bottom-up evaluation of a syntax directed definition, inherited attributes can
A
always be evaluated
B
be evaluated only if the definition is L- attributed
C
be evaluated only if the definition has synthesized attributes
D
never be evaluated
4
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
A
Removing left recursion alone
B
Factoring the grammar alone
C
Removing left recursion and factoring the grammar
D
None of the above
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12