Q1: 1. Which of the following problems is decidable in the Theory of Computation?

• A) Halting problem
• B) Traveling Salesman Problem
• C) Palindrome recognition
• D) Graph coloring

Q2: 2. A real life problem that can be modeled as a decidable problem in Theory of Computation is

• A) Determining if a given number is prime
• B) Finding the shortest path in a network
• C) Checking if a given string is a valid email address
• D) Coloring a map with the fewest colors

Q3: 3. Which of the following problems is decidable in the context of Theory of Computation?

• A) Sorting a list of integers
• B) Checking if a given grammar is ambiguous
• C) Finding the minimum spanning tree of a graph
• D) Solving the Sudoku puzzle

Q4: 4. An example of a decidable problem in Theory of Computation is

• A) Determining the optimal route for a delivery truck
• B) Verifying if a given program will halt on a specific input
• C) Deciding the optimal pricing strategy for a product
• D) Finding the largest prime number less than a given value

Q5: 5. Which of the following is a decidable problem in the Theory of Computation?

• A) Predicting the weather accurately for the next month
• B) Checking if a given language is regular
• C) Determining the best investment strategy
• D) Finding the shortest path in a weighted graph

Q6: 6. A problem that is decidable in the Theory of Computation is

• A) Predicting the outcome of a coin toss
• B) Recognizing whether a given number is a Fibonacci number
• C) Deciding the best time to buy or sell stocks
• D) Determining the optimal seating arrangement at an event

Q7: 7. Which of the following problems is decidable in Theory of Computation?

• A) Predicting the next digit in the sequence 3, 6, 9, 12, ...
• B) Checking if a given Turing machine will loop forever on a specific input
• C) Determining the winner of a sports tournament
• D) Finding the maximum flow in a network

Q8: 8. An example of a decidable problem in Theory of Computation is

• A) Predicting the outcome of a dice roll
• B) Recognizing whether a given string is a valid XML document
• C) Deciding the best time to book a flight
• D) Finding the optimal route for a road trip

Q9: 9. Which of the following problems is decidable in the Theory of Computation?

• A) Predicting the stock market trends accurately
• B) Checking if a given language is context-free
• C) Determining the winner of a lottery
• D) Finding the shortest path in a maze

Q10: 10. A decidable problem in the Theory of Computation is

• A) Predicting the winner of a poker game
• B) Verifying if a given language is regular
• C) Deciding the best time to plant crops
• D) Finding the optimal route for a marathon

Q11: 11. Which of the following problems is decidable in Theory of Computation?

• A) Predicting the outcome of a coin flip
• B) Recognizing whether a given string is a palindrome
• C) Deciding the best time to go on a vacation
• D) Finding the maximum clique in a graph

Q12: 12. An example of a decidable problem in Theory of Computation is

• A) Predicting the winner of a game of chess
• B) Checking if a given language is context-sensitive
• C) Deciding the optimal route for a road trip
• D) Finding the shortest path in a network

Q13: 13. Which of the following problems is decidable in the Theory of Computation?

• A) Predicting the outcome of a lottery
• B) Recognizing whether a given number is a perfect square
• C) Deciding the best time to buy a house
• D) Finding the Eulerian cycle in a graph

Q14: 14. A decidable problem in the Theory of Computation is

• A) Predicting the score of a football game
• B) Verifying if a given language is deterministic context-free
• C) Deciding the best time to start a business
• D) Finding the optimal path through a traffic jam

Q15: 15. Which of the following problems is decidable in Theory of Computation?

• A) Predicting the outcome of a slot machine
• B) Checking if a given language is recursively enumerable
• C) Determining the best time to take a vacation
• D) Finding the maximum cut in a graph

Q16: 16. An example of a decidable problem in Theory of Computation is

• A) Predicting the winner of a card game
• B) Recognizing whether a given string is a valid JSON document
• C) Deciding the optimal time to retire
• D) Finding the shortest path in a labyrinth

Q17: 17. Which of the following problems is decidable in the Theory of Computation?

• A) Predicting the next prime number in a sequence
• B) Checking if a given language is context-sensitive
• C) Determining the best time to invest in stocks
• D) Finding the maximum matching in a bipartite graph

Q18: 18. A decidable problem in the Theory of Computation is

• A) Predicting the outcome of a roulette wheel spin
• B) Verifying if a given grammar is in Chomsky Normal Form
• C) Deciding the optimal time to change careers
• D) Finding the optimal route for a hike

Q19: 19. Which of the following problems is decidable in Theory of Computation?

• A) Predicting the result of a coin toss
• B) Recognizing whether a given string is a valid XML document
• C) Deciding the best time to buy a car
• D) Finding the maximum flow in a network

Q20: 20. An example of a decidable problem in Theory of Computation is

• A) Predicting the outcome of a lottery draw
• B) Checking if a given language is regular
• C) Deciding the best time to start a family
• D) Finding the shortest path in a city map

Q21: 21. Which of the following problems is decidable in the Theory of Computation?

• A) Predicting the winner of a horse race
• B) Recognizing whether a given string is a palindrome
• C) Deciding the optimal time to buy a house
• D) Finding the maximum clique in a social network

Q22: 22. A decidable problem in the Theory of Computation is

• A) Predicting the outcome of a dice roll
• B) Verifying if a given language is context-free
• C) Deciding the best time to take a vacation
• D) Finding the optimal route for a road trip

Q23: 23. Which of the following problems is decidable in Theory of Computation?

• A) Predicting the weather accurately for the next week
• B) Checking if a given Turing machine will loop forever on a specific input
• C) Determining the best investment strategy
• D) Finding the shortest path in a weighted graph

Q24: 24. An example of a decidable problem in Theory of Computation is

• A) Predicting the outcome of a football game
• B) Recognizing whether a given string is a valid XML document
• C) Deciding the optimal time to retire
• D) Finding the maximum matching in a bipartite graph

Q25: 25. Which of the following problems is decidable in the Theory of Computation?

• A) Predicting the next digit in the sequence 2, 4, 6, 8, ...
• B) Checking if a given grammar is ambiguous
• C) Determining the winner of a reality TV show competition
• D) Finding the maximum flow in a network