Time Left - 30:00 mins
GATE NATIONAL CHAMPION QUIZ-4
Attempt now to get your rank among 400 students!
Question 1
Consider the C program
Main()
{
int x = 10;
x = x + y + z;
}
How many tokens are identified by lexical analyzer?
Main()
{
int x = 10;
x = x + y + z;
}
How many tokens are identified by lexical analyzer?
Question 2
Some code optimizations are carried out on the intermediate code because
Question 3
What is the equivalent 3-address code for the above DAG?
Question 4
Which of the following grammar is LL(1)?
Question 5
Activation record does not contain the:
Question 6
What is the maximum value that is possible by the following expression tree at the root node such that id in leaf nodes can have only 2 values as 3 or 5?
Question 7
The language accepted by a Pushdown Automaton in which the stack is limited to10 items is best described as
Question 8
The above DFA accepts the set of all strings over {0, 1} that
Question 9
Which of the following is non-regular language?
Question 10
Find the minimum number of states in DFA of the following language : _____
L = {strings of 'a' | strings are of type (aa+aaa)*}
Question 11
Recursive language is not closed under which operation?
Question 12
Which of the following relation is undecidable?
- 400 attempts
- 0 upvotes
- 1 comment
Nov 24GATE & PSU CS
