GATE CSE 1997 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1997

MCQ (Single Correct Answer)

-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

x or A, y, x of B and z in S1 and x of B, y and i in S2

x or B, y and z in S1 and x of B, i and z in S2

x or B, z and y in S1 and x of A, i and y in S2

None of the above

GATE CSE 1997

MCQ (Single Correct Answer)

-0.6

Which one of the following is not decidable?

Given a Turing machine $$M,$$ a stings s and an integer $$k,$$ $$M$$ accepts $$s$$ within $$k$$ steps

Equivalence of two given Turing machines

Language accepted by a given finite state machine is not empty

Language generated by a context free grammar is non empty

GATE CSE 1997

MCQ (Single Correct Answer)

-0.3

$$\sum { = \left\{ {a,b} \right\},\,\,} $$ which one of the following sets is not countable.

Set of all strings over $$\sum {} $$

Set of all languages over $$\sum {} $$

Set of all regular languages over $$\sum {} $$

Set of all languages over $$\sum {} $$ accepted by Turing Machines.

GATE CSE 1997

MCQ (Single Correct Answer)

-0.6

Which one of the following regular expressions over $$\left\{ {0,\,\,1} \right\}$$ denotes the set of all strings not containing $$100$$ as substring?

$${0^ * }{\left( {1 + 0} \right)^ * }$$

$${0^ * }\,\,{1010^ * }$$

$${0^ * }\,\,{1^ * }\,\,{01^ * }$$

$${0^ * }{\left( {10 + 1} \right)^ * }$$

PREVIOUS NEXT