GATE CSE 2008 | GATE CSE Year Wise Previous Years Questions - ExamSIDE.Com

Joint Entrance Examination

Medical

Graduate Aptitude Test in Engineering

CBSE

1

GATE CSE 2008

MCQ (Single Correct Answer)

+2

-0.6

Given below are two finite state automata ($$ \to $$ indicates the start state and $$F$$ indicates a final state) GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 43 English 1

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 43 English 1

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 43 English 2

Which of the following represents the product automation $$ZY$$?

A

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 43 English Option 1

B

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 43 English Option 2

C

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 43 English Option 3

D

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 43 English Option 4

2

GATE CSE 2008

MCQ (Single Correct Answer)

+2

-0.6

Match the following $$NFAs$$ with the regular expressions they correspond to GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 1

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 1

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 2

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 3

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 4

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 42 English 5

A

$$P - 2,\,Q - 1,\,R - 3,\,S - 4$$

B

$$P - 1,\,Q - 3,\,R - 2,\,S - 4$$

C

$$P - 1,\,Q - 2,\,R - 3,\,S - 4$$

D

$$P - 3,\,Q - 2,\,R - 1,\,S - 4$$

3

GATE CSE 2008

MCQ (Single Correct Answer)

+2

-0.6

Which of the following are regular sets? GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 41 English

GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 41 English

A

$${\rm I}$$ & $${\rm I}V$$ only

B

$${\rm I}$$ & $${\rm III}$$ only

C

$${\rm I}$$ only

D

$${\rm I}V$$ only

4

GATE CSE 2008

MCQ (Single Correct Answer)

+2

-0.6

Which of the following statement is false?

A

Every $$NFA$$ can be converted to an equivalent $$DFA$$

B

Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine.

C

Every regular language is also a context- free language

D

Every subset of a recursively enumerable set is recursive

GATE CSE Papers

2023

2022

2021

GATE CSE 2021 Set 2

GATE CSE 2021 Set 1

2020

2019

2018

2017

GATE CSE 2017 Set 1

GATE CSE 2017 Set 2

2016

GATE CSE 2016 Set 2

GATE CSE 2016 Set 1

2015

GATE CSE 2015 Set 1

GATE CSE 2015 Set 2

GATE CSE 2015 Set 3

2014

GATE CSE 2014 Set 1

GATE CSE 2014 Set 3

GATE CSE 2014 Set 2

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

EXAM MAP

Joint Entrance Examination

JEE Main JEE Advanced WB JEE BITSAT MHT CET KCET COMEDK VITEEE

Medical

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

CBSE