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

• A) Non-Finite Automaton
• B) Non-Deterministic Finite Automaton
• C) Non-Finite Algorithm
• D) Non-Deterministic Function

Q2: 2. Which of the following is true about NFA in comparison to DFA?

• A) NFA can have multiple possible next states for a given input symbol
• B) NFA can only have one next state for a given input symbol
• C) NFA is always deterministic
• D) NFA can accept any regular language

Q3: 3. In a real-life scenario, which problem can be modeled effectively using NFA?

• A) Traffic light control system
• B) Elevator control system
• C) Voice recognition system
• D) Weather forecasting system

Q4: 4. What is the purpose of having epsilon transitions in an NFA?

• A) To skip certain input symbols
• B) To have multiple possible transitions without consuming any input
• C) To loop back to the initial state
• D) To maximize the number of states

Q5: 5. Which of the following is a disadvantage of NFA over DFA?

• A) NFA can accept a broader class of languages
• B) NFA requires less memory to store transitions
• C) NFA is always faster in terms of processing
• D) NFA can be more complex to implement

Q6: 6. How many possible next states can an NFA have for a given input symbol?

• A) Only one
• B) Multiple
• C) None
• D) Infinite

Q7: 7. In a real-life scenario, which problem can be effectively solved using NFA?

• A) Sudoku puzzle solving
• B) Stock market prediction
• C) Image recognition
• D) Email spam filtering

Q8: 8. Which of the following is a characteristic of NFA?

• A) It must always have a unique transition for each input symbol
• B) It can be in multiple states simultaneously
• C) It cannot accept any regular language
• D) It has a fixed number of states

Q9: 9. How are transitions represented in an NFA?

• A) Transition table
• B) Transition matrix
• C) Transition diagram
• D) Transition function

Q10: 10. Which aspect of NFA allows for non-determinism?

• A) Multiple start states
• B) Multiple possible transitions for an input symbol
• C) Deterministic transitions
• D) Single final state

Q11: 11. In a real-life scenario, which problem can be effectively tackled using NFA?

• A) Self-driving car navigation
• B) Restaurant recommendation system
• C) Music playlist generation
• D) Language translation

Q12: 12. What is the role of epsilon transitions in an NFA?

• A) To consume additional input symbols
• B) To allow moving to other states without consuming any input
• C) To reset the NFA to the initial state
• D) To determine the final state

Q13: 13. Which property of NFA makes it more versatile than DFA?

• A) Determinism
• B) Non-determinism
• C) Finite states
• D) Complete transitions

Q14: 14. In a real-life scenario, which problem can be effectively addressed using NFA?

• A) Social media recommendation system
• B) Online shopping cart management
• C) GPS navigation
• D) Weather prediction

Q15: 15. How does an NFA handle ambiguous transitions?

• A) By selecting the first possible transition
• B) By exploring all possible transitions simultaneously
• C) By waiting for further input
• D) By rejecting the input string

Q16: 16. Which of the following is a key advantage of using NFA?

• A) Simplicity in implementation
• B) Deterministic nature
• C) Ability to handle complex patterns
• D) Limited expressiveness

Q17: 17. In a real-life scenario, which problem can be effectively solved using NFA?

• A) Speech recognition
• B) Online banking transactions
• C) Fitness tracking
• D) Recipe recommendation

Q18: 18. How does an NFA determine if a given input string is accepted?

• A) By reaching a specific state
• B) By consuming all input symbols
• C) By following a predefined path
• D) By backtracking

Q19: 19. What is the significance of the initial state in an NFA?

• A) It is the only accepting state
• B) It is the final state
• C) It is where the NFA starts processing input
• D) It determines the language accepted by the NFA

Q20: 20. In a real-life scenario, which problem can be effectively modeled using NFA?

• A) Personalized movie recommendation
• B) Online food delivery tracking
• C) Social media sentiment analysis
• D) Virtual reality gaming

Q21: 21. Which property of NFA allows for more flexibility in language recognition?

• A) Multiple final states
• B) Non-determinism
• C) Fixed transitions
• D) Limited states

Q22: 22. How does non-determinism affect the computational complexity of an NFA?

• A) It decreases the complexity
• B) It increases the complexity
• C) It has no impact on complexity
• D) It makes the NFA deterministic

Q23: 23. In a real-life scenario, which problem can be effectively handled using NFA?

• A) Medical diagnosis system
• B) Online language translation
• C) Virtual event planning
• D) Social network analysis

Q24: 24. What is the key difference between NFA and DFA in terms of transitions?

• A) NFA has only one possible transition for each input symbol
• B) NFA can have multiple possible transitions for each input symbol
• C) DFA can have epsilon transitions
• D) DFA transitions are non-deterministic

Q25: 25. Which aspect of NFA allows it to recognize a broader class of languages?

• A) Limited number of states
• B) Non-deterministic transitions
• C) Lack of final states
• D) Deterministic start state