Question Text Answer Text

State complexity of the recurrence relation T(n) = 8T(n/2) + n^2 O (n^2 )(N)

O ( log n)(N)

O (n^3 )(Y)

O (n)(N)

State which sorting algorithm has not the worst-case time Quick sort(N)
complexity of O(n^2)?

Merge sort(Y)

Insertion sort(N)

Selection sort(N)

Select which of the following statements is true about Prim's It is a greedy algorithm(Y)
Algorithm?

It always starts from the root

node(N)

It has a time complexity of O(E

log V)(N)

It uses a depth-first search

approach(N)

Select the purpose of using Prim's algorithm? To find the shortest path between
two nodes in a graph(N)

To find the maximum flow in a

network(N)
 To find the minimum spanning
tree in a graph(Y)

To find the strongly connected

components in a directed graph(N)

Trace the data structure that is used in Prim's Algorithm Queue(N)

Stack(N)

Heap(Y)

Linked List(N)

Identify the time complexity of Prim's Algorithm. O(E log V)(Y)

O(V log E)(N)

O(E^2)(N)

O(V^2)(N)

Select the main idea behind Prim's Algorithm. Starting from any vertex, select the
edge with minimum weight and
add it to the tree(Y)

Starting from any vertex, select the

edge with maximum weight and
add it to the tree(N)

Starting from the root node, select

the edge with minimum weight
and add it to the tree(N)
 Starting from the leaf nodes, select
the edge with minimum weight
and add it to the tree(N)

Trace which of the following statements is true about Prim's It is a greedy algorithm(Y)
Algorithm.

It always starts from the root

node(N)

It has a time complexity of O(V^2)

(N)

It uses a depth-first search

approach(N)

Select why Kruskal's algorithm is used for. To find the shortest path between
two nodes in a graph(N)

To find the maximum flow in a

network(N)

To find the minimum spanning

tree in a graph(Y)

To find the strongly connected

components in a directed graph(N)

Select the name of the data structure used in Kruskal's Queue(N)

Algorithm

Stack(N)

Heap(Y)

Linked List (N)

Identify the time complexity of Kruskal's Algorithm. O(E log V)(Y)

Identify the time complexity of Kruskal's Algorithm.

O(V log E)(N)

O(E^2)(N)

O(V^2)(N)

Predict the main idea behind Kruskal's Algorithm. Starting from any vertex, select the
edge with minimum weight and
add it to the tree(N)

Starting from any vertex, select the

edge with maximum weight and
add it to the tree(N)

Sort all edges by weight, and

select the edge with minimum
weight that does not form a
cycle(Y)

Select the vertex with maximum

degree and add all its incident
edges to the tree (N)

Select which of the following statements is true about Kruskal's It is a greedy algorithm(Y)
Algorithm?

It always starts from the root

node(N)

It has a time complexity of O(V^2)

(N)

It uses a depth-first search

approach(N)

Identify, DFS of a graph G=(V,E) has running time O(|V|+|E|)(Y)

O(|E|)(N)
Identify, DFS of a graph G=(V,E) has running time

O(|V|)(N)

None of these(N)

Trace, Dijkstra’s Algorithm is used to solve _____________ All pair shortest path(N)
problems.

Single source shortest path(Y)

Network flow(N)

Sorting(N)

Select the most commonly used data structure for implementing Max priority queue(N)
Dijkstra’s Algorithm

Stack(N)

Circular queue(N)

Min priority queue(Y)

Select the correct option, the Bellman Ford algorithm produces Boolean
_______ value to return.
(Y)

Integer

(N)

String

(N)

Double
 (N)

Select how many solution/solutions are available for a graph One solution
having negative weight cycle
(N)

Two solutions

(N)

No solution

(Y)

Infinite solutions

(N)

Select the running time of Bellman Ford Algorithm? O(V)

(N)

O(V2)

(N)

O(ElogV)

(N)

O(VE)

(Y)

Indentify how many times the for loop in the Bellman Ford V times
Algorithm gets executed?
(N)
Indentify how many times the for loop in the Bellman Ford
Algorithm gets executed?

V-1

(Y)

(N)

E-1

(N)

Trace the basic principle behind Bellman Ford Algorithm? Interpolation

(N)

Extrapolation

(N)

Regression

(N)

Relaxation

(Y)

Select the Floyd Warshall’s Algorithm and it is used for solving All pair shortest path problems
____________.
(Y)

Single Source shortest path

problems

(N)

Network flow problems

 (N)

Sorting problems

(N)

Select, the maximum flow problem which can be solved for finding a flow between source and
sink that is maximum

(Y)

finding a flow between source and

sink that is minimum

(N)

finding the shortest path between

source and sink

(N)

computing a minimum spanning

tree

(N)

Select which one is called the source vertex Vertex with no incoming edges

(Y)

Vertex with no leaving edges

(N)

Centre vertex

(N)

vertex with the least weight

(N)
Select, which algorithm is recommended to solve a maximum Prim’s algorithm
flow problem?
(N)

Kruskal’s algorithm

(N)

Dijkstra’s algorithm

(N)

Ford-Fulkerson algorithm

(Y)

Identify Ford- Fulkerson algorithm establish the idea of Naïve greedy algorithm approach

(N)

Residual graphs

(N)

Minimum cut

(Y)

Minimum spanning tree

(N)

Select, "a simple acyclic path between source and sink which augmenting path
pass through only positive weighted edges” is recommended to
call
(Y)

Critical path
 (N)

residual path

(N)

maximum path

(N)

Predict what time an augmented path can be found O(|E| log |V|)

(N)

O(|E|)

(Y)

O(|E|2)

(N)

O(|E|2 log |V|)

(N)

Identify which stage of algorithm development involves Describing the problem (Y)
understanding the problem and its requirements?

Identifying a suitable technique(N)

Designing the algorithm(N)

Proof of correctness(N)

Tell,what is the purpose of designing an algorithm in algorithm To prove its correctness(N)

development?
Tell,what is the purpose of designing an algorithm in algorithm
development?

To ensure its efficiency(Y)

To describe the problem in

detail(N)

To simplify the problem(N)

Define what is the purpose of proof of correctness in algorithm To ensure the algorithm is
development? efficient(N)

To describe the problem in

detail(N)

To simplify the problem(N)

To ensure the algorithm is

correct(Y)

Select what is the purpose of identifying a suitable technique in To make the algorithm more
algorithm development? complex (N)

To simplify the algorithm(N)

To ensure the algorithm is

efficient(Y)

To make the algorithm more

difficult to understand(N)

State the purpose of designing of an algorithm in algorithm To prove its correctness(N)

development?

To ensure its efficiency(Y)

To describe the problem in

detail(N)
 To simplify the problem(N)

Identify the purpose of proof of correctness in algorithm To ensure the algorithm is

development? efficient(N)

To describe the problem in

detail(N)

To simplify the problem(N)

To ensure the algorithm is

correct(Y)

State the notation is used to analyze the running time of an Proof of correctness(N)
algorithm as the input size increases?

Asymptotic notation(Y)

Recurrence relation(N)

Master theorem(N)

State the purpose of recurrence relation in algorithm To analyze the running time of an
development? algorithm(Y)

To simplify the problem(N)

To prove the correctness of an

algorithm(N)

To identify a suitable technique for

solving a problem(N)

Select which method can be used to solve recurrence relations? Proof of correctness(N)

Substitution method(Y)
Select which method can be used to solve recurrence relations?

Design of an algorithm(N)

Describing the problem(N)

Identify, which method can be used to solve recurrence relations Substitution method(N)
when the Master Theorem cannot be applied?

Recurrence tree method(Y)

Describing the problem(N)

Proof of correctness(N)

Predict the time complexity of Strassen’s algorithm for matrix O(n)(N)

multiplication :

O(n^2)(N)

O(n^3)(Y)

O(n^4)(N)

