Computer Science · Design and Analysis of Algorithms
Let P1 be the problem of finding a Hamiltonian cycle in a graph G and P2 be the decision problem of determining if a Hamiltonian cycle exists in G. Which of the following statements is true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Both P1 and P2 are NP-Hard✓
- 2P1 is NP-Hard, but P2 is not
- 3P2 is NP-Hard, but P1 is not
- 4Neither P1 nor P2 is NP-Hard
Correct answer
Both P1 and P2 are NP-Hard
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms