GATE CSE 1991 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1991

True or False

-0

Indicate the following statement true or false:

A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation.

TRUE

FALSE

GATE CSE 1991

MCQ (Single Correct Answer)

-0.6

Let $$r = 1\,{\left( {1 + 0} \right)^ * },s = {11^ * }\,0$$ and $$\,t = {1^ * }\,0$$ be three regular expressions. Which one of the following is true?

$$L\left( s \right) \subseteq L\left( r \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( t \right)\,\,$$

$$L\left( r \right) \subseteq L\left( s \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( t \right)\,\,$$

$$L\left( s \right) \subseteq L\left( t \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( r \right)\,\,$$

$$L\left( t \right) \subseteq L\left( s \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( r \right)\,\,$$

GATE CSE 1991

MCQ (Single Correct Answer)

-0.6

Which one of the following is the strongest correct statement about a finite language over some finite alphabet $$\sum ? $$

It could be un-decidable

It is Turing-machine recognizable

It is a regular language

It is a context-sensitive language

GATE CSE Papers

2023