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

Bihar STET – TOC Practice Test | Set 1

Questions 21-25 of 100

0% completed (0/100 answered)

Question 21

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 07.11.2025 PYQ

What is the minimum number of states in a DFA accepting octal numbers divisible by 3?

A 3 states B 4 states C 8 states D 2 states

Question 22

MCQ · Single Correct 1 mark

What is a 'Dead State' (or Trap State) in a Finite Automaton?

A The initial state B A state with no transitions C An accepting state D A non-accepting state from which no transition can lead to an accepting state (all outgoing transitions loop back to itself)

Question 23

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 04.11.2025 PYQ

How many total states are required in a minimal DFA to accept the single word 'automata'?

A 7 states B 8 states C 9 states D 10 states

Question 24

MCQ · Single Correct 1 mark

Which decision property for regular languages determines whether a given DFA accepts at least one string or accepts no strings at all?

A Equivalence Problem B Emptiness Problem C Membership Problem D Finiteness Problem

Question 25

MCQ · Single Correct 1 mark

Is the Equivalence Problem ('Are two DFAs M1 and M2 accepting the exact same language L(M1) = L(M2)?') Decidable?

A Decidable for NFAs only B Yes, it is Decidable (e.g. by checking if (L1 ∩ L2') ∪ (L1' ∩ L2) is empty) C No, it is Undecidable D Decidable only for 1 state