Design and Analvsis of Algorithms

Question Bank 2024-25

UNIT-1 Problem solving and Algorithmic Analysis

Basic Questions:
(Blooms Level- Understanding)

1. Discuss how algorithmsare important to

solve variousproblems.

2. Compare betwcen best casc, worst case, and average case analysis?
3. Defineasymptotic notation. What are the different types of asymptotic notations?
4. What is a recurrence relation in the contextof
algorithm analysis?
5. Explain the significance of time complexity in algorithm design.
6. Discuss the classifications of time complexity.

7. Show Amortized analysis Queue and Stack operations.

using
8. How does the Master Theorem
help to solve in algorithm
analysis?

Moderate Questions: (Blooms Level- Applying)

1. Show the relation between

upper bound and lower bound.

2. Classify asymptotic
notations as per their functions.

3. Write the Best case, worst

case and Avg. cases for
Linear Search.
4. Write the Best case,
worst case and Avg.
cases for Binary Search Tree.
5.Illustrate the Amortized
Analysis with respect to
algorithms.
6. Execute Amortized
analysis using Stack operations.

7.Show importance
of Recurrence relation
using eg.
8 Show how Master Theorem is useful to solverecurrencerelation.

9. Solve following
recurrence relation using master theorem: T(n) = 8T(n/2)+n*
10Solve Binary search recurrence relation using master theorem.
12. Form recurrence
relation for Merge Sort.

13.Find upper bound,lower bound and avg. bound values for for fn)-2n'+3n+4

14.Find upper bound value for for fn) =n'logn +n

15. Find upper bound value for for f(n)-2n'+4n+5

16. Describe different methodssupported by Amortized Analysis.

17.Calculate and explainthe time complexity for merge sort.

18. Define amortized analysis. How is it different from worst-case analysis and average-case
analysis?

19. Explain the significance of amortized analysis in algorithm design. Why is it useful for
analyzing certain types of algorithms?

20. List and briefly explain the three main techniques used in amortized
analysis.

21. What does it mean when we say that the amortized cost of an operation isconstant,cven
if some operations
occasionally take more time?

Descriptive/HOTS Questions: (Blooms Level- Analyzing)

1. Describe the process of proving the

2.
correctness ofan algorithm with an example.
Illustrate the use of asymptotic
notations with examples to
efficiency. analyze algorithm
3. How do you formulate and solve a recurTence relation using the
Discuss with eg. Master Theorem?
4. Compare Asymptotic analysis and
Amortized Analysis with eg.

5. Solve Amortized
complexity of 4 bit binary
method. incrementer from 0 to 11 with proper

O Prepare recurrence relation for Binary

Searchand solve it using Master Theorem.
7. Compare and contrast the time
complexitiesof Merge Sort and
worst, and averagecases. Quicksort in the best,

8.Propose a situation
PI analysis, where the best-case analysis is more
andjustify your useful than the worst-case
reasoning.
 UNIT 2- Divide and Conauer Strategy, Greedy Strategy

Basic Questions (Bloom's Level:

Understanding)

1. How does binary search utilize the divide and conquerstrategy?

2. What is the difference between quicksort and merge sort?

3. Explain how the divide and conquer strategy applies to finding the maximum
sub-array.

4. Explain the control abstraction of the greedy strategy.

5. What is the knapsack problem, and how is it solved using the greedymethod?
6. How does Dijkstra's algorithm find the shortest path in a graph?

Moderate Questions (Bloom's Level: Applying)

1. Apply the quicksort algorithm to the following array: [7,2, 9, 4, 3, 1, 5], and show
the steps.

2. Use

-2, 1, -3, 4, -1, 2,

3. Analyze the timecomplexity

,
the divide and conguer approach

-5,4].

ofmerge
to solve the maximum

sort using the divide

sub-array problem for the array

and conquerapproach.
4. Compare the time complexities of quicksort and merge sort in their best, worst, and
averagecases.
5. Apply divide and conquer to solve the integer multiplication problem using

Karatsuba's algorithm.

6 Solve the fractional knapsack problem tor the given weights and values: [weight:
10 value: 60,weight: 20,value: 100,weight: 30,value: 120, weight: 10,value:
60.weight: 20,value: 100,weight: 30,value: 120], with a knapsackcapacity of 50.
Apply algorithm to
7. Dijkstra's the
following graph:
A-BO),A-C(4),B+C(1),BD),CDS). Find the shortest path from node A to all
other nodes.

8 Analvze how the greedy approach opimizes the job scheduling

problem
9 Compare the greedy approaen wi dynamiC programming for solving the 0/1

knapsack problem.

10. sort to the following array

Apply merge [12,11,13,5,6,13,86.4 1,
10,7] and show the
process step-by-step.
 sub-array
solvethe maximum
usedto
Analyze how the divide and conquer strategy is

problem. Compare its time complexity with brute force methods.

sorted array [2, 3.
999 in the
of the element
12.
Apply binary search to find the position

S, 7,9, 11, 13,15). Show all thesteps. knapsack

algorithm in solving the fractional
13. Analyze the limitations of the greedy

problem when items cannot be split.

problem for jobs with the

to solve the job scheduling
14.
Use the greedy algorithm

following deadlines and profits:

Profit:30, Deadline:1,
Profit:40, Deadline:2,
Jobs =[Deadline:2, Profit:50,Deadline:1,

Profit:10]
Why is it more efficient than
of Dijkstra's algorithm.
15. Analyze the time complexity

Bellman-Ford for graphs with non-negative weights?

and efficiency for
of space complexity
and merge sort in terms
16. Compare quick sort

(random,nearly sorted, etc.).

different types of input data

Level: Analyze, Evaluating,

Higher Order Thinking Questions (HOTS)(Bloom's
Creating)
an optimization to improve its
and propose
1. Evaluate the limitations of quicksort

worst-case performance.
in integer arithmetic operations.
use of divide and conquer
2. Elaborate the practical

be better for large-scale multiplication?

Would a different approach
and conquer strategy in solving recursive
3. Evaluate the performance of the divide

compare it with dynamic programming.

problems like matrix multiplication and

fails to provide the optimal solution

a situation where the greedy approach
4. Evaluate
optimally?
problem. How can dynamic programmingsolve it

for the knapsack

work efficiently with negative
that could
5. Propose a variant of Dijkstra's algorithm

edge weights. problem

solving the job scheduling
the greedy strategy in
6. Assess the limitations of
solution.
and propose an alternative salesman
algorithm to solve the traveling
the greedy
7. Create a modification of

this modification
may or may not work.

problem. Explain why strategies.

and divide and conquer
between the greedy
8. Evaluate the differences
optimization problems?
for real-world
Which is more suitable
 UNIT 3- Dynamic Programming Strategy

