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

Bihar STET – TOC Practice Test | Set 3

Questions 1-5 of 100

0% completed (0/100 answered)

Question 1

MCQ · Single Correct 1 mark

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

What is the total number of non-empty proper prefixes of the string 'automata'?

A 8 B 5 C 6 D 7

Question 2

MCQ · Single Correct 1 mark

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

If a regular language L is accepted by a DFA with n states, what is the upper bound on the number of states in a minimal DFA for the language L' (complement of L)?

A n - 1 states B n! states C $2^n states$ D n states

Question 3

MCQ · Single Correct 1 mark

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

Which of the following formal language classes is NOT closed under the reversal operation ($L^R)$?

A Recursively Enumerable Languages B Regular Languages C None of these (Regular, Context-Free, Context-Sensitive, and RE are all closed under reversal) D Context-Free Languages

Question 4

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 04.11.2025 PYQ

In a Generalized Nondeterministic Finite Automaton (GNFA) used for State Elimination, what are the labels on the transition edges?

A Parse Trees B Single Alphabet Symbols C $\Epsilon only$ D Regular Expressions

Question 5

MCQ · Single Correct 1 mark

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

When converting an n-state DFA to a Regular Expression using State Elimination, how many states does the initial GNFA contain?

A $2^n states$ B n states C n + 1 states D n + 2 states (a new start state and a new unique accept state)