Indicate, which of the following is a disadvantage of Strassen’s It has a high space complexity(N)
algorithm for matrix multiplication?

It requires fewer arithmetic

operations compared to the
conventional algorithm(N)

It only works for square matrices

with a size that is a power of 2(Y)

It always produces accurate

results(N)
Identify the advantage of Strassen’s algorithm for matrix It always produces accurate
multiplication? results(N)

It is faster than the conventional

algorithm for all matrix sizes(N)

It is easy to implement and

requires no special hardware(N)

It has a lower space complexity

compared to the conventional
algorithm(Y)

Predict the time complexity of building a Huffman tree for a O(n)(N)

given set of symbols with their frequencies?

O(n log n)(Y)

O(n^2)(N)

O(n^3)(N)

Identify the time complexity of solving the fractional knapsack O(n)(Y)

problem using a greedy algorithm?

O(n log n)(N)

O(n^2) (N)

O(n^3)(N)

Select the time complexity of the dynamic programming O(n) (N)

algorithm for solving the matrix chain multiplication problem?

O(n log n) (N)

O(n^2) (N)
 O(n^3) (Y)

Show, what is the time complexity of the dynamic programming O(m) (N)
algorithm for finding the longest common subsequence (LCS) of
two strings of length m and n?

O(n) (N)

O(mn) (Y)

O(m + n)(N)

Identify the time complexity of the backtracking algorithm for O(n)

solving the N-Queens problem?
(N)

O(n log n)

(N)

O(n^2)

(N)

O(n^n)

(Y)

Identify the time complexity of the dynamic programming O(n)(N)

algorithm for solving the Travelling Salesman Problem with n
cities?

O(n log n) (N)

O(n^2) (N)

O(2^n * n^2) (Y)

Predict the time complexity of the brute-force algorithm for O(n) (N)
solving the N-Queens problem?

O(n log n)(N)

O(n^2)(N)

O(n^n)(Y)

Select the time complexity of the backtracking algorithm for O(n) (N)
solving the Travelling Salesman Problem with n cities?

O(n log n) (N)

O(n!)(Y)

O(2^n)(N)

State the set-covering problem? A problem in which the goal is to

find the smallest set of vertices
that covers all edges in a graph.
(N)

A problem in which the goal is to

find the smallest set of edges that
covers all vertices in a graph. (Y)

A problem in which the goal is to

find the largest set of vertices that
covers all edges in a graph. (N)

A problem in which the goal is to

find the largest set of edges that
covers all vertices in a graph. (N)

Identify which of the following is a common algorithm for the Dijkstra's algorithm.(N)
set-covering problem?
Identify which of the following is a common algorithm for the
set-covering problem?

Kruskal's algorithm.(N)

Prim's algorithm. (N)

Greedy algorithm.(Y)

Define the vertex cover problem? A problem in which the goal is to

find the smallest set of vertices
that covers all edges in a graph.
(Y)

A problem in which the goal is to

find the smallest set of edges that
covers all vertices in a graph. (N)

A problem in which the goal is to

find the largest set of vertices that
covers all edges in a graph. (N)

A problem in which the goal is to

find the largest set of edges that
covers all vertices in a graph. (N)

Identify which of the following is a common algorithm for the Dijkstra's algorithm.(N)
vertex cover problem?

Kruskal's algorithm. (N)

Prim's algorithm.(N)

Greedy algorithm.(Y)

State ,in the greedy algorithm for the set-covering problem, what Choose the set that contains the
is the criterion for choosing the next set to include in the cover? most uncovered vertices. (Y)

Choose the set that contains the

most uncovered edges. (N)
 Choose the set that contains the
fewest uncovered vertices. (N)

Choose the set that contains the

fewest uncovered edges.(N)

Select the approximation ratio of the greedy algorithm for the 1(N)
set-covering problem?

2(Y)

In(n) (N)

N(N)

Identify, which of the following is true about the vertex cover It is an NP-hard problem. (N)
problem?

It can be solved in polynomial

time(N)

It is an NP-complete problem (Y)

It is an NP-easy problem.(N)

Select ,which of the following is true about the vertex cover It can be solved in polynomial
problem in trees? time(Y)

It is an NP-hard problem.(N)

It is an NP-complete problem(N)

It can be solved in exponential

time(N)
State ,which of the following is an approximation algorithm for The greedy algorithm(Y)
the vertex cover problem?

The brute-force algorithm(N)

The backtracking algorithm(N)

The dynamic programming

algorithm(N)

Calculate the runtime complexity of the greedy algorithm for the O(n)
vertex cover problem?
(Y)

O(n log n)

(N)

O(n^2)

(N)

O(2^n)

(N)

Choose,which of the following is true about the vertex cover It is a special case of the set-
problem? covering problem.

(N)

It is a special case of the traveling

salesman problem

(N)

It is a special case of the knapsack

problem
 (N)

It is a special case of the shortest

path problem

(Y)

Choose ,which of the following is true about the vertex cover The optimal vertex cover has size
problem on a tree? n/2, where n is the number of
vertices in the tree.

(Y)

The optimal vertex cover has size

log n, where n is the number of
vertices in the tree.

(N)

The optimal vertex cover has size

2, regardless of the number of
vertices in the tree

(N)

The optimal vertex cover has size

1, regardless of the number of
vertices in the tree.

(N)

Select,which of the following is true about the vertex cover The optimal vertex cover has size
problem on a bipartite graph? n/2, where n is the number of
vertices in the graph.

(Y)

The optimal vertex cover has size

log n, where n is the number of
vertices in the graph.

(N)
 The optimal vertex cover has size
2, regardless of the number of
vertices in the graph

(N)

The optimal vertex cover has size

1, regardless of the number of
vertices in the graph

(N)

Explain what is K-center clustering? A clustering algorithm that divides

the data into K clusters.

(N)

A clustering algorithm that selects

K centers and assigns each data
point to its closest center

(Y)

A clustering algorithm that selects

K centers and assigns each data
point to its farthest center.

(N)

A clustering algorithm that selects

K centers and assigns each data
point to a random center.

(N)

Write the objective of K-center clustering? To minimize the distance between

data points in each cluster.

(N)
 To maximize the distance between
data points in each cluster.

(N)

To minimize the maximum

distance between a data point and
its assigned center

(Y)

To maximize the maximum

distance between a data point and
its assigned center.

(N)

Choose what is K-center clustering? A clustering algorithm that divides

the data into K clusters.

(N)

A clustering algorithm that selects

K centers and assigns each data
point to its closest center

(Y)

A clustering algorithm that selects

K centers and assigns each data
point to its farthest center.

(N)

A clustering algorithm that selects

K centers and assigns each data
point to a random center.

(N)
Choose which of the following is a limitation of K-center It cannot handle non-convex
clustering? clusters.

(N)

It always produces the optimal

solution.

(N)

It is not suitable for large datasets.

(N)

It requires the number of clusters

to be known in advance.

(Y)

Choose which of the following is a greedy algorithm for K- Select the data point farthest from
center clustering? all existing centers and add it as a
new center

(Y)

Select the data point closest to all

existing centers and add it as a
new center.

(N)

Select the data point farthest from

the closest existing center and add
it as a new center.

(N)

Select the data point closest to the

farthest existing center and add it
as a new center.

(N)
Select, the greedy algorithm for K-center clustering has a 2(Y)
performance guarantee of:

3/2(N)

1(N)

1/2(N)

Define, the hiring problem? A problem in which we want to

find the optimal policy for hiring
employees.(N)

A problem in which we want to

find the maximum number of
employees we can hire given a
budget constraint. (N)

A problem in which we want to

find the best candidate among a
stream of candidates when we
cannot see all of them at once. (Y)

A problem in which we want to

find the optimal allocation of
resources among several projects.
(N)

Select which of the following is a randomized algorithm for the Always select the first candidate as
hiring problem? the best candidate.(N)

Always select the last candidate as

the best candidate.(N)

