1
GATE CSE 2025 Set 1
Numerical
+2
-0

The maximum value of $x$ such that the edge between the nodes $B$ and $C$ is included in every minimum spanning tree of the given graph is _______. (Answer in integer)

GATE CSE 2025 Set 1 Algorithms - Greedy Method Question 3 English

Your input ____
2
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+1
-0.33

Which ONE of the following statements is FALSE regarding the symbol table?

A
Symbol table is responsible for keeping track of the scope of variables.
B
Symbol table can be implemented using a binary search tree.
C
Symbol table is not required after the parsing phase.
D
Symbol table is created during the lexical analysis phase.
3
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+1
-0.33

Which ONE of the following techniques used in compiler code optimization uses live variable analysis?

A
Run-time function call management
B
Register assignment to variables
C
Strength reduction
D
Constant folding
4
GATE CSE 2025 Set 1
MCQ (More than One Correct Answer)
+2
-0

Which of the following statement(s) is/are TRUE while computing First and Follow during top down parsing by a compiler?

A
For a production $A \rightarrow \varepsilon, \varepsilon$ will be added to First(A).
B
If there is any input right end marker, it will be added to First(S), where $S$ is the start symbol.
C
For a production $A \rightarrow \varepsilon, \varepsilon$ will be added to Follow(A).
D
If there is any input right end marker, it will be added to Follow(S), where $S$ is the start symbol.
EXAM MAP