GATE CSE 1998 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Which of the following sets can be recognized by a Deterministic Finite-state Automation?

The numbers $$1, 2, 4, 8, $$ ...... $${2^n},$$ ............. written in binary.

The numbers $$1, 2, 4, ..... $$ $${2^n},$$ $$.....$$ written in unary.

The set of binary strings in which the numbers of zeros is the same as the numbers of ones.

The set $$\left\{ {1,101,11011,1110111,...} \right\}.$$

GATE CSE 1998

MCQ (More than One Correct Answer)

-0.3

The string $$1101$$ does not belong to the set represented by

$${110^ * }\,\,\left( {0 + 1} \right)$$

$$\,1\,{\left( {0 + 1} \right)^ * }101$$

$${\left( {10} \right)^ * }\,{\left( {01} \right)^ * }\,{\left( {00 + 11} \right)^ * }$$

$${\left( {00 + {{\left( {11} \right)}^ * }0} \right)^ * }$$

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

How many substrings of different lengths (non-zero) can be formed from a character string of length $$n$$ ?

$$n$$

$${n^2}$$

$${2^n}$$

$$n\left( {n + 1} \right)/2$$

GATE CSE 1998

MCQ (Single Correct Answer)

-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

$$2$$

$$5$$

$$8$$

$$3$$

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