Select each candidate with equal

probability and select the one with
the highest score.(Y)
 Select each candidate with equal
probability and select the one with
the lowest score.(N)

Select, what is a cut in a graph? A path between two vertices. (N)

A set of vertices that disconnects

the graph. (N)

A set of edges that disconnects the

graph. (Y)

A set of vertices and edges that

disconnects the graph.(N)

Select, what is the minimum cut in a graph? A path between two vertices.

(N)

A set of vertices that disconnects

the graph.

(N)

A set of edges that disconnects the

graph.

(Y)

A set of vertices and edges that

disconnects the graph.

(N)

Select, what is the minimum cut in a graph? The cut with the minimum number
of edges. (N)

The cut with the minimum sum of

edge weights. (Y)
 The cut with the minimum number
of disconnected components. (N)

The cut with the minimum sum of

vertex degrees. (N)

Predict, which of the following is a brute-force algorithm for Enumerate all possible cuts and
finding the minimum cut in a graph? select the one with the minimum
weight.(Y)

Use Dijkstra's algorithm to find

the shortest path between all pairs
of vertices. (N)

Use Kruskal's algorithm to find the

minimum spanning tree of the
graph. (N)

Use Prim's algorithm to find the

minimum spanning tree of the
graph.(N)

Predict, which of the following is true about the performance of It always finds the minimum cut.
the randomized algorithm for finding the minimum cut in a
graph?
(N)

It has a polynomial time

complexity.

(N)

Its success probability increases as

the number of trials increases.

(Y)

It has a performance guarantee of

1/2.
 (N)

Select which of the following is true about the class NP-hard? The problems in NP-hard can be
solved by deterministic algorithms
in polynomial time. (N)

The problems in NP-hard can be

solved by non-deterministic
algorithms in polynomial time.(N)

The problems in NP-hard cannot

be solved in polynomial time. (Y)

The problems in NP-hard can be

solved by probabilistic algorithms
in polynomial time. (N)

Identify which of the following is true about reducibility? A problem A is reducible to

problem B if an algorithm for B
can be used to solve A. (Y)

A problem A is reducible to
problem B if an algorithm for A
can be used to solve B. (N)

A problem A is reducible to
problem B if both problems can be
solved in polynomial time. (N)

A problem A is reducible to
problem B if both problems can be
solved in exponential time. (N)

Define the meaning of NP-complete? All problems in NP can be reduced

to NP-complete problems in
polynomial time. (N)
Define the meaning of NP-complete?

NP-complete problems are the

easiest problems in NP. (N)

NP-complete problems are the

hardest problems in NP. (Y)

NP-complete problems can be

solved in polynomial time.(N)

Identify the difference between NP-complete and NP-hard? NP-complete problems are a
subset of NP-hard pro,blems. (Y)

NP-hard problems are a subset of

NP-complete problems. (N)

NP-complete problems can be

solved in polynomial time. (N)

NP-hard problems can be solved in

polynomial time. (N)

Define vertex cover of a graph? A set of vertices that are not

adjacent to each other(N)

A set of vertices that are connected

by edges(N)

A set of vertices that cover all

edges in the graph(Y)

A set of vertices that are not

connected by edges (N)

Select which of the following is true about the size of a It is always equal to the number of
minimum vertex cover? vertices in the graph (N)
minimum vertex cover?

It is always equal to the number of

edges in the graph (N)

It is always less than or equal to

the number of vertices in the graph
(Y)

It is always greater than or equal to

the number of vertices in the graph
(N)

Identify,which of the following is true about the vertex cover It can be solved in polynomial
problem? time for any graph (N)

It can be solved in polynomial

time for some special graphs (N)

It is an NP-hard problem (N)

It is an NP-complete problem (Y)

Select,which of the following is true about the independent set A set of vertices that are not
of a graph? adjacent to each other(N)

A set of vertices that are connected

by edges (N)

A set of vertices that cover all

edges in the graph(N)

A set of vertices that are not

connected by edges (Y)

Examine which of the following is true about the size of a It is always equal to the number of
maximum independent set? vertices in the graph (N)
maximum independent set?

It is always equal to the number of

edges in the graph (N)

It is always less than or equal to

the number of vertices in the graph
(N)

It is always greater than or equal to

the number of vertices in the graph
(Y)

Select which of the following is true about the independent set It can be solved in polynomial
problem? time for any graph (N)

It can be solved in polynomial

time for some special graphs (N)

It is an NP-hard problem (N)

It is an NP-complete problem(Y)

Identify the maximum clique of a graph? A set of vertices that are not
adjacent to each other(N)

A set of vertices that are connected

by edges (N)

A set of vertices that cover all

edges in the graph (N)

A set of vertices that are all

connected to each other(Y)

Select which of the following is true about the size of a It is always equal to the number of
maximum clique? vertices in the graph (N)
maximum clique?

It is always equal to the number of

edges in the graph(N)

It is always less than or equal to

the number of vertices in the
graph(Y)

It is always greater than or equal to

the number of vertices in the
graph(N)

Select which of the following is true about the clique problem? It can be solved in polynomial
time for any graph

(N)

It can be solved in polynomial

time for some special graphs

(N)

It is an NP-hard problem

(Y)

It is an NP-complete problem

(N)

Identify which of the following algorithms is commonly used to Breadth-first search

find maximum cliques in a graph?
(N)

Depth-first search

(Y)

Dijkstra's algorithm

(N)
 Kruskal's algorithm

(N)

Select which of the following is true about the time complexity It can always be done in
of finding maximum cliques in a graph? polynomial time

(N)

It is always an NP-complete
problem

(N)

It depends on the size and

structure of the graph

(Y)

It is always an NP-hard problem

(N)

Solve which of the following is a brute-force approach to Depth-first search

finding maximum cliques in a graph?
(N)

Dijkstra's algorithm

(N)

Kruskal's algorithm

(N)

Enumerating all possible subsets

of vertices

(Y)
Choose which of the following is true about the space It is always polynomial in the size
complexity of finding maximum cliques in a graph? of the graph

(N)

It is always exponential in the size

of the graph

(N)

It depends on the algorithm used

(Y)

It is always constant

(N)

Solve which of the following is an optimization problem related Finding the shortest path between
to finding cliques in a graph? two vertices

(N)

Finding the minimum spanning

tree of the graph

(N)

Finding the maximum independent

set of the graph

(N)

Finding the largest clique in the

graph

(Y)

Choose which of the following is true about NP-complete They are easier to solve than NP
problems? problems
Choose which of the following is true about NP-complete
problems?

(N)

They are harder to solve than NP

problems

(Y)

They can be solved in polynomial

time

(N)

They are a subset of the class P

(N)

Choose which of the following is true about the verification step It is used to find a solution to the
in NP algorithms? problem

(N)

It is used to check if a solution to

the problem is correct

(Y)

It is not required in NP algorithms

(N)

It takes exponential time

(N)

State the current trend in algorithm design? Increasing reliance on brute force
approaches. (N)

Focusing on optimization
techniques. (Y)
 Increasing use of machine learning
algorithms.(N)

Decreasing use of heuristic

algorithms. (N)

Write a common feature of many modern algorithms? They are designed to work well on
small datasets. (N)

They are designed to be easily

implemented in any programming
language. (N)

They are based on probabilistic

models. (N)

They are designed to be scalable

and work well on large datasets.
(Y)

Choose which of the following is a popular optimization K-means clustering.(N)

algorithm?

Linear regression. (N)

Gradient descent.(Y)

Random forest. (N)

State the purpose of machine learning algorithms? To find optimal solutions to

complex problems.(N)

To learn patterns and make

predictions based on data. (Y)

To generate random data.(N)

To simplify complex problems by

reducing them to a set of rules. (N)
Choose a key characteristic of genetic algorithms? They rely on brute force
approaches to find solutions. (N)

They use machine learning to

optimize solutions. (N)

They are inspired by the principles

of natural selection. (Y)

They are designed to work well

only on small datasets. (N)

Choose which of the following is an example of a clustering Linear regression. (N)

algorithm?

K-means clustering. (Y)

Decision tree. (N)

Support vector machine. (N)

Select the purpose of optimization algorithms? To find the best solution to a

problem in the shortest possible
time.(Y)

To find all possible solutions to a

problem. (N)

To reduce a complex problem to a

simpler one.(N)

To randomly generate possible

solutions to a problem (N)

Select a common approach to designing algorithms for large Brute force methods(N)
datasets?
Select a common approach to designing algorithms for large
datasets?

Divide and conquer.(Y)

Random search. (N)

Heuristic algorithms. (N)

Choose which of the following is a type of supervised learning K-means clustering (N)
algorithm?

Decision tree. (Y)

Genetic algorithm. (N)

Gradient descent. (N)

Choose from the following the complexity of the recurrence θ (n^2 ) (Y)
relation T(n) = T(n/4) +T(n/2)+n^2

O ( log n)(N)

O (n^3 )(N)

O (n)(N)

State which sorting algorithm has the worst-case time Quick sort (N)
complexity of O(n^2)?

Merge sort (N)

Insertion sort (N)

Selection sort (Y)

Select the time complexity of algorithms in class P? O(n!) (N)

Select the time complexity of algorithms in class P?

O(n^2) (N)

O(n) (Y)

O(log n) (N)

State which of the following is true about class P? The problems in P can be solved
by deterministic algorithms in
polynomial time. (N)

The problems in P can be solved

by non-deterministic algorithms in
polynomial time. (N)

The problems in P cannot be

solved in polynomial time. (N)

The problems in P can be solved

by probabilistic algorithms in
polynomial time. (Y)

Select which algorithm is used to solve the traveling salesman Kruskal's algorithm(N)
problem?

Bellman-Ford algorithm(N)

Floyd-Warshall algorithm(N)

Held-Karp algorithm(Y)

Identify the time complexity of brute force algorithm? O(n) (N)

O(log n) (N)

O(n^2)(N)
 O(2^n) (Y)

Choose the option which of the following problems can be Traveling salesman problem(N)
solved using brute force

Knapsack problem(N)

String matching problem(Y)

None of the above(N)

Predict which algorithm is a brute force approach to find the Boyer-Moore algorithm (N)
longest common substring between two strings?

Knuth-Morris-Pratt algorithm (N)

Naive algorithm(Y)

Rabin-Karp algorithm(N)

Show ,which of the following is an example of brute force Divide and conquer algorithm(N)
approach to find the maximum subarray sum?

Dynamic programming algorithm

(N)

Kadane's algorithm(Y)

Floyd-Warshall algorithm(N)

Predict which of the following is a disadvantage of using brute It is easy to implement (N)
force approach?

It guarantees optimal solution (N)

force approach?

It has high time complexity(Y)

It is suitable for all types of

problems(N)

Indicate the Traveling Salesman problem (TSP)? Finding the shortest path between
two nodes in a graph(N)

Finding the longest path between

two nodes in a graph (N)

Finding the shortest path that visits

every node in a graph exactly once
(Y)

Finding the longest path that visits

every node in a graph exactly once
(N)

Identify which of the following is an example of an approximate Brute force algorithm (N)
algorithm for solving the TSP?

Divide and conquer algorithm(N)

Dijkstra's algorithm(N)

Nearest neighbor algorithm (Y)

Which of the following is a heuristic algorithm for solving the Brute force algorithm (N)
TSP?

Divide and conquer algorithm (N)

Simulated annealing algorithm(Y)

 Floyd-Warshall algorithm (N)

State which of the following statements is true for the TSP? It is a polynomial time solvable
problem(N)

It is an NP-hard problem(Y)

It is an NP-complete problem(N)

It is an example of a linear
programming problem (N)

Choose which algorithm is used to solve the TSP exactly for Branch and bound algorithm(Y)
small instances?

Greedy algorithm (N)

Genetic algorithm (N)

Ant colony optimization

algorithm(N)

Explain the basic idea of the Divide and conquer approach? Solving a problem by dividing it
into smaller subproblems, solving
each subproblem recursively, and
combining the solutions of the
subproblems(Y)

Solving a problem by solving it

directly without dividing it into
smaller subproblems (N)

Solving a problem by randomly

selecting solutions until the
optimal solution is found (N)
 Solving a problem by selecting the
first feasible solution that is found
(N)

Predict which of the following is an example of a problem that Sorting a list of numbers (N)
can be solved using the Divide and conquer approach?

Computing the factorial of a

number (N)

Finding the maximum subarray

sum (Y)

Checking whether a number is

prime or not (N)

Select ,what is the time complexity of the Merge sort algorithm? O(n) (N)

O(log n) (N)

O(n^2)(N)

O(n log n)(Y)

Determine which of the following is not a step in the Divide and Divide the problem into smaller
conquer approach? subproblems (Y)

Conquer the subproblems by

solving them recursively(N)

Combine the solutions of the

subproblems to solve the original
problem (N)

Randomly select solutions until

the optimal solution is found (N)

Select the time complexity of algorithms in class NP? O(n!) (N)

Select the time complexity of algorithms in class NP?

O(n^2)(N)

O(n)(N)

Exponential(Y)

Choose which of the following algorithms uses the Divide and Insertion sort
conquer approach to find the closest pair of points in a plane?
(N)

Quick sort

(N)

Merge sort

(N)

Divide and conquer algorithm for

closest pair

(Y)

Examine which of the following is a disadvantage of using the It is difficult to implement

Divide and conquer approach?
(N)

It has a high space complexity

(N)

It does not guarantee optimal

solutions

(N)

It has a high time complexity

 (Y)

Choose which of the following is an example of a problem that Finding the greatest common
cannot be solved using the Divide and conquer approach? divisor of two numbers

(N)

Finding the minimum element in a

list of numbers

(N)

Sorting a linked list

(N)

Solving a system of linear

equations

(Y)

Choose which algorithm uses the Divide and conquer approach Quick sort
to find the median of an array?
(N)

Merge sort

(N)

Binary search

(Y)

Heap sort

(N)

Cite how many solutions are available for a graph having One solution
negative weight cycle
Cite how many solutions are available for a graph having
negative weight cycle
(N)

Two solution

(N)

No solution

(N)

Infinite solution

(Y)

Explain the basic idea of the Greedy approach? Solving a problem by dividing it
into smaller subproblems, solving
each subproblem recursively, and
combining the solutions of the
subproblems

(N)

Solving a problem by solving it

directly without dividing it into
smaller subproblems

(N)

Solving a problem by selecting the

best possible option at each step,
without considering the long-term
consequences

(Y)

Solving a problem by randomly

selecting solutions until the
optimal solution is found

(N)

Choose which of the following is an example of a problem that Finding the shortest path between
can be solved using the Greedy approach? two nodes in a graph
Choose which of the following is an example of a problem that
can be solved using the Greedy approach?

(Y)

Computing the factorial of a

number

(N)

Sorting a list of numbers

(N)

Finding the maximum subarray

sum

(N)

Choose which of the following is true about class NP? The problems in NP can be solved
by deterministic algorithms in
polynomial time.

(N)

The problems in NP can be solved

by non-deterministic algorithms in
polynomial time.

(Y)

The problems in NP cannot be

solved in polynomial time.

(N)

The problems in NP can be solved

by probabilistic algorithms in
polynomial time.

(N)

Choose which of the following is true about the class NP- The problems in NP-complete can
complete? be solved by deterministic
algorithms in polynomial time.
Choose which of the following is true about the class NP-
complete?

(N)

The problems in NP-complete can

be solved by non-deterministic
algorithms in polynomial time.

(N)

The problems in NP-complete

cannot be solved in polynomial
time.

(Y)

The problems in NP-complete can

be solved by probabilistic
algorithms in polynomial time.