Basic Questions(Bloom's Level: Understanding)

1. Explain the principle of optimality indynanmic programming.

2. What are the binomial coefficients, and how are they computed using dynamic
programming?
3. What is the O/1 knapsack problem? How does dynamic programming approach it

diflerently from the greedy method?

4. Explain the Floyd-Warshall algorithm for finding the all-pairs shortest path in a
graph.

5. What is the significanceof the binomial

cocfficient in combinatorics and probability

theory?
6 What is a binomial coefficient?How is it defined mathematically?
7. Describe the sum of subset problem in dynamic programming.
8. How does dynamic programming reduce the time complexity of recursive
algorithms?

Moderate Questions (Bloom's Level: Applying)

1. Apply dynamic programming to compute the binomial coefficient C(n,k) for n=5 and
k=2.

2. Solve the following instance of the 0/1 knapsack problem using dynamic
programming: Items = [weight: 2,value:3,weight: 3,value: 4,weight: 4,value: 5,

weight: 2,value: 3,weight: 3,value: 4,weight: 4,value:5],

Knapsack capacity = 5.
3. Use dynamic programming to solve the sum of subset problem for the set

[3,34,4,12,5,2]and a target sum of 9.

4. Apply the Floyd-Warshall algorithm to find the shortest paths for the following graph:

A+B(3),AC(8),B+C(2),C-A(5),BD(6),CD(4)
5. Analyze the time complexity of the
Bellman-Ford algorithm. How does it compare to

Dijkstra's algorithm?

6. How does dynamic programming solve the multistage graph problem more
efficiently than other methods?
7. Apply dynamie programming tocompute the OBST for the following frequencies of

search keys: Keys:A,B,C; Frequencies: 10,20,30.

S. Analyze the difference between the greedy solution and the dynamic programming

solution for the 0/1 knapsack problem.

9. Write the dynamic programming recurrence relation for computing binomial

coefticients.

10. Explain how to fill the table (array) in the dynamic programming solution for

binomial coefficients. What values are filled in the base cases?

11.Use dynamic programming to compute the binomial coefficient for C(6,3), and

compare it to the recursive approach.

12. Compute C(10, 4) using dynamic programming. Demonstrate how the binomial

coefficient can be computed using both fullDP table and an optimized solution.

13. Explain the role of memoization in dynamic programming. How does it improve

performance over simple recursion?

14. Solve the following 0/1 knapsack problem using dynamic programming: Items =
[weight: 2,value: 3,weight: 3,value: 4,weight: 4,value: 5,weight: 5,value: 8],

Knapsack capacity = 5.

15. Apply the dynamic programming approach to compute the sum of subset problem for

the set [1,2,5,6,8] with a target sum of 9.

l6. Analyze how dynamic programming improves the time complexity of solving the

binomial coefficient problem compared to recursive methods.

17.Use dynamic programming to compute the cost of constructing an Optimal Binary

SearchTree (OBST)
for the following keys and frequencies:

Keys =A,B,C,D, Frequencies =10,20,30,40.

18. Apply the Bellman-Ford algorithm to detect negative weight cycles in the following graph:
A+B(3),B+C(2),C+A(-6),AD(5).
19. Analyze the difference between the Floyd-Warshall algorithm and Dijkstra's

algorithm for solving the shortest path problem in weighted graphs.

20. Solve the multistage graph problem using dynamic programming for the following graph

with stages and weights: SI-+S2(2),S1-+s3(4), S2+s4(3),S3-S4(5)

21.Analyze the role of overlapping subproblemsin dynamic programming, using the

of the Fibonacci sequence. Why is dynanmic programming
example more efficient
for such problems?
than recursion
 (HOTS)Questions (Bloom's Level: Analyzing, Evaluating,
Higher Order Thinking Skills

Creating)

of dynamic programming in solving the all-pairs

1. Evaluate the benefits and limitations

shortest path problem using the Floyd-Warshall algorithm.

for a new variant of the knapsack problem
2. Create a dynamic programming solution

groups,each with its own constraints.

where items can be divided into multiple

of dynamic programming in solving the OBST problem

3. Evaluate the effectiveness

for large datasets. How could you optimize the space complexity?

for solving the traveling salesman

dynamic programming algorithm
4. Design a

greedy approach in terms of efficiency and accuracy.

problem. Compare it with the

Propose an alternative approach to solving the sum of subset problem when the set
5.

numbers. How would you modify the dynamic programming

contains negative

solution?

6. Evaluate the efficiency of dynamic programming for multistage graph problems

compared to greedyand backtracking approaches.

7. Analyze a situation where dynamic programming would not be the best approach to

solve the 0/l knapsackproblem,and propose an alternative solution.

8. Propose a dynamic programming algorithm to solve a multistage decision problem in

a business optimization scenario. How would you model the stages and decisions?

9. Form binomial coefficient formula and Compute C(8, 8) using dynamic

programming
 Unit 4 : Backtracking Strategies

Basic Ouestions
(Bloom's Level:
Understanding)
1. Explain the
concept of backtracking in problem-solving. How does differ from

it
brute force
approaches?
2. Describe how backtracking is used to solve the N-Queens problem. What are the key
steps involved?

3. Discuss the role of recursion in backtracking algorithms. Why is recursion essential

in implementing backtracking strategies?
4. Differentiate between backtracking and dynamic programming in terms of
problem-solving approach. Provide an example where backtracking would be more

appropriate.

5. Explain how backtracking fits into the overall design paradigm of algorithms. How
does it approach problem-solving differently from greedy or divide-and-conquer
strategies?

6. Illustrate with an example how backtracking ensures correctness in finding all

feasible solutions to an optimization problem.

7. Summarize the process of backtracking in solving the Hamiltonian Path problem.

How does backtracking ensure that no path is missed?

S. Explain why backtracking is often referred to as a depth-first search (DFS)approach.

How do they relate in terms of algorithm structure?

9. Differentiate between the types of problems that are best solved using backtracking

versus those better suited forgreedy algorithms.Provide an example for each

Applying)
Moderate Questions (Bloom's Level:

how the backtracking algorithm can be used to place 8queens On a

1. Demonstrate
chessboard such that no two queens medten eacn other. What specific conditions

would youcheck at each step?

backtracking. show how you wouia asSign colors to the of
vertices a graph
hat no two adjacent verticeS Share the same color. Apply this approach to a

5 vertices and 3 colors.

graph with
3. Given a can be used
set of numbers and a target sum, demonstrate how backtracking
tofind all subsets that sum up to the target. Use the set (1,3, 9, 2, 7}and target sum
of 10 to illustrate the process.

. Apply the backtracking technique to find a Hamiltonian cycle in a given matrix,

prepare a graph. Using a state space tree, show the algorithm'sexecution.

I011I
I|010
0110I
11010

5. Using the backtracking approach, write the pseudocode to solve the 8-Queen

problem. Then, manually place queens on a 4x4 chessboard and demonstrate how the

algorithm proceeds step by step.

6. Given a partially completed chessboard where 4 queens have already been placed,

use backtracking to place the remaining queens. Show the sequence of recursive calls

and decisions.

7. Implement the backtracking solution for the 8-Queen problem in a programming

language of your choice. Explain how you would handle situations where placing a

queen in a specific position leads to no further valid moves.

8. Modify the backtracking algorithm for the 8-Queen problem to count the total

number of valid solutions instead of finding just one solution. Demonstrate the

changes in the algorithmand show an example output.

9. Apply the backtracking method to solve a variant of the 8-Queen problem where

queens must be placed on a 10x 10 chessboard.What modifications are required, and

how does the search space change?

10. Using backtracking, write the pseudocode to solve a graph coloring problem with 4
vertices and 3 colors. Apply the algorithm lo a simple graph and demonstrate the

step-by-step process.

11. Given a specific graph (e.g., a triangle graph), use

backtracking to assign
Rneh vertex
colors to
such that no adjacent veruees Share the same color. Illustrate tha
process and show how conflicts areresolved.
recursive
 must be
vertex
a graph where cach
12. Implement a backtracking algorithm to color
adjacency matrix
colored with one of 4 colors.Apply this algorithm to a provided

backtracking decisions.
and explain how you handle color assignments and
solve the graph coloring problem with the
13. Modify the backtracking approach to

needed. Demonstrate your modified algorithm on a graph

minimum number of colors
with 5 vertices and explain how you optimize the color count.

14. Given a set of numbers 2,4, 6, 8, 10} and a target sum of 16, apply the backtracking

find subsets that sum up to 16. Show the step-by-step recursive calls
approach to all

and backtracking decisions made during the process.

15. Write the pseudocode for solving the sum of subsets problem using backtracking.

to find all subsets of the set (1,3, 5, 9} that sum to 10, and
Implement this algorithm

for cach step.

demonstrate the output with explanations

a backtracking algorithm that solves the sum of subsets problem for a set
16. Implement
and trace the steps where the
of integers. Apply this algorithm toa set of your choice

solution is not possible.

algorithm backtracks whena
count the number of all possible subsets that
approach to
17. Modify the backtracking
and sum of 12.Explain
value. Use the set {1,3, 9, 2,7}
target
sum to a given target
the count is
of how
the changes made to the algorithm and show an example

calculated.
the set contains both
sum of subsets problem where
18.Using backtracking, solve
a

the set (3,-2, 7, -1, 5} with a

positive and negative integers. Apply your algorithm to
backtracking
target sum of 6, and explain how you handle negative values during the

process,
to find a Hamiltonian cycle in a given
19. Using backtracking, write the pseudocode

graph. Apply your algorithm to a graph with 5 vertices and demonstrate how the

is detected step by step.

cycle
20 Given a specific graph, use the backtracking approach to find if a Hamiltonian cycle

evists Trace the recursive calls, decisions, and backtracking steps, showing when the

forward or backtracks.
algorithmmoves
solve the Hamiltonian cycle problem. Apply
21 Imnlement a backtracking algornm to
matrix and explain how you ensure that cach vertex is

it to a provided adjacency
the cycle
once, while maintaining constraint.

visited exactly
 cycles in a

22. Modify the backtracking all possible Hamiltonian

algorithm Lo return with 4
on a small graph
modification
given graph, not just one. Demonstrate this
cycle.
difers from finding a single
Vertices and explain how your approach
problem for a graph
cycle
23. Using the backtracking approach, solve the Hamiltonian
in the graph? Show
What happens when no Hamiltonian cycle
exists
with 6 vertices.

the appropriate output.

how your algorithm handles this scenario and returns

Higher Order Thinking Skills HOTS) Questions (Bloom's Level: Analyze)

algorithm used to solve the

1. Analyze the time complexity of the backtracking

8-Queen problem. How does the search space affect the overall performance of the

algorithm?

2. Compare the backtracking approach for the 8-Queen problem with other potential

approaches(e.g., brute force). VWhich approach is more efficient, and why?

3. Examine the process of placing queens in the 8-Queen problem. At what stagesdoes

the algorithm backtrack, and how does it decide which queen to reposition? Provide a

detailed explanation of the decision-making process.

4. Analyze the efficiency of the backtracking algorithm for solving the graph coloring

problem.What are the factors that influence the performanceof the algorithm,and
how can these factors be optimized?

5. Compare the backtracking approach for graph coloring with other techniques like

greedy algorithms or dynamic programming.What are the strengths and weaknesses

ofcach method in terms of time complexity and solution quality?

6. Examine the point at which backtracking occurs in the graph coloring problem.How
does the algorithm decide when to backtrack, and how does this impact the search for

a solution?

7. Compare the performance of the backtracking solution for the sum of subsets

problem with other approaches such as dynamic programming or brute force. Which

method is more efficient, and under what circumstances?

8. Examine how the problem size (number of elements in the set) and the target sum
affect the performance of the backtracking algorithm. How does increasing the
problem size impact the solution space, and what strategies could be used to manage
this?
 Unit: 5 Branch and Bound

Basic Questions(Bloom'sLevel: Understanding)

1, Explain the basie concept of the Branch and Bound technique, and the difference from

other algoithm design strategies like Greedy and Dynamic Programming.

2.Deseribe how Branch and Bound is applied to solve the 0/1 Knapsack problem. Explain

the role of bounding functions and how they improve the efficiency of the algorithm.

3. Explain the diflerence between depth-first search (DFS) and breadth-first search (BFS)
strategies in the context of Branch and Bound. When would you prefer one over the other?

4. Explain how the FIFO queue is used to explore the solution space in the Branch and

Bound algorithm.

5. Describe how the FIFO strategy differs from other Branch and Bound strategies like LIFO
and Best-First Search.

6. Explain how the LIFO (stack-based)strategy is used in the Branch and Bound algorithm

toexplore the solution space.

7. How does the LIFO Branch and Bound differ from the FIFO and Best-First Branch and

Bound approaches?

8. Explain how the Least Cost Branch and Bound technique determines which node to

explore next in the searchspace using suitable examples.

9. Describe the difference between Least Cost Branch and Bound and the general Branch

and Bound approach.

10. Explain the process of solving the 0/1 Knapsack problem using Branch and Bound. How

are upper bounds used in this method?

I1. How does the Branch and Bound technique for the 0/1 Knapsack problem ensure that the

solution found is optimal?

Branch and Bound method is used to solve the TSP. What role do Jower
12. Explain how the

bounds play in this method?

between solving TSP using Branch and Bound versus using bute
13.Describe the difference

force.

Moderate Questions (Bloom's Level: Applying)

1. Demonstrate how theFIFO Branch and Bound method can be applied to solve a simnle
01Knapsack problem.
2.
Apply the FIFO Branch small Traveling Salesman
and Bound approach to solve a

Problem (TSP).

3. Apply the LIFO Branch and Bound approach to solve the 0/1 Knapsack problem. Show
the steps involved.

4. Use LC Branch and Bound to find a solution to a Traveling Salesman Problem (TSP) with

4 cities.
3. Apply the Branch and Bound method to solve a 0/1 Knapsack problem with 3 items, given

specific weights and values.

6. Use Branch and Bound to demonstrate how to discard suboptimal branches when solving

a 0/l Knapsack problem.

0/1 Knapsack problem.
7. Apply the Least Cost Branch and Bound method to solve a small

how use the Least Cost Branch and Bound algorithm to solve a simple
8. Demonstrate to

S-city Traveling Salesman Problem (TSP).

Apply the Branch and Bound method to solve a small Traveling Salesperson Problem for
9.

4 cities with a given distance matrix.

10. Use the Branch and Bound approach to demonstrate how to prune suboptimal paths

when solving a simple TSP.

Order Thinking Skills (HOTS) Questions (Bloom's Level: Analyze)

Higher

1. Analyze the impact of using a FIFO queue on the efficiency of the Branch and Bound

and space complexity.

algorithm in terms of time
with Best-First Search Branch and
2. Compare the performance of FIFO Branch and Bound
problems.
Bound for solving optimization
LIFO over FIFO in terms of tinms

3. Analyze the strengths and weaknesses of using

Bound algorithm.
usage in the Branch and
complexity and memory
to a
solution Traveling Salesman Problem (TSP)
and Bound to find a of a
4, Use LC Branch

given matrix.

o 10 5

8 9
4 6
 5. How does the LIFO approach affect the order in which nodes are explored? Provide an

example to illustrate your answer.

6. Compare the effectiveness of the Least Cost Branch and Bound approach with the

Best-First and Depth-First Branch and Bound methods in terms of memory and time
complexity.

7. Analyze the time complexity of solving the 0/1 Knapsack problem using the Branch and

Bound approach. How does it compare with Dynamic Programming?

8. Compare the Branch and Bound method for the 0/1 Knapsack problem with the Greedy

method in terms of optimalityand efficiency,uc

Higher Order Thinking Skills (HOTS) Questions(Bloom's Level: Evaluate)

ont 1.Evaluate the situations where the FIFO Branch and Bound approach would be more

efficient than other variations of the Branch and Bound algorithm.

2. Evaluate the scenarios in which the LIFO Branch and Bound technique is more efficient

compared to other strategies like Best-First or FIFO.

3.Evaluate the advantages of using the Least Cost Branch and Bound method for solving

optimizationproblems likethe Traveling Salesman Problem (TSP).

4. Evaluate the effectiveness of different bounding functions (e.g, linear relaxation) used in

Branch and Bound for solving the 0/1 Knapsack problem.gnuuk pe one

5. Propose an enhancement to the standardBranch and Bound algorithm for solving the 0/1

Knapsack problem to improve its performance on larger datasets.

 Unit 6: Complexity Theory

Basic Questions (Bloom's Level: Understanding)

1. Explain the concept of NP-completeness.

2. Explain what is meant by the class NP-Hard.

3. Describe the significance of NP-complete problems.

4. Explain what is meant bya deterministic algorithms.

5. Elaborate deterministic and non-deterministicalgorithms with eg.

6 What are the Tactable and In Tactable problems.

7. Show the relation between P, NP, NP Hard and NP complete using Ven Daigram.

Moderate Questions(Bloom's Level: Applying)

1. Apply reduction techniques to prove that a problem is NP-complete.

2. Solve a problem using the concept of polynomial time reduction.

3. Demonstrate how a problem can be transformed into a known NP-complete problem.

4. Elaborate deterministicand non-deterministic algorithms with eg.

5. Use reduction techniques to show that a certain problem belongs to class NP.

6. Implement a heuristic algorithm for an NP-complete problem and discuss its

efficiency.

7. Apply approximation algorithms to solve an NP-hard problem and compare the

results.

8. Solve the vertex cover problem using approximation and discuss the complexity.

9. Apply complexity analysis to determine the feasibility of solving an NP-hard

problem in polynomial time.

10. Apply the concept of a certificate to verify the correctnessof an NP problem.

11. Solve a traveling salesman problem using an approximation algorithm and analyze its

performance.

12. Demonstrate how a reduction can simplify a graph problem in complexity theory.

13. Use the concept of computational complexity to analyze a real-world problem.

14.Apply time complexity analysis to an NP-complete problem and evaluate its

computational feasibility.
 15. Show
how a
known NP-complete problem can be used to prove the NP-completeness

of a new problem.

16. Prove Vertex cover problem NP

is Complete.

its
packing problem and discuss
algorithm for the bin
pement an approximation
efficiency.

a decision problem into another.

reductionto transform
T8. Demonstrate the use of

Prove Clique problem is NP Complete.

19. DiscussClique Problem and

20. Show 3 SAT Problem is NP Complete.

Level: Analyze)
Higher Order Thinking Skills (HOTS)Questions(Bloom's
in both deterministic and
complexity of a problem
1. Analyze the time

non-deterministicmodels.
problems using
2. Compare the space and time complexity of solving NP-complete
algorithms.
brute force and approximation
of the P vs. NP question in complexity theory.
3. Analyze the significance

Analyze how the complexity of problems

in NP influencesreal-world computational
4.

challenges.
methods for solving
the performance of exact algorithms and heuristic
5. Compare

NP-hard problems.
in solving NP-hard
the trade-offs between space and time complexity
6. Analyze
techniques.
problems using various in solving
with greedy algorithms
dynamic programming
7. Compare the efficiency of

NP-hard problems. problems

specific for NP-hard
algorithms
8 Analyze the limitations of existing approximation
and propose enhancements. of solving
complexity
on the time
V9. Analyze the effect of various heuristics

NP-complete problems.
 backtracks in the sum of subsets problem.
9. Analyze the points where the algorithm

backtracking, and how does this decision impact

What are the conditions that trigger

the explorationof the solutionspace?

backtracking algorithm used to find a

10. Analyze the time and space complexity of the

a graph. What factors contribute to the exponential growth of

Hamiltonian cycle in

the solutionspace, and how can these be reduced?

I1. Critically analyze the effectiveness of backtracking forsolving the Hamiltonian cycle

problem in directed graphs as opposed to undirected graphs. What additional

challenges does backtracking face in directed graphs, and how can the algorithm be
adapted?

12. Identify the points in the backtracking process where the algorithm decides to

backtrack in the Hamiltonian cycle problem. How do these decision points affect the

completeness and efficiency of the solution search?