Exam
Vibe
Home
Engineering
Aerospace Engineering
Biomedical Engineering
Chemical Engineering
Civil Engineering
Computer Science
Electrical Engineering
Electronics and Communication Engineering
Mechanical Engineering
Govt Exam
Banking Exams
Other Government
Police
Railway Exams
SSC
State PSC Exams
Teaching / Education Exams
UPSC Exams
Blog
Contact
🔍
Home
›
Computer Science
›
Algorithms MCQ
›
Which of the following problems is NP-complete?
Which of the following problems is NP-complete?
A. Binary Search
B. Traveling Salesman Problem
C. Merge Sort
D. Prim’s Algorithm
Explanation:
The Traveling Salesman Problem is a well-known NP-complete problem.
Tags:
Algorithms MCQ
,
Computer Science
« Previous
Next »
More from Algorithms MCQ:
Which of the following is the time complexity of binary search algorithm?
Which sorting algorithm has the best average case time complexity?
In a graph, which traversal technique uses a queue?
Which data structure is used in a recursive function call?
What is the time complexity of binary search algorithm?
Which sorting algorithm has the best average-case performance?
Explore more in Computer Science:
Computer Science MCQs MCQs
Java MCQ Questions MCQs
PHP MCQ Questions MCQs
Python MCQ Questions MCQs
C MCQ Questions MCQs
C++ MCQ Questions MCQs
JavaScript MCQ Questions MCQs
HTML MCQ Questions MCQs
CSS MCQ Questions MCQs
SQL MCQ Questions MCQs