(N)

Identify which of the following algorithms uses the Greedy Depth-first search (N)
approach to find the shortest path between two nodes in a graph?

Breadth-first search (N)

Prim's algorithm (N)

Dijkstra's algorithm (Y)

Predict which of the following is a disadvantage of using the It is difficult to implement (N)
Greedy approach?

It does not guarantee optimal

solutions (Y)

It has a high space complexity (N)

It has a high time complexity (N)

Predict which of the following face with local maxima problem Dynamic Programming Method
(N)

Greedy Approach (Y)

Backtracking Approach (N)

Divide and Conquer Approach (N)

Choose which of the following is an example of a problem that Finding the minimum spanning
cannot be solved using the Greedy approach? tree of a graph (N)

Finding the maximum subarray

sum(N)

Finding the shortest path between

two nodes in a graph(N)

Finding the optimal solution to the

knapsack problem (Y)

Predict which of the following algorithms uses the Greedy Quick sort(N)
approach to find the Huffman codes of a set of characters?

Merge sort (N)

Dijkstra\'s algorithm (N)

Huffman coding algorithm (Y)

Choose which algorithm uses the Greedy approach to find the Depth-first search
optimal sequence of activities to be scheduled?
(N)
optimal sequence of activities to be scheduled?

Breadth-first search

(N)

Kruskal's algorithm

(N)

Activity selection algorithm

(Y)

Select which of the following is an example of a problem that Finding the shortest path between
can be solved using both the Greedy approach and dynamic two nodes in a graph
programming?
(N)

Computing the factorial of a

number

(N)

Finding the maximum subarray

sum

(N)

Solving the knapsack problem

(Y)

Discuss Knight's Tour on chess? A game of chess between two

players

(N)

A puzzle in which the objective is

to move a knight to every square
on a chessboard exactly once

(Y)
 A strategy for winning a game of
chess

(N)

A variation of chess played with a

larger board

(N)

Explain what is a knight's move on a chessboard? Moving one square horizontally or

vertically(N)

Moving two squares horizontally

or vertically (N)

Moving one square diagonally (N)

Moving two squares horizontally

and one square vertically or vice
versa (Y)

Identify the smallest chessboard on which a Knight's Tour is 4x4 (Y)

possible?

6x6 (N)

8x8 (N)

10x10 (N)

Predict the maximum number of moves required to complete a 63(Y)

Knight's Tour on an 8x8 chessboard?

62(N)

61(N)
 60(N)

Select which of the following is a common algorithm used to Depth-first search(Y)

solve the Knight's Tour problem?

Breadth-first search (N)

Dijkstra's algorithm(N)

Kruskal's algorithm (N)

Identify which of the following is not a heuristic used to solve Warnsdorff's rule
the Knight's Tour problem?
(N)

Least-recently-visited rule

(N)

Greedy approach

(Y)

Backtracking

(N)

Select which of the following is a key step in solving the Choosing the square with the
Knight's Tour problem using backtracking? fewest number of unvisited
neighbors

(N)

Choosing the square with the most

number of unvisited neighbors

(Y)
 Choosing the square with the
smallest number

(N)

Choosing the square with the

largest number

(N)

Predict the time complexity of the brute force algorithm for O(n!) (Y)
solving the Knight's Tour problem?

O(2^n)(N)

O(n^2)(N)

O(n log n) (N)

Select which of the following is a disadvantage of using the It requires a lot of memory
brute force algorithm for solving the Knight's Tour problem?
(N)

It is not guaranteed to find a

solution

(Y)

It is too slow

(N)

It is too complex to implement

(N)

Estimate the time complexity of Strassen’s algorithm for matrix O(n)

multiplication : Calculate the time complexity of Strassen’s
algorithm for matrix multiplication :
Estimate the time complexity of Strassen’s algorithm for matrix
multiplication : Calculate the time complexity of Strassen’s
algorithm for matrix multiplication :
(N)

O(n^2)

(N)

O(n^3)

(Y)

O(n^4)

(N)

int a = 0, b = 0; for (i = 0; i < N; i++) { a = a + rand(); } for (j = O(N * M) time, O(1) space (N)
0; j < M; j++) { b = b + rand(); }

O(N + M) time, O(N + M)

space(N)

O(N + M) time, O(1) space(Y)

O(N * M) time, O(N + M)

space(N)

Examine it's meaning when we say that an algorithm X is X will always be a better choice
asymptotically more efficient than Y? for small inputs (N)

X will always be a better choice

for large inputs(Y)

Y will always be a better choice

for small inputs(N)

X will always be a better choice

for all inputs(N)

Observe the time complexity of the following code: int a = 0, i = O(N) (N)
N; while (i > 0) { a += i; i /= 2; }
Observe the time complexity of the following code: int a = 0, i =
N; while (i > 0) { a += i; i /= 2; }

O(Sqrt(N))(N)

O(N / 2)(N)

O(log N)(Y)

Choose which of the following best describes the useful criterion Time (N)
for comparing the efficiency of algorithms?

Space (N)

Time and Space (Y)

None of the above(N)

Describe how is the complexity of time measured? By counting the number of

algorithms in an algorithm. (N)

By counting the number of

primitive operations performed
by the algorithm on a given
input size. (Y)

By counting the size of data

input to the algorithm. (N)

None of the above(N)

Examine it is True or False: Algorithm A and B have a worst- TRUE(N)

case running time of O(n) and O(logn), respectively. Therefore,
algorithm B always runs faster than algorithm A.

FALSE(Y)

Cite an algorithm used for finding all pair shortest paths in a Kruskal\'s Algorithm(N)
graph.

Prim\'s Algorithm(N)
Cite an algorithm used for finding all pair shortest paths in a
graph.

Dijkstra\'s Algorithm(N)

Floyd-Warshall Algorithm(Y)

Identify the primary focus of the Floyd-Warshall Algorithm. Minimum spanning tree(N)

Single-source shortest paths(N)

All pair shortest paths(Y)

Maximum flow in a network(N)

Select a graph traversal technique used in the Ford-Fulkerson Depth-First Search(N)

Algorithm.

Breadth-First Search(Y)

Dijkstra\'s Algorithm(N)

Bellman-Ford Algorithm(N)

Trace the steps involved in the Ford-Fulkerson Algorithm. Initialization(N)

Augmentation(Y)

Termination(N)

Compilation(N)

Cite the algorithm known for solving the maximum flow Bellman-Ford Algorithm(N)
problem in a network.

Kruskal\'s Algorithm(N)
Cite the algorithm known for solving the maximum flow
problem in a network.

Ford-Fulkerson Algorithm(Y)

Dijkstra\'s Algorithm(N)

Identify a key concept in flow networks. Spanning tree(N)

Maximum flow(Y)

Shortest path(N)

Minimum cut(N)

Select the correct statement about the Push-Relabel Algorithm. It is a greedy algorithm(N)

It is used for sorting(N)

It is a graph traversal algorithm(N)

It is used for maximum flow in a

network(Y)

Trace the process of cycle canceling in the Cycle Cancelling Identify augmenting paths(N)
Algorithm.

Cancel cycles in the residual

graph(Y)

Initialize the algorithm(N)

Compute shortest paths(N)

Cite the algorithm commonly used for finding minimum cost Prim\'s Algorithm(N)
flows in a network.
Cite the algorithm commonly used for finding minimum cost
flows in a network.

Dijkstra\'s Algorithm(N)

Bellman-Ford Algorithm(N)

Cycle Cancelling Algorithm(Y)

Identify a disadvantage of the Ford-Fulkerson Algorithm. It may not converge(Y)

It always finds the maximum

flow(N)

It is efficient for large graphs(N)

It is a shortest path algorithm(N)

Select a characteristic of the Push-Relabel Algorithm. It only works for acyclic

graphs(N)

It uses a priority queue(N)

It has a time complexity of

O(V^2E)(N)

