ADVANCED DATA STRUCTURES AND ALGORITHMS ANALYSIS CLASS TEST-6
Authored by Sudheer Potharaju
Engineering
University
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
30 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The Branch and Bound technique is primarily used for
Solving differential equations
Optimization problems
Simulation problems
Sorting problems
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
In the Branch and Bound method, a “bound” is used to
Determine the search direction
Eliminate suboptimal solutions
Randomly select branches
Sort the nodes
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The Branch and Bound approach for 0/1 Knapsack uses
Upper and lower bounds of profit
Random selection of items
Only weight constraints
None of the above
4.
MULTIPLE SELECT QUESTION
1 min • 1 pt
The Travelling Salesperson Problem is
Polynomial time solvable
NP-Complete
NP-Hard
Both B and C
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The TSP decision problem asks whether
There exists a tour with cost ≤ K
There exists a tour with minimum cost
6.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
A problem is said to be NP-Complete if
It is both in NP and NP-Hard
It can be solved in polynomial time
It is not in NP
None of the above
7.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
NP stands for
Non-polynomial
Non-deterministic Polynomial time
Numeric Polynomial
Nominal Polynomial
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
