Bihar STET – TOC Practice Test | Set 1 ⋆ CSE Study247

Bihar STET – TOC Practice Test | Set 1

Questions 16-20 of 100

0% completed (0/100 answered)

Question 16

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 03.11.2025 (Shift-I) PYQ

What regular expression generates all strings over {a, b} that start with 'b' and end with 'bba'?

A b(a+b)*bba B ab(ab)*bba C b*a*bba D abab*bba

Question 17

MCQ · Single Correct 1 mark

Which state of a Finite Automaton is designated as the entry point where computation begins upon consuming input?

A Accepting State B Dead State C Trap State D Initial / Start State (q0)

Question 18

MCQ · Single Correct 1 mark

Can a Deterministic Finite Automaton (DFA) have multiple accepting (final) states?

A Yes, a DFA can have zero, one, or multiple final states B No, DFAs cannot have final states C No, a DFA must have exactly one final state D Only NFAs can have multiple final states

Question 19

MCQ · Single Correct 1 mark

What is an '$\epsilon -closure' of a state 'q'$ in an $\epsilon -NFA$?

A The initial state only B The set of all states reachable from 'q' by taking zero or more $\epsilon -transitions$ C The empty set D The set of states reachable by consuming '1'

Question 20

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 12.06.2024 (Shift-I) PYQ

Are Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA) equivalent in language recognition power?

A No, NFAs are strictly more powerful than DFAs B No, DFAs are strictly more powerful than NFAs C It depends on RAM size D Yes, both recognize the exact same class of languages (Regular Languages)