It maintains a preflow(Y)

Trace the role of augmenting paths in the Ford-Fulkerson Initialization(N)

Algorithm.

Increase the flow along the

path(Y)

Termination(N)

Compilation(N)
Cite an application of the Floyd-Warshall Algorithm. Shortest path in a graph(N)

Maximum flow in a network(N)

All pair shortest paths(Y)

Sorting algorithms(N)

Identify a limitation of the Cycle Cancelling Algorithm. It only works for acyclic
graphs(N)

It is not guaranteed to find the

optimal solution(Y)

It is inefficient for large graphs(N)

It is a shortest path algorithm(N)

Select a property of flow networks. The sum of flows into a node

equals the sum of flows out(Y)

There is no concept of flow

conservation(N)

All edges have equal capacity(N)

The flow is constant throughout

the network(N)

Trace the primary objective of the Push-Relabel Algorithm. Sorting elements(N)

Achieving maximum flow(Y)

 Finding all pair shortest paths(N)

Canceling cycles in the residual

graph(N)

Cite the algorithm used for finding the minimum cut in a flow Dijkstra\'s Algorithm(N)
network.

Bellman-Ford Algorithm(N)

Kruskal\'s Algorithm(N)

Ford-Fulkerson Algorithm(Y)

Identify a scenario where the Ford-Fulkerson Algorithm is Image processing(N)

commonly applied.

Network flow optimization(Y)

Sorting algorithms(N)

Minimum spanning tree(N)

Select the correct statement about the Cycle Cancelling It is used for finding shortest
Algorithm. paths(N)

It is used for sorting(N)

It cancels cycles in the residual

graph(Y)

It is a greedy algorithm(N)

Trace the impact of augmenting the flow in the Ford-Fulkerson Decrease the overall flow in the
Algorithm. network(N)
Trace the impact of augmenting the flow in the Ford-Fulkerson
Algorithm.

Increase the overall flow in the

network(Y)

Have no effect on the network(N)

Terminate the algorithm(N)

Cite an advantage of the Push-Relabel Algorithm. It always finds the optimal

solution(N)

It has a time complexity of O(V^3)

(Y)

It is a greedy algorithm(N)

It is efficient for large graphs(N)

Identify a situation where the Floyd-Warshall Algorithm is not Sparse graphs(Y)

the most efficient choice.

Dense graphs(N)

Sorting algorithms(N)

Small-sized networks(N)

Select the correct statement about the Ford-Fulkerson It guarantees optimality in all
Algorithm. cases(N)

It may not find the maximum

flow(Y)

It works only for acyclic

graphs(N)
 It is a shortest path algorithm(N)

Trace the concept of residual graph in the Ford-Fulkerson It represents the original graph(N)
Algorithm.

It contains only forward edges(N)

It contains edges with available

capacity(Y)

It is used for sorting(N)

Cite a scenario where the Cycle Cancelling Algorithm is Maximum flow problem(N)
commonly used.

Shortest path problem(N)

Sorting algorithms(N)

Network flow optimization(Y)

Identify a limitation of the Push-Relabel Algorithm. It is not guaranteed to find the

optimal solution(Y)

It only works for acyclic

graphs(N)

It has a time complexity of

O(V^2E)(N)

It is inefficient for large graphs(N)

Select a property of the residual graph in the Ford-Fulkerson It contains only backward
Algorithm. edges(N)
Select a property of the residual graph in the Ford-Fulkerson
Algorithm.

It is acyclic(N)

It represents the original graph(N)

It contains edges with available

capacity(Y)

Trace the role of the Cycle Cancelling Algorithm in solving Finding all pair shortest paths(N)
network flow problems.

Canceling cycles in the residual

graph(Y)

Achieving maximum flow(N)

Sorting elements(N)

Cite an example of a problem that can be modeled using flow Sorting elements(N)
networks.

Image processing(N)

Shortest path problem(N)

Maximum flow problem(Y)

Identify a key aspect of the Ford-Fulkerson Algorithm. It is a shortest path algorithm(N)

It may not always terminate(Y)

It guarantees optimality in all

cases(N)

It is used for sorting(N)

Trace the significance of the residual graph in the Ford- It represents the original graph(N)
Fulkerson Algorithm.

It contains edges with available

capacity(N)

It is used for sorting(N)

Canceling cycles in the residual

graph(Y)

Cite an application of the Push-Relabel Algorithm. Maximum flow problem(Y)

Sorting algorithms(N)

Shortest path problem(N)

Network flow optimization(N)

Identify a key characteristic of the Cycle Cancelling Algorithm. It guarantees optimality in all
cases(N)

It cancels cycles in the residual

graph(Y)

It has a time complexity of O(V^3)

(N)

It is a greedy algorithm(N)

Select a scenario where the Floyd-Warshall Algorithm is Sparse graphs(N)

commonly used.

Network flow optimization(Y)

Sorting algorithms(N)
 Dense graphs(N)

Trace the process of augmenting paths in the Ford-Fulkerson Initialization(N)

Algorithm.

Identify augmenting paths(Y)

Termination(N)

Compilation(N)

Cite the key concept behind the Ford-Fulkerson Algorithm. Maximum flow in a network(Y)

Minimum spanning tree(N)

All pair shortest paths(N)

Sorting elements(N)

Select a characteristic of flow networks. Maximum flow is achieved at

every node(N)

The sum of flows into a node

equals the sum of flows out(Y)

All edges have equal capacity(N)

The flow is constant throughout

the network(N)

select ,The worst-case efficiency of solving a problem in O(p(n))(Y)

polynomial time is?

O(p( n log n))(N)

polynomial time is?

O(p(n2))(N)

O(p(m log n))(N)

Select the correct answer, _______ is the class of decision NP(Y)

problems that can be solved by non-deterministic polynomial
algorithms.

P(N)

Hard(N)

Complete(N)

The Euler’s circuit problem can be explain in? O(N)(N)

O( N log N)(N)

O(log N)(N)

