1
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sets can be recognized by a Deterministic Finite-state Automation?
2
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Let $$L$$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite-state automaton accepting $$L$$ is
Paper Analysis
Total Questions
Algorithms 2
Compiler Design 2
Computer Organization 2
Data Structures 5
Database Management System 6
Discrete Mathematics 16
Operating Systems 13
Programming Languages 3
Theory of Computation 8
More Papers of GATE CSE
GATE CSE 2026 Set 2 GATE CSE 2026 Set 1 GATE CSE 2025 Set 2 GATE CSE 2025 Set 1 GATE CSE 2024 Set 2 GATE CSE 2024 Set 1 GATE CSE 2023 GATE CSE 2022 GATE CSE 2021 Set 2 GATE CSE 2021 Set 1 GATE CSE 2020 GATE CSE 2019 GATE CSE 2018 GATE CSE 2017 Set 1 GATE CSE 2017 Set 2 GATE CSE 2016 Set 1 GATE CSE 2016 Set 2 GATE CSE 2015 Set 3 GATE CSE 2015 Set 1 GATE CSE 2015 Set 2 GATE CSE 2014 Set 2 GATE CSE 2014 Set 1 GATE CSE 2014 Set 3 GATE CSE 2013 GATE CSE 2012 GATE CSE 2011 GATE CSE 2010 GATE CSE 2009 GATE CSE 2008 GATE CSE 2007 GATE CSE 2006 GATE CSE 2005 GATE CSE 2004 GATE CSE 2003 GATE CSE 2002 GATE CSE 2001 GATE CSE 2000 GATE CSE 1999 GATE CSE 1998 GATE CSE 1997 GATE CSE 1996 GATE CSE 1995 GATE CSE 1994 GATE CSE 1993 GATE CSE 1992 GATE CSE 1991 GATE CSE 1990 GATE CSE 1989 GATE CSE 1988 GATE CSE 1987
GATE CSE Papers
All year-wise previous year question papers
2023
2022
2020
2019
2018
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