GATE CSE 1999 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1999

MCQ (Single Correct Answer)

-0.6

A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor?

Pointers

Arrays

Records

Recursive procedures with local variable

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:

$$n$$ states

$$n+1$$ states

$$n+2$$ states

None of the above

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Context free languages are closed under:

Union, intersection

Union, Kleene closure

Intersection, complement

Complement, Kleene Closure

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages accepted by empty stack. Which of the following is true?

$${L_D}\,\, = \,\,{L_E}$$

$${L_D}\,\, \supset \,\,{L_E}$$

$${L_D}\,\, \subset \,\,{L_E}$$

None of the above

PREVIOUS NEXT

GATE CSE Papers

2025