GATE CSE 1998 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

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$$

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 automation accepting $$L$$ is

$$2$$

$$5$$

$$8$$

$$3$$

PREVIOUS NEXT

GATE CSE Papers

2023