UNIT V LIMITATIONS OF ALGORITHMIC POWER
PART A
1. Define NP Completeness and NP Hard. [Apr/May 2019][Apr/May2023]
The problems whose solutions have computing times are bounded by polynomials of small degree.
2. State Hamiltonian Circuit Problem [Nov/Dec 2019, Apr/May 2019]
Hamiltonian circuit problem is a problem of finding a Hamiltonian circuit. Hamiltonian circuit is a circuit that
visits every vertex exactly once and return to the starting vertex.
3. Define P and NP Problems. [Nov/Dec 2018][Apr/May2023]
In computational complexity theory, P, also known as PTIME or DTIME(n), isa fundamental complexity
class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial
amount of computation time, or polynomialtime.
NP: the class of decision problems that are solvable in polynomial time on a nondeterministic machine
(or with a nondeterministic algorithm).(A deterministic computer is what we know).A nondeterministic computer
is one that can “guess” the right answer or solution think of a nondeterministic computer as a parallel machine
that can freely spawn an
infinite number of processes
4. Define sum of subset Problem. [Nov/Dec 2018]
Subset sum problem is a problem, which is used to find a subset of a given set
S={S1,S2,S3,…….Sn} of n positive integers whose sum is equal to given positive integer d.
5. Differentiate Feasible and Optimal Solution. [Nov/Dec 2017]
Feasible solution means set which contains all the possible solution which follow all the constraints.
An optimal solution is a feasible solution where the objective function reaches its maximum (or minimum)
value – for example, the most profit or the least cost. A globally optimal solution is one where there are no
other
feasible solutions with better objective function values
6. Explain Promising and Non-Promising Node [Nov/Dec 2017]
A node in a state-space tree is said to be promising if it corresponds to a partially constructed
solution that may still lead to a complete solution.
A node in a state-space tree is said to be promising if it corresponds to a partially constructed
solution that may still lead to a complete solution; otherwise it is called non- promising.
7. State the reason for terminating search path at the current node in branch and bound algorithm.
[Nov/Dec 2016]
In general, we terminate a search path at the current node in a state-space tree of a branch-and-bound algorithm for
any one of the following three reasons:
The value of the node‘s bound is not better than the value of the best solution seen so far.
The node represents no feasible solutions because the constraints of the problem are already violated.
The subset of feasible solutions represented by the node consists of a single point (and hence no further
choices can be made)—in this case we compare the value of the objective function for this feasible solution
with that of the best solution seen so far and update the latter with the former if the new solution is better.
8. How is lower bound found by problem reduction? [Apr/May 2018]
If problem P is at least as hard as problem Q ,then a lower bound for Q is also a lower bound for P. Hence ,find
problem Q with a known lower bound that can be reduced to problem P in question. then any algorithm that solves
P will also solve Q.
9. What are tractable and non-tractable problems? [Apr/May 2018]
Problems that are solvable by polynomial time algorithms as being tractable, and
problems that cannot be solved by polynomial time as being intractable.
• Sometimes the line between what is an 'easy' problem and what is a 'hard' problem is a fine one
10. Compare backtracking and branch bound techniques.
Backtracking is applicable only to non optimization problems.
Backtracking generates state space tree in depth first manner.
Branch and bound is applicable only to optimization problem.
Branch and bound generated a node of state space tree using best first rule.
11. What are the searching techniques that are commonly used in Branch-and-Bound method.
The searching techniques that are commonly used in Branch-and-Bound method are:
i. FIFO ii. LIFO iii. LC iv. Heuristic search
12. Illustrate 8 – Queens problem.
The problem is to place eight queens on a 8 x 8 chessboard so that no two queen “attack” that is, so that no
two of them are on the same row, columnor on the diagonal.
13. Show the purpose of lower bound. [MAY/JUNE 2016]
Lower bound of a problem is an estimate on a minimum amount of work needed to solve a given problem
14. Define chromatic number of the graph.
The m – color ability optimization problem asks for the smallest integer mfor which the graph G can be
colored. This integer is referred to as the chromatic number of the graph.
15. What is Absolute approximation?
A is an absolute approximation algorithm if there exists a constant k such
that, for every instance I of P, |A∗ (I) − A(I)| ≤ k. I For example, Planar graph coloring.
16. What is Relative approximation?
A is an relative approximation algorithm if there exists a constant k such
that, for every instance I of P, max{A∗(I) A(I), A(I) A∗(I)} ≤ k. I Vertex cover.
17. Show the application for Knapsack problem
The Knapsack problem is problem in combinatorial optimization. It derives its name from the maximum
problem of choosing possible essential that can fit into one bag to be carried on a trip. A similar problem very
often appears in business, combinatory, complexity theory,cryptography and applied mathematics.
18. Define Branch-and-Bound method.
The term Branch-and-Bound refers to all the state space methods in which all children of the E- node are
generated before any other live node can become the E- node.
19. Define backtracking.
Depth first node generation with bounding function is called backtracking. The backtracking algorithm has
its virtue the ability to yield the answer withfar fewer than m trials.
20. List the factors that influence the efficiency of the backtracking algorithm?
The efficiency of the backtracking algorithm depends on the following four factors. They are:
The time needed to generate the nextxBTL
The number of xk satisfying the explicitconstraints.
The time for the bounding functions Bk
The number of xk satisfying the Bk
21. When is a problem said to be NP Hard?
A problem is said to be NP-hard if everything in NP can be transformed in polynomial time into it, and a
problem is NP-complete if it is both in NP and NP-hard.
PART-B & C
1. Elaborate how backtracking technique can be used to solve the n-queens problem. Explain with an
example. [Nov/Dec 2019][Nov/Dec2023]
2. Explain Backtracking technique.[Apr/May2024]
3. Give solution to Hamiltonian circuit using Backtracking technique[Apr/May2024]
4. Give solution to Subset sum problem using Backtracking technique [Apr/May 2019]
5. Explain P, NP and NP complete problem[Nov/Dec2023]
6.Explain the approximation algorithm for the travelling salesman problem (TSP) [Apr/May 2019]
7.Outline the steps to find approximate solution to NP-Hard optimization problems using
approximation algorithms with an example. [Nov/Dec 2019][Apr/May2023]
8.Describe the travelling sales man problem using branch & bound technique with an
example.[Nov/Dec2023]