O(N2(Y)

Identify the class does the Euler’s circuit problem belong? P class(Y)

NP class(N)

Partition class(N)

Complete class(N)

Select , Halting problem is an example for? decidable problem(N)

undecidable problem(Y)
 complete problem(N)

trackable problem(N)

Indicate How many conditions have to be met if an NP- 1(N)

complete problem is polynomially reducible?

2(Y)

3(N)

4(N)

Select the following class does a CNF-satisfiability problem NP class(N)

belong?

P class(N)

NP complete(Y)

NP hard(N)

Identify ,Which of the following problems is not NP complete? Hamiltonian circuit(N)

Bin packing(N)

Partition problem(N)

Halting problem(Y)

Apply the Rabin-Karp Algorithm to find the first occurrence of The first occurrence of "abc\" in
the pattern "abc" in the text "abcbabcbabccba". the text is at index 0(Y)

The first occurrence of "abc" in the

text is at index 2(N)
 The first occurrence of "abc" in the
text is at index 1(N)

The first occurrence of "abc" in the

text is at index 1 and 2(N)

Apply the Naïve String Matching Algorithm to find all Occurrences of "aba" in the text:
occurrences of the pattern "aba" in the text "abababab". (0, 2), (2, 4), (4, 6)(Y)

Occurrences of "aba" in the text:

(0, 1), (2, 1), (3, 1)(N)

Occurrences of "aba" in the text:

(0, 0), (2, 4), (4, 6)(N)

Occurrences of "aba" in the text:

(0, 2), (2, 1), (4, 6)(N)

Select the primary objective of string matching algorithms from The primary objective is to locate
the following options? occurrences of a pattern within a
text string.(Y)

The primary objective is to locate

first character of a pattern within a
text string.(N)

The primary objective is to locate

no of occurrences of a pattern
within a text of sub string.(N)

The primary objective is to locate

occurrences of a part of sub string
within a text string.(N)

Choose from the following the real life example of KMP text editors, search engines, and
algorithm DNA sequencing(Y)
Choose from the following the real life example of KMP
algorithm

it will work well when the size of

the alphabets increases.(N)

it will work well when the size of

the alphabets is not at all
concern(N)

it will work not well in string

matching(N)

Determine the worst case complexity of KMP algorithm O(m(n-m+1))(Y)

O((n-m+1))(N)

O(m(m+1))(N)

O(m(n-m))(N)

Identify which of the following algorithms is used to find the Push-Relabel algorithm(Y)
maximum flow in a network with capacities that can be
increased or decreased by a real number(Probable
duplicate)
Bellman-Ford algorithm(N)

Dijkstra’s algorithm(N)

Kruskal’s algorithm(N)

Identify which of the following algorithms is used to find the Dijkstra’s algorithm(N)
shortest path between two vertices in a graph with positive and
negative edgese

Floyd-Warshall algorithm(N)

Kruskal’s algorithm(N)

Bellman-Ford algorithm(Y)
Identify which of the following algorithms is used to find the Hopcroft-Karp algorithm(N)
maximum matching in a general graph

Prim’s algorithm(N)

Floyd-Warshall algorithm(N)

Dinic’s algorithm(Y)

Examine which of the following algorithms is used to find the Dijkstra’s algorithm(N)
bridges in an undirected graph

Hopcroft-Tarjan algorithm(N)

Bellman-Ford algorithm(N)

Tarjan’s algorithm(Y)

Identify which of the following algorithms is used to find the Push-Relabel algorithm(Y)
maximum flow in a network with capacities that can be
increased or decreased by a real number(Probable
duplicate)
Bellman-Ford algorithm(N)

Dijkstra’s algorithm(N)

Kruskal’s algorithm(N)

State down all the cases of master theorem.

State Recurrence relation with an example?

Define complexity of an algorithm, with an example?

Describe any three characteristics of an Algorithm?

Define Space Analysis, explain with an example?

How do we measure the correctness of an Algorithm?

Define Time Complexity ? explain with an example

State the differences between time complexity and space

complexity.

Analyze complexity of the recurrence relation T(n) = 4T(n/2)

+n2

Write the steps to sort using merge sort method: 5,3,8,1,4,6,2,7

Explain algorithm.

Analyze the result of the recurrences which fall under the first
case of Master’s theorem (let the recurrence be given by
T(n)=aT(n/b)+f(n) and f(n)=nc?

Compare dynamic programming and divide and conquer

approach

Discuss dynamic programming approach.

Discuss the criteria on which the measures of complexity

depend.

Explain the traveling salesman problem?

Write the basic characteristic of dynamic programming?

Explain the basic concept of divide & conquer algorithm.

Calculate the min and max term of the following array using
Divide and conquer approach {9,6,4,7,10,14,8,11}
Write the steps to solve the 4-queens problem by backtracking
method. For each step draw the 4x4 matrix showing the
positions of queens in it.

Explain the basic concept of divide & conquer algorithm

Explain the concept of divide & conquer algorithm with an
example.

Analyze how backtracking related with recursion

Analyze the steps involved for the 4-queen problem using

Backtracking

T(n) = 2T(n/2) + O(n) where n>0, T(n) = 1 where n = 0. Explain

the recurrence relation using substitution method
Write the algorithm of application of merge sort.

Define KMP algorithm.

Define Rabin-Karp algorithm

Write down the KMP Algorithm for String Matching Problem

and define the time complexity of it.

Discuss Substitution Method with an example?

Solve for the all pair of shortest path using Floyd’s Algorithm

Explain traveling salesman problem?

Compute the differences between Bellman Ford and Dijkstra
algorithm?

Describe maximum clique.

Describe NP Hard.

Describe NP Complete.

Define 3SAT.

Define complexity classes.

Define reducibility in the context of computational complexity?

Define the SAT problem?

Is Vertex Cover in NP-complete? Explain

Explain the Vertex Cover problem?

Explain independent set.

Explain Class P

Define K-center clustering problem?

Define hiring problem?

Define global minimum cut of a graph?

State minimum cut of a graph?

State set-covering problem related to vertex cover?

Justify approximation algorithm?

Explain graph traversal algorithm.

Identify the optimal parenthesization of a matrix chain product

whose sequence of dimensions is (5, 10, 3, 12, 5, 50, 6). Give an
algorithm of the above procedure. Analyze its complexity.

Explain knapsack problem, and their types.

Write the general Knapsack problem. Derive its time

complexity.

Examine the optimal solution using greedy criteria for Knapsack

having capacity 100 kg for the following list of items having
values and weights as shown in the table

Items I1 I2 I3 I
4 I5

Value 10 20 30 40 50
Weight 15 25 35 45 55
Summarize What is the main objective of approximation
algorithms in the context of the set-covering problem?

Illustarte advanced number theoretic Algorithm.

Explain Chinese Reminder Theorem

Illustrate advanced number theoretic Algorithm

Explain Fast Fourier theorem

Explain few applications of spanning trees with example

List the main limitation of the Naïve String Matching
Algorithm.

Explain the fundamental idea behind the Knuth-Morris-

Pratt (KMP) algorithm.

Differentiate between the Rabin-Karp Algorithm and the

Naïve String Matching Algorithm.
Compare and contrast the time complexity of the Naïve
String Matching Algorithm and the KMP algorithm.

Analyze the impact of pattern length on the performance

of the Rabin-Karp Algorithm.
Evaluate the significance of preprocessing in the KMP
algorithm and its effect on overall efficiency.

Examine the advantages and disadvantages of using the

Rabin-Karp Algorithm for multiple pattern searches
Design a pseudocode implementation for the Naïve
String Matching Algorithm.

Compare and contrast the time complexity of the Naïve

String Matching Algorithm and the Rabin-Karp Algorithm.

Explain why the Knuth-Morris-Pratt (KMP) algorithm is

more efficient than the Naïve String Matching Algorithm.
Differentiate between the Rabin-Karp Algorithm and the
Naïve String Matching Algorithm in terms of their
approach to pattern matching.

Critically judge the impact of text length and pattern

length on the performance of the Naïve String Matching
Algorithm.
Examine the way of application of the Naïve String
Matching Algorithm to find all occurrences of a pattern
within a given text string?

Describe a scenario where you would prefer to use the

Rabin-Karp Algorithm over the Naïve String Matching
Algorithm.

Write why the Naïve String Matching Algorithm called

"naïve"?
Explain the basic idea behind the Naïve String Matching
Algorithm?

Write the difference between 0/1 Knapsack and

Fractional Knapsack ?

Compare Floyd-Warshall and Ford-Fulkerson algorithms.

Describe the Flow Networks concept.

Differentiate between Push-Relabel and Cycle Cancelling

algorithms.
Discuss the concept of graph traversal techniques.

Distinguish between Maximum Flows and Minimum Cost

Flows.
Explain the Floyd-Warshall algorithm.
Express the idea of Ford-Fulkerson algorithm.
Illustrate the concept of Network Flows.
Select the appropriate algorithm for finding all pair
shortest paths in a weighted graph.
Show how the Ford-Fulkerson algorithm works.
Summarize the main idea behind the Push-Relabel
algorithm.
Compare the efficiency of Cycle Cancelling and Ford-
Fulkerson algorithms.
Describe the concept of Minimum Cost Flows.
Discuss the significance of Floyd-Warshall algorithm in
real-world applications.
Choose the appropriate algorithm for finding the
maximum flow in a network.
Compare Floyd-Warshall and Push-Relabel algorithms in
terms of their efficiency.
Decide between Ford-Fulkerson and Push-Relabel
algorithms for finding maximum flows.
Distinguish between Ford-Fulkerson and Cycle Cancelling
algorithms.

Define the difference between linear and binary search

with example

Define the different types of complexity of algorithms

and also define the criteria on which the measures of
complexity depends?

Define an algorithm with an example and state the

characteristics of the Algorithm.

Define the different stages of algorithm for solving a

problem with suitable example

Define recurrence relation using recursion tree method

Analyze all asymptotic notations with diagrams.

Analyze recursive and non-recursive method with proper
example

Analyze recurrence relation with Masters theorem.

Analyze Substitution method using suitable example

Analyze different types of recursion with proper

examples.

Explain divide and conquer method to find maximum and

minimum in a given array.
Explain backtracking technique using 4x4 N queen’s
problem.
Explain Huffman coding technique for data compression
with example.

Explain Matrix chain multiplication using dynamic

programming method
Explain Traveling salesman problem using Dynamic
programming method A is the Starting Node.

Compare greedy and dynamic programming techniques

in knapsack problems
Compare 0/1 knapsack problem with fractional knapsack
problem
Compare Brute Force Algorithm,Greedy technique and
dynamic programming method in solving traveling
salesman problem.
Compare Naive and KMP string matching techniques.

Discuss all pair shortest path using Floyd Warshall

Algorithm.

Discuss Network flows with example

Discuss maximum flow in a flow network with a graph

diagram

Discuss minimum cost flows with example

Discuss the usage of maximum flow and minimum flow

cost with example

Analyze Cycle Cancelling Algorithm with proper example

Analyze Maximum flows and minimum cost flows with
suitable problem

Analyze Push Relabel algorithm with proper example

Discuss how to find the complexity classes of an

algorithm

Discuss the features of different complexity classes

Discuss whether 3-SAT is NP-complete or not

Discuss Maximum clique in complexity class and also

state maximum size of a clique

Discuss reducibility in NP-completeness

Analyze vertex cover problem with suitable example

Analyze independent set in complexity classes

Analyze the difference between 3-SAT and SAT

techniques in complexity classes.

Define Approximation Algorithm

Define Randomized Algorithm

Evaluate the set covering problem using Greedy

Approximation method

How to evaluate k-center clustering algorithm

Evaluate the probabilistic analysis of the hiring problem

How to evaluate the Global Minimum Cut Problem

How to evaluate the Global Minimum Cut Problem

Evaluate vertex cover problem in approximation

algorithm with an example

Evaluate probabilistic analysis in design and analysis of

algorithm

Evaluate job hiring problem to implement randomization

technique

Discuss traveling salesman problem using dynamic

programming is NP complete or not

Discuss employee hiring problem in a company using

randomized algorithm

Solve to find the minimum number ofoperations required

for the following matrixchain multiplication using
dynamicprogramming and also find complexityA(10X30)
* B(30X50) * C(50X10) *D(10X90)

Solve for the all pair of shortest path using Floyd’s

Algorithm and also find complexity

Solve the following table using greedy method for

fractional Knapsack having capacity 60 kg for the
following list of items having values and weights as
shown in the table

Items I1 I2 I3 I4 I
5

Value 30 40 45 77 90
Weight 5 10 15 22 25
Solve the following to compress the data using Huffman
Coding The Characters are F,E,C,B,D,A having frequency
6,10,13,14,17,46 respectively

Define What is matroid? Illustrate any two greedy

algorithm techniques

Write an algorithm to compute maximum weight and

minimal independent set.
Write an algorithm to compute maximum weight and
minimal independent set.

Illustrate prims technique with an algorithm

Write an algorithm to find out the maximum matching in

graphs

Illustrate what is the augmenting path. How it is

computed with the Edmonds Blossom Algorithm

Explain a few applications of spanning trees with an

example

Illustrate any three graph applications with

algorithms.(Probable duplicate)

Discuss the difference between the following

a)Chromatic numbers in scheduling [6M] b)Directed
acyclic graphs in planning activities

