GATE CSE 1990 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 1990

MCQ (Single Correct Answer)

-0.6

Match the pairs in the following:

List - I

(A) Small talk
(B) LISP
(C) Prolog
(D) VAL

List - II

(p) Logic programming
(q) Data flow programming
(r) Functional programming
(s) Object-Oriented programming

A - s; B - r; C - p; D - q

A - r; B - s; C - p; D - q

A - s; B - r; C - q; D - p

A - s; B - p; C - r; D - q

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 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 (Single Correct Answer)

-0.6

Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:

$${R_1} \cap R{}_2$$ is not regular.

$${R_1} \cup R{}_2$$ is regular.

$$\sum {^{^ * }} $$ $$-$$ $${R_1}$$ is regular.

$${R_1}{}^ * $$ is not regular.

PREVIOUS NEXT

GATE CSE Papers

2024

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