Explore topic-wise MCQs in Automata Theory.

This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.

1.

State true or false:
Statement: Hamiltonian cycles through any fixed edge is always even, so if one such cycle is given, the second one must also exists.

A. true
B. false
Answer» B. false
Discussion
2.

Which of the following problems do not belong to Karp s 21 NP-complete problems?

A. Vertex Cover problems
B. Knapsack
C. 0-1 integer programming
D. None of the mentioned
Answer» E.
Discussion
3.

Which of the given problems are NP-complete?

A. Node cover problems
B. Directed Hamilton Circuit Problem
C. Node cover problems & Directed Hamilton Circuit Problem
D. None of the mentioned
Answer» D. None of the mentioned
Discussion