Q1: 1. What does DFA stand for in Theory of Computation?

• A) Deterministic Finite Algorithm
• B) Deterministic Finite Automaton
• C) Deterministic Functional Algorithm
• D) Deterministic Functional Automaton

Q2: 2. Which of the following is true about a DFA?

• A) It can have epsilon transitions
• B) It can recognize non-regular languages
• C) It has a fixed number of states
• D) It can be in multiple states at the same time

Q3: 3. Which of the following is a real-life problem that can be modeled using a DFA?

• A) Automatic weather prediction
• B) Elevator control system
• C) Natural language processing
• D) GPS navigation system

Q4: 4. In a DFA, what happens if the input string does not match any of the transitions from the current state?

• A) It transitions to a random state
• B) It remains in the same state
• C) It goes to a special error state
• D) It stops processing the input

Q5: 5. Which of the following is a characteristic of a DFA?

• A) It can change the input string
• B) It can have multiple initial states
• C) It can have multiple transitions for the same input symbol
• D) It can have non-deterministic behavior

Q6: 6. What is the purpose of defining the alphabet in a DFA?

• A) To limit the number of states
• B) To define the input symbols the DFA can recognize
• C) To determine the number of transitions
• D) To specify the final states

Q7: 7. Which of the following is a real-life problem that can be solved using a DFA?

• A) Facial recognition
• B) Spam email filtering
• C) Stock market prediction
• D) Traffic signal optimization

Q8: 8. How does a DFA differ from an NFA (Non-deterministic Finite Automaton)?

• A) DFA can have epsilon transitions
• B) NFA has a fixed number of states
• C) DFA can have multiple transitions for the same input symbol
• D) NFA can be in multiple states at the same time

Q9: 9. Which of the following is a key component of a DFA?

• A) Stack
• B) Queue
• C) Transition function
• D) Priority queue

Q10: 10. In a DFA, what is the role of the transition function?

• A) Determines the next state based on the current state and input symbol
• B) Determines the number of final states
• C) Determines the alphabet of the DFA
• D) Determines the initial state

Q11: 11. Which of the following is a limitation of a DFA?

• A) Inability to recognize regular languages
• B) Inability to represent non-deterministic behavior
• C) Inability to have multiple transitions for the same input symbol
• D) Inability to have an infinite number of states

Q12: 12. How does a DFA process input strings?

• A) By modifying the input string
• B) By following a sequence of transitions based on the input symbols
• C) By randomly selecting a state to transition to
• D) By checking the input against a set of regular expressions

Q13: 13. Which of the following statements is true about the initial state of a DFA?

• A) It must be a final state
• B) It can be any state in the DFA
• C) It is the only state in the DFA
• D) It is the starting point for processing input strings

Q14: 14. Which of the following is an example of a DFA application in computer science?

• A) Image recognition
• B) Database management
• C) Lexical analysis in compilers
• D) Encryption algorithms

Q15: 15. How does a DFA determine whether an input string is accepted or rejected?

• A) By comparing the input string to a predefined list of acceptable strings
• B) By reaching a final state after processing the entire input string
• C) By discarding the input string if it does not match any transitions
• D) By performing a series of arithmetic operations on the input string

Q16: 16. In a DFA, what is the purpose of defining the set of final states?

• A) To limit the number of transitions
• B) To identify the starting state
• C) To determine the alphabet of the DFA
• D) To specify which input strings are accepted

Q17: 17. Which of the following is a benefit of using a DFA to model a problem?

• A) Flexibility to handle non-regular languages
• B) Efficient processing of input strings
• C) Ability to have an unbounded number of states
• D) Ability to have non-deterministic behavior

Q18: 18. What happens if a DFA reaches the end of an input string but is not in a final state?

• A) It transitions to a random state
• B) It remains in the same state
• C) It goes to a special reject state
• D) It stops processing the input

Q19: 19. Which of the following is a real-life problem that can be represented as a DFA?

• A) Voice recognition
• B) Social media recommendation system
• C) Railway reservation system
• D) Weather forecasting

Q20: 20. How does a DFA differ from a regular expression?

• A) DFA can represent non-regular languages
• B) Regular expressions can have multiple initial states
• C) DFA is a more compact representation of a language
• D) Regular expressions can handle an infinite number of states

Q21: 21. Which of the following is a key property of a DFA?

• A) Ability to change the input alphabet dynamically
• B) Deterministic behavior based on the input symbol
• C) Ability to recognize non-regular languages
• D) Non-deterministic transitions between states

Q22: 22. In a DFA, what is the purpose of defining the transition function?

• A) To specify the final states
• B) To determine the number of states
• C) To identify the starting state
• D) To determine the next state based on the current state and input symbol

Q23: 23. Which of the following is a limitation of a DFA compared to an NFA?

• A) Inability to recognize regular languages
• B) Inability to represent non-deterministic behavior
• C) Inability to have multiple transitions for the same input symbol
• D) Inability to reach a final state

Q24: 24. What is the role of the transition table in a DFA?

• A) It defines the input alphabet
• B) It specifies the final states
• C) It determines the number of states
• D) It represents the state transitions for each input symbol

Q25: 25. Which of the following is a real-life problem that can be solved using a DFA?

• A) Speech recognition
• B) Traffic congestion prediction
• C) Online shopping recommendation system
• D) DNA sequence analysis