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

Question 1

MCQ · Single Correct 1 mark

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

Which formal computational model possesses finite memory and is used to recognize Regular Languages?

A Pushdown Automaton (PDA) B Turing Machine (TM) C Linear Bounded Automaton (LBA) D Finite Automaton (DFA / NFA)

Question 2

MCQ · Single Correct 1 mark

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

In a Deterministic Finite Automaton (DFA), defined as a 5-tuple $M = (Q$, $\Sigma , \delta , q0, F), what$ is the signature of the transition function $\delta$?

A $\delta : Q \times Γ → Q \times Γ \times {L, R}$ B $\delta : Q \times (\Sigma ∪ {\epsilon }) → Q$ C $\delta : Q \times \Sigma → 2^Q$ D $\delta : Q \times \Sigma → Q$

Question 3

MCQ · Single Correct 1 mark

In a Nondeterministic Finite Automaton (NFA), what is the signature of the transition function $\delta$?

A $\delta : Q \times \Sigma → Q \times Q$ B $\delta : Q \times \Sigma → Q$ C $\delta : Q \times \Sigma → 2^Q$ D $\delta : Q \times Γ → 2^Q$

Question 4

MCQ · Single Correct 1 mark

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

If an NFA has 5 states excluding the initial state (i.e. 6 states in total), what is the maximum possible number of states in its converted equivalent DFA?

A 187 B 32 C 128 D 64

Question 5

MCQ · Single Correct 1 mark

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

For a DFA accepting binary numbers whose decimal equivalent is divisible by 3, how many states are required and what do the states represent?

A 1 state only B 2 states representing even and odd C 4 states representing remainders 0, 1, 2, 3 D 3 states representing remainders 0, 1, and 2