GATE CSE 2002 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as

Context free

Regular

Deterministic Context Free

Recursive

GATE CSE 2002

MCQ (Single Correct Answer)

-0.6

Which of the following is true?

The complement of a recursively language is recursive.

The complement of a recursively enumerable language is recursively enumerable.

The complement of a recursively language is either recursive or recursively enumerable.

The complement of a context-free language is context-free.

GATE CSE 2002

MCQ (Single Correct Answer)

-0.6

The $$C$$ language is:

A context free language

A context sensitive language

A regular language

Parsable fully only by a Turing machine

GATE CSE Papers

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

1988

1987