GATE CSE 1990 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1990

True or False

-0

State whether the following statement is TRUE / FALSE.

The intersection of two $$CFL's$$ is also $$CFL.$$

TRUE

FALSE

GATE CSE 1990

True or False

-0

State whether the following statement is TRUE / FALSE. The problem is to whether a Turing Machine M accepts input $$w$$ is un-decidable.

TRUE

FALSE

GATE CSE 1990

MCQ (Single Correct Answer)

-0.6

Recursive languages are:

A proper superset of context free languages.

Always recognizable by pushdown automata.

Also called Type $$(0)$$ languages.

Recognizable by Turing machines.

GATE CSE 1990

MCQ (More than One Correct Answer)

-0.6

It is decidable whether:

An arbitrary Turing machine halts after 10 steps.

A Turing machine prints a specific letter.

A Turing machine computes the product of two numbers.

None of the above.

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