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)
+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.
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
If the regular set $$A$$ is represented by $$A = {\left( {01 + 1} \right)^ * }$$ and the regular set $$'B'$$ is represented by $$B = \left( {{{\left( {01} \right)}^ * }{1^ * }} \right),$$ which of the following is true?
A
$$A \subset B$$
B
$$B \subset A$$
C
$$A$$ and $$B$$ are incomparable
D
$$A=B$$
4
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sets can be recognized by a Deterministic Finite-state Automation?
A
The numbers $$1, 2, 4, 8, $$ ...... $${2^n},$$ ............. written in binary.
B
The numbers $$1, 2, 4, ..... $$ $${2^n},$$ $$.....$$ written in unary.
C
The set of binary strings in which the numbers of zeros is the same as the numbers of ones.
D
The set $$\left\{ {1,101,11011,1110111,...} \right\}.$$
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12