Evaluate the Set-Covering problem in the context of

approximation algorithms with example.
Explain the concept of Vertex Cover in graph theory and
its relevance in approximation algorithms.
Analyze the hiring problem as a randomized algorithm.

Summarize the K-center clustering problem and

elaborate on its significance in data clustering and
approximation algorithms.

Evaluate the concept of finding the global Minimum Cut

in graph theory and algorithm design.

Discriminate the approaches used in approximation

algorithms for solving the Vertex Cover problem and the
K-center clustering problem.

Explain the following in detail a)Huffman coding and

compression b)Travelling salesperson problem

Illustrate any three graph applications with

algorithms.(Probable duplicate)

Illustrate Chromatic numbers in scheduling

Illustrate directed acyclic graphs in planning activities

Illustrate directed acyclic graphs in planning activities

Illustrate the Edmond-Karp maximum-flow algorithm

Illustrate matroid. Illustrate any two greedy algorithm

techniques

Explain interpolation problem in detail.

Illustrate polynomial multiplication and division

algorithms

Discuss any Randomized algorithms

Write in detail about Interior point Method

Apply the Knuth-Morris-Pratt (KMP) algorithm to find the

first occurrence of the pattern "aba" in the text
"ababababab". Provide a detailed explanation of the
algorithm's steps, including preprocessing, character
comparisons, and the determination of shifts.
Analyze the advantages and disadvantages of using the
Rabin-Karp Algorithm for multiple pattern searches
within a single text string. Discuss its efficiency, potential
challenges, and factors influencing its performance.
Apply the Naïve String Matching Algorithm to find all
occurrences of the pattern "aba" in the text "abababab".
Demonstrate the steps involved, including comparisons
made at each step and any shifts in the pattern.
Analyze the significance of preprocessing in the Knuth-
Morris-Pratt (KMP) algorithm and its impact on overall
efficiency. Discuss how preprocessing helps reduce
unnecessary comparisons and improves the algorithm's
performance.
Apply the Knuth-Morris-Pratt (KMP) algorithm to find all
occurrences of the pattern "aba" in the text
"ababababab". Illustrate the steps involved, including
preprocessing and character comparisons.
Analyze the impact of pattern length on the performance
of the Rabin-Karp Algorithm. Discuss how longer patterns
affect the efficiency of the algorithm and potential
challenges encountered.
Apply the Naïve String Matching Algorithm to find all
occurrences of the pattern "aba" in the text
"ababababab". Provide a step-by-step explanation of
your approach, including the comparisons made at each
step.
Analyze the efficiency of the Knuth-Morris-Pratt (KMP)
algorithm compared to the Naïve String Matching
Algorithm when searching for a pattern in a text. Provide
insights into why the KMP algorithm is more efficient and
discuss its time complexity.

Discuss important problem types that you face during

Algorithm Analysis.

Define is matroid. Illustrate any two greedy algorithm

techniques

Write an algorithm to find out maximum matching in

graphs

Write notes on augmenting path. How it is computed

with Edmonds Blossom Algorithm.

Illustrate few applications of spanning trees with

example

Illustrate Edmond-Karp maximum-flow algorithm

Illustarate LUP-Decomposition in detail

Illustarate LUP-Decomposition in detail

Write notes on pre-flow push maximum algorithm

Write notes on Bipatite matching problem

Describe the Floyd-Warshall algorithm.

Differentiate between Ford-Fulkerson and Push-Relabel.

Discuss the concept of flow networks.

Distinguish between Ford-Fulkerson and Cycle Cancelling

Explain the Ford-Fulkerson algorithm.

Express the concept of maximum flows.

Illustrate the Push-Relabel algorithm.

Select an appropriate algorithm for minimum cost flows.

Show the application of Floyd-Warshall algorithm.

Decide which algorithm is more suitable for finding the

minimum cost flow in a given network.
Distinguish between the Ford-Fulkerson algorithm and
the Push-Relabel algorithm.

Evaluate the significance of graph traversal techniques in

various applications.

Justify the use of the Floyd-Warshall algorithm over other

algorithms for certain problems.
Compare the computational complexity of the Ford-
Fulkerson algorithm with the Push-Relabel algorithm.

Judge the effectiveness of the Ford-Fulkerson algorithm

compared to the Push-Relabel algorithm for finding
maximum flows in flow networks.