1
GATE CSE 1997
MCQ (Single Correct Answer)
+1
-0.3
Heap allocation is required for languages.
A
that support recursion
B
that support dynamic data structures
C
that use dynamic scope rules
D
None of the above
2
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6

Given the following Pascal like program segment:

Procedure A;

     x,y:intger;
     Procedure B;
            x,z:real;
            S1
     end B;
     Procedure C;
            i:integer;
            S2;
     end C;
end A;

The variables accessible in S1 and S2 are

A
x or A, y, x of B and z in S1 and x of B, y and i in S2
B
x or B, y and z in S1 and x of B, i and z in S2
C
x or B, z and y in S1 and x of A, i and y in S2
D
None of the above
3
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Which of the following languages over $$\left\{ {a,b,c} \right\}$$ is accepted by Deterministic push down automata?
A
$$\left\{ {w \subset {w^R}\left| {w \in \left\{ {a,b} \right\}{}^ * } \right.} \right\}$$
B
$$\left\{ {w{w^R}\left| {w \in \left\{ {a,b,c} \right\}{}^ * } \right.} \right\}$$
C
$$\left\{ {{a^n}{b^n}{c^n}\left| {n \ge 0} \right.} \right\}$$
D
$$\left\{ {w\left| w \right.} \right.$$ is palindrome over $$\left. {\left\{ {a,b,c} \right\}} \right\}$$
4
GATE CSE 1997
MCQ (Single Correct Answer)
+1
-0.3
$$\sum { = \left\{ {a,b} \right\},\,\,} $$ which one of the following sets is not countable.
A
Set of all strings over $$\sum {} $$
B
Set of all languages over $$\sum {} $$
C
Set of all regular languages over $$\sum {} $$
D
Set of all languages over $$\sum {} $$ accepted by Turing Machines.