MCQ Buddy
Search here...
  • Home
  • MCQ Feed
  • Add Question
  • Programming Portal
  • English Portal
  • Login
  1. Home
  2. Engineering
  3. Design and Analysis of Algorithms
  4. Question

M

Mr. Dubey • 100.69K Points
Coach

Q. How many conditions have to be met if an NP- complete problem is polynomially reducible?

  • (A) 1
  • (B) 2
  • (C) 3
  • (D) 4
  • Correct Answer - Option(B)
  • Views: 904
  • Filed under category Design and Analysis of Algorithms
Share

Explanation by: Mr. Dubey
a function t that maps all yes instances of decision problems d1 and d2 and t should be computed in polynomial time are the two conditions.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. What is stand for IPC?

Q. The operating system maintains a table that keeps track of how many frames have been allocated, how many are there, and how many are ava

Q. The most common source of change data in refreshing a data warehouse is _______.

Q. The man-in-the-middle attack can endanger the security of the Diffie-Hellman method if two parties are not

Q. Which Layer is Responsible for Congestion Control?

Q. Regular expressions are

Q. From the following data, calculate the location of node from the left end of shaft (l1).l1=0.6m, l2=0.5m, l3=0.4m d1=0.095m, d2=0.06m, d3=0.05m Ma = 9

Q. If the graph G1 and G2 has no vertex in common then it is said to be ______.

Q. Which is not an accepted strategy for data validity?

Q. Which of the following graph traversals closely imitates level order traversal of a binary tree?


Question analytics

Share

Embed

WhatsApp

Facebook

Telegram

Download

Share in MCQ Buddy Groups

Share
Embed
Important Links
  • Browse All Categories
  • Subjects
  • Exams
  • Mock Test
  • Advance Search
  • Quiz
  • Duo Test
  • English Topics
Explore More Portals
  • UC Quiz
  • Hindi
  • State wise Portals
  • MCQ Buddy Lab
  • Engineering
  • Programming Portal
  • MB Shorts
  • NCERT Portal
  • Faculties Portal
  • Groups
  • Q & A
  • Spaces
  • Satya Sanatan
  • Keycrypt
Who we are?

We are nothing if we are alone. But we have a huge community of students who are helping you getting good study stuff free.

More Links
  • Download App
  • Advertise with us
  • Contact us
  • Youtube
  • Terms & Conditions
  • Refund Policy
  • Privacy Policy
  • Get the source code

Since 2020 - 2025 | Proudly Made with ♥ in India

Hosted on Hostinger