1
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Faster access to non-local variables is achieved using an array of pointers to activation records called a
A
stack
B
heap
C
display
D
activation tree
2
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
What value would the following function return for the input x = 95?
Function fun (x:integer):integer;
Begin
     If x > 100 then fun : x – 10
     Else fun : fun(fun (x + 11))
End;
A
89
B
90
C
91
D
92
3
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Let $$L$$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite-state automation accepting $$L$$ is
A
$$2$$
B
$$5$$
C
$$8$$
D
$$3$$
4
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Regarding the power of recognition of languages, which of the following statement is false?
A
The non-deterministic finite-state automata are equivalent to deterministic finite-state automata.
B
Non-deterministic Push-down automata are equivalent to deterministic Push-down automata.
C
Non-deterministic Turing machines are equivalent to deterministic Turing machines.
D
Multi-tape Turing machines are equivalent to Single-tape Turing machines.