0% found this document useful (0 votes)

5 views

Practice MCQs ST@

Uploaded by

SPARSH MITTAL

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

5 views

Practice MCQs ST@

Uploaded by

SPARSH MITTAL

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 168

Ques 1 Find the maximum sub-array sum for the given elements.

{-2, -1, -3, -4, -1, -2, -1, -5, -4}

-3
5
3
-1

Correct Answer : -1

Ques 2 You are given inﬁnite coins of denominaHons 1, 3, 4. What is the minimum number
of coins required to achieve a sum of 7?

1
2
3
4

Correct Answer : 2

Ques 3 You are given inﬁnite coins of denominaHons 3, 5, 7. Which of the following sum
CANNOT be achieved using these coins?

15
16
17
4

Correct Answer : 4

Ques 4 Find the maximum sub-array sum for the given elements.
{2, -1, 3, -4, 1, -2, -1, 5, -4}

3
5
8
6

Correct Answer : 5
Ques 5 You are given inﬁnite coins of denominaHons 1, 3, 4. What is the total number of
ways in which a sum of 7 can be achieved using these coins if the order of the coins is not
important?

4
3
5
6

Correct Answer : 5

Ques 6 You are given inﬁnite coins of denominaHons 5, 7, 9. Which of the following sum
CANNOT be achieved using these coins?

50
21
13
23

Correct Answer : 13

Ques 7 Which graph algorithm is used to ﬁnd the shortest path in a graph with both posiHve
and negaHve edge weights (but no negaHve weight cycles)?

Dijkstra’s Algorithm
Bellman-Ford Algorithm
Floyd-Warshall Algorithm
Prim’s Algorithm

Correct Answer : Bellman-Ford Algorithm

Ques 8 Which graph traversal algorithm guarantees ﬁnding the shortest path in an
unweighted graph?

Depth-First Search
Dijkstra’s Algorithm
Bellman-Ford Algorithm
Breadth-First Search
Correct Answer : Breadth-First Search

Ques 9 Which graph algorithm is used for ﬁnding the shortest path from a source node to all
other nodes in a graph with non-negaHve edge weights?

Kruskal's Algorithm
Dijkstra's Algorithm
Bellman-Ford Algorithm
Floyd-Warshall Algorithm

Correct Answer : Dijkstra's Algorithm

Ques 10 Which of the following is an opHmal algorithm for solving the "0/1 Knapsack"
problem using dynamic programming?

Depth-First Search
Dijkstra’s Algorithm
Dynamic Programming
Greedy Algorithm

Correct Answer : Dynamic Programming

Ques 11 Given the following Java pseudocode, what is being calculated?

java int ﬁb(int n) { if (n <= 1) return n; int prev = 0, curr = 1; for (int i = 2; i <= n; i++) { int next
= prev + curr; prev = curr; curr = next; } return curr; }

Factorial of n
Fibonacci number at posiHon n
Sum of the ﬁrst n numbers
Prime number at posiHon n

Correct Answer : Fibonacci number at posiHon n

Ques 12 Given the following pseudocode, what is the algorithm solving?

java int ﬁb(int n) { int dp[] = new int[n+1]; dp[0] = 0; dp[1] = 1; for (int i = 2; i <= n; i++) { dp[i]
= dp[i-1] + dp[i-2]; } return dp[n]; }

Factorial of n
Fibonacci number at posiHon n
Longest Common Subsequence
Matrix mulHplicaHon

Correct Answer : Fibonacci number at posiHon n

Ques 13 Which of the following problems can be solved by dynamic programming?

SorHng an array of numbers

Finding the shortest path in a weighted graph
Finding the largest prime factor of a number
Finding the number of ways to make change for a given amount

Correct Answer : Finding the number of ways to make change for a given amount

Ques 14 Which of the following is true for a biparHte graph?

All verHces are connected to each other.

It can be divided into two sets such that no two verHces within the same set are adjacent.
All verHces are connected in a cycle.
It has only one edge.

Correct Answer : It can be divided into two sets such that no two verHces within the same
set are adjacent.

Ques 15 Which of the following is TRUE about the Bellman-Ford algorithm for ﬁnding the
shortest path in a weighted graph?

It only works with graphs containing non-negaHve edge weights.

It can detect negaHve weight cycles in the graph.
It is faster than Dijkstra’s algorithm for all types of graphs.
It requires each node to be processed only once.

Correct Answer : It can detect negaHve weight cycles in the graph.

Ques 16 Which of the following is not a property of a minimum spanning tree (MST)?

It connects all the verHces in the graph.

It has the minimum possible weight sum.
It contains exactly V-1 edges, where V is the number of verHces.
It contains all the edges of the graph.

Correct Answer : It contains all the edges of the graph.

Ques 17 Which of the following is true about the Bellman-Ford algorithm?

It finds the shortest path in a graph with negaHve edge weights but without negaHve cycles.
It only works with undirected graphs.
It finds the shortest path from a source to only one vertex.
It uses a greedy approach to find the shortest path.

Correct Answer : It ﬁnds the shortest path in a graph with negaHve edge weights but
without negaHve cycles.

Ques 18 Which of the following statements is TRUE about the Floyd-Warshall algorithm for
ﬁnding shortest paths in a weighted graph?

It is only applicable to directed graphs without cycles.

It finds the shortest paths between all pairs of nodes and can handle negaHve edge weights,
but no negaHve cycles.
It only finds the shortest path from a single source to all other nodes.
It is more efficient than Dijkstra’s algorithm for all types of graphs.

Correct Answer : It ﬁnds the shortest paths between all pairs of nodes and can handle
negaHve edge weights, but no negaHve cycles.

Ques 19 Which of the following is true for dynamic programming?

It is typically used for problems with overlapping subproblems and opHmal substructure.
It guarantees an opHmal soluHon by greedy methods.
It uses recursion without memoizaHon.
It is always slower than brute force.

Correct Answer : It is typically used for problems with overlapping subproblems and opHmal
substructure.

Ques 20 Which of the following is true about the Floyd-Warshall algorithm?

It is used to ﬁnd the shortest path between two nodes in a graph.
It is used to ﬁnd the shortest paths between all pairs of nodes.
It is a greedy algorithm.
It only works with undirected graphs.

Correct Answer : It is used to ﬁnd the shortest paths between all pairs of nodes.

Ques 21 Which of the following is true about topological sorHng?

It can be applied only on directed graphs.

It is used to ﬁnd the minimum spanning tree of a graph.
It orders verHces such that for every directed edge uv, u appears before v.
It is applicable only on undirected graphs.

Correct Answer : It orders verHces such that for every directed edge uv, u appears before v.

Ques 22 Which algorithm can be used to ﬁnd the minimum spanning tree of a weighted
graph?

Dijkstra’s Algorithm
Bellman-Ford Algorithm
Kruskal’s Algorithm
Depth-First Search

Correct Answer : Kruskal’s Algorithm

Ques 23 What does the following pseudocode implement?

java int matrixChainOrder(int[] p) { int n = p.length - 1; int dp[][] = new int[n][n]; for (int len
= 2; len <= n; len++) { for (int i = 0; i < n - len + 1; i++) { int j = i + len - 1; dp[i][j] =
Integer.MAX_VALUE; for (int k = i; k < j; k++) { dp[i][j] = Math.min(dp[i][j], dp[i][k] + dp[k+1][j]
+ p[i]*p[k+1]*p[j+1]); } } } return dp[0][n-1]; }

Matrix chain mulHplicaHon problem

Longest Common Subsequence
Fibonacci sequence
Rod cuvng problem

Correct Answer : Matrix chain mulHplicaHon problem

Ques 24 What does the following pseudocode implement?
java int rodCuvng(int[] prices, int n) { int dp[] = new int[n+1]; for (int i = 1; i <= n; i++) { for
(int j = 1; j <= i; j++) { dp[i] = Math.max(dp[i], prices[j-1] + dp[i-j]); } } return dp[n]; }

Maximum proﬁt from cuvng a rod

Minimum cost to cut the rod
Maximum number of pieces that can be obtained from the rod
Longest rod cut

Correct Answer : Maximum proﬁt from cuvng a rod

Ques 25 What does the following pseudocode compute?

java int knapsack(int W, int wt[], int val[], int n) { int dp[][] = new int[n+1][W+1]; for (int i = 1;
i <= n; i++) { for (int w = 0; w <= W; w++) { if (wt[i-1] <= w) { dp[i][w] = Math.max(val[i-1] +
dp[i-1][w-wt[i-1]], dp[i-1][w]); } else { dp[i][w] = dp[i-1][w]; } } } return dp[n][W]; }

Maximum proﬁt that can be obtained from the knapsack problem

Maximum number of items that can be put in the knapsack
Longest Common Subsequence
Fibonacci sequence at posiHon n

Correct Answer : Maximum proﬁt that can be obtained from the knapsack problem

Ques 26 Which of the following pseudocode computes the maximum sum of a subarray in
an array of integers (also known as Kadane's Algorithm)?

Longest Common Subsequence

Longest Increasing Subsequence
Maximum Subarray Sum
0/1 Knapsack

Correct Answer : Maximum Subarray Sum

Ques 27 What is the Hme complexity of the Dijkstra algorithm when implemented using a
priority queue (binary heap)?

O(V^2)
O(E log V)
O(V log E)
O(V + E)
Correct Answer : O(E log V)

Ques 28 Which of the following is the Hme complexity of the Dijkstra's Algorithm using a
priority queue implemented with a binary heap?

O(V^2)
O(E log V)
O(V log E)
O(V + E)

Correct Answer : O(E log V)

Ques 29 What is the space complexity of the "Longest Common Subsequence" problem
when solved using dynamic programming with a 2D array?

O(1)
O(mn), where m and n are the lengths of the two strings
O(m)
O(n)

Correct Answer : O(mn), where m and n are the lengths of the two strings

Ques 30 What is the space complexity of the "Longest Common Subsequence" (LCS)
problem when solved using dynamic programming with a 2D table?

O(1)
O(n)
O(mn), where m and n are the lengths of the two strings
O(n^2)

Correct Answer : O(mn), where m and n are the lengths of the two strings

Ques 31 What is the Hme complexity of the following Java pseudocode that solves the "Rod
Cuvng" problem?

O(n)
O(n^2)
O(n * W)
O(n^3)

Correct Answer : O(n^2)

Ques 32 What is the Hme complexity of the Floyd-Warshall algorithm for ﬁnding all pairs
shortest paths in a graph with V verHces?

O(V^3)
O(V^2)
O(V^2 log V)
O(VE)

Correct Answer : O(V^3)

Ques 33 What is the space complexity of the "Floyd-Warshall" algorithm for ﬁnding all pairs
shortest paths in a graph with V verHces?

O(V^3)
O(V^2)
O(V log V)
O(E * log V)

Correct Answer : O(V^3)

Ques 34 What is the Hme complexity of the "Bellman-Ford" algorithm for ﬁnding the
shortest path in a graph with V verHces and E edges?

O(V^2)
O(E log V)
O(VE)
O(V + E)

Correct Answer : O(VE)

Ques 35 Which algorithm is used to ﬁnd the minimum spanning tree (MST) of a connected,
undirected graph with weighted edges?

Bellman-Ford Algorithm
Dijkstra's Algorithm
Prim's Algorithm
Floyd-Warshall Algorithm

Correct Answer : Prim's Algorithm

Ques 36 Which of the following is a valid use case for dynamic programming?

SorHng an array of numbers

Finding the maximum value of a set of independent subproblems
Solving problems with overlapping subproblems and opHmal substructure
Traversing a tree in pre-order

Correct Answer : Solving problems with overlapping subproblems and opHmal substructure

Ques 37 Which of the following is NOT a valid use case for dynamic programming?

Longest Increasing Subsequence

Rod Cuvng Problem
SorHng a list of numbers
Fibonacci Sequence

Correct Answer : SorHng a list of numbers

Ques 38 How is an adjacency list represented in a graph?

A matrix of size VxV

A dicHonary of lists
A list of edges
A boolean array

Correct Answer : A dicHonary of lists

Ques 39 What is the minimum spanning tree of a graph?

A tree with minimum depth

A tree with minimum weight
A tree with maximum edges
A spanning tree with negaHve cycles
Correct Answer : A tree with minimum weight

Ques 40 Which of the following real-world problems can BFS solve?

Social network connecHvity

Network ﬂow problems
DetecHng deadlocks
All of the above

Correct Answer : All of the above

Ques 41 What does Floyd-Warshall algorithm compute?

Single source shortest path

Minimum spanning tree
All pairs shortest paths
Topological order

Correct Answer : All pairs shortest paths

Ques 42 What assumpHon is made in Dijkstra’s algorithm for edge weights?

NegaHve weights are allowed

All weights must be non-negaHve
All weights must be integers
Edge weights must form a cycle-free graph

Correct Answer : All weights must be non-negaHve

Ques 43 Floyd-Warshall algorithm is typically used for:

Single source shortest path

All-pairs shortest path
Minimum spanning tree
Longest path in DAG

Correct Answer : All-pairs shortest path

Ques 44 What is the primary applicaHon of the Floyd-Warshall algorithm?

Single source shortest path

All-pairs shortest path
Minimum spanning tree
Longest path in DAG

Correct Answer : All-pairs shortest path

Ques 45 How is an edge list stored in memory?

As a list of (u, v) pairs

As a matrix of size VxV
As a binary tree
As a dicHonary of lists

Correct Answer : As a list of (u, v) pairs

Ques 46 How is an adjacency list stored in memory?

As a matrix
As a hash map
As an array of linked lists
As a binary tree

Correct Answer : As an array of linked lists

Ques 47 What is the primary advantage of KMP over brute force pazern matching?

Faster matching
Avoids redundant comparisons
Works with negaHve weights
Simpler implementaHon

Correct Answer : Avoids redundant comparisons

Ques 48 What is the key advantage of iteraHve DP (tabulaHon) over recursive DP
(memorizaHon)?

Uses recursion
Uses addiHonal memory
Avoids stack overﬂow
Reduces Hme complexity

Correct Answer : Avoids stack overﬂow

Ques 49 Which of the following is true about Bellman-Ford and Dijkstra's algorithms for
shortest path ﬁnding?

Bellman-Ford works only on posiHve weights, while Dijkstra's works on negaHve weights
Both work only for graphs with non-negaHve edge weights
Bellman-Ford can handle negaHve weights, while Dijkstra's cannot
Both can handle graphs with negaHve weights

Correct Answer : Bellman-Ford can handle negaHve weights, while Dijkstra's cannot

Ques 50 Which algorithm is best suited to ﬁnd the shortest path in a binary maze?

BFS
DFS
Dijkstra
Bellman-Ford

Correct Answer : BFS

Ques 51 Why is BFS preferred over DFS for shortest paths in an unweighted graph?

BFS explores deeper nodes ﬁrst

BFS uses a priority queue
BFS ensures minimum depth exploraHon
BFS avoids cycles

Correct Answer : BFS ensures minimum depth exploraHon

Ques 52 What is the purpose of memorizaHon in dynamic programming?

To store soluHons to subproblems
To avoid recalculaHng solved subproblems
To reduce space complexity
Both 1 and 2

Correct Answer : Both 1 and 2

Ques 53 What is the key diﬀerence between Greedy Algorithms and Dynamic Programming?

Greedy algorithms always guarantee opHmal soluHons

DP considers all possibiliHes
Greedy doesn’t consider future consequences
Both 2 and 3

Correct Answer : Both 2 and 3

Ques 54 Which of the following is/are property/properHes of a dynamic programming

problem?

OpHmal substructure
Overlapping subproblems
Greedy approach
Both opHmal substructure and overlapping subproblems

Correct Answer : Both opHmal substructure and overlapping subproblems

Ques 55 Which of the following is/are property/properHes of a dynamic programming

problem?

OpHmal substructure
Overlapping subproblems
Greedy approach
Both opHmal substructure and overlapping subproblems

Correct Answer : Both opHmal substructure and overlapping subproblems

Ques 56 Bellman-Ford algorithm can handle:

Only posiHve edges
Only negaHve edges
Both posiHve and negaHve edges
Only zero-weight edges

Correct Answer : Both posiHve and negaHve edges

Ques 57 In the context of Minimum Spanning Tree (MST), if two edges have the same
weight, what will happen?

Prim’s algorithm will always choose the ﬁrst one

Both Prim’s and Kruskal’s algorithms can choose any of the two edges
Kruskal’s algorithm will ignore one of the edges
The graph will no longer have an MST

Correct Answer : Both Prim’s and Kruskal’s algorithms can choose any of the two edges

Ques 58 What is the correct order to solve a DP problem using tabulaHon?

Bozom-up approach
Top-down approach
Randomized approach
Brute force

Correct Answer : Bozom-up approach

Ques 59 Which of the following best describes the main idea behind Dynamic Programming
(DP) when solving a problem?

RepeaHng recursive calls for each subproblem without storing results.

Breaking down a problem into overlapping subproblems and storing their soluHons to avoid
redundant calculaHons.
Breaking down a problem into completely independent subproblems that don’t interact.
Solving each subproblem sequenHally without any need for opHmizaHon.

Correct Answer : Breaking down a problem into overlapping subproblems and storing their
soluHons to avoid redundant calculaHons.
Ques 60 Which of the following best describes the tabulaHon approach in Dynamic
Programming?

Solving subproblems recursively and storing results to avoid duplicate work.

Building a soluHon iteraHvely by solving all smaller subproblems first and storing the results
in a table.
Solving subproblems in any order and backtracking to find the final answer.
CreaHng a table and filling it with pre-computed results before starHng the main algorithm.

Correct Answer : Building a soluHon iteraHvely by solving all smaller subproblems ﬁrst and
storing the results in a table.

Ques 61 How does Bellman-Ford algorithm detect a negaHve weight cycle?

By checking negaHve weights in the graph

By comparing weights a|er V iteraHons
By checking for relaxed edges in the V-th iteraHon
By calculaHng the minimum spanning tree

Correct Answer : By checking for relaxed edges in the V-th iteraHon

Ques 62 How does Floyd-Warshall detect negaHve weight cycles?

By checking the main diagonal of the matrix

By checking for unvisited verHces
By examining shortest paths
By running DFS a|er all iteraHons

Correct Answer : By checking the main diagonal of the matrix

Ques 63 How does the Floyd-Warshall algorithm detect negaHve weight cycles?

By detecHng zero-weight edges

By comparing distances
By looking at the diagonal of the distance matrix
By checking edge weights

Correct Answer : By looking at the diagonal of the distance matrix

Ques 64 In dynamic programming, what does memoizaHon refer to?

Storing intermediate results

IteraHve calculaHon
Recursive division
Caching subproblem soluHons

Correct Answer : Caching subproblem soluHons

Ques 65 How does Floyd-Warshall detect negaHve weight cycles?

Detects zero-weight edges

Compares diagonal values
Looks for negaHve distances
Checks adjacency matrix

Correct Answer : Compares diagonal values

Ques 66 When a top-down approach of dynamic programming is applied to a problem, it

usually _____________

Decreases both, the Hme complexity and the space complexity

Decreases the Hme complexity and increases the space complexity
Increases the Hme complexity and decreases the space complexity
Increases both, the Hme complexity and the space complexity

Correct Answer : Decreases the Hme complexity and increases the space complexity

Ques 67 Which of the following problems is not typically solved by dynamic programming?

Longest Increasing Subsequence

Matrix Chain MulHplicaHon
Depth-First Search
0/1 Knapsack Problem

Correct Answer : Depth-First Search

Ques 68 Which graph traversal algorithm is used for topological sorHng?

BFS
DFS
Dijkstra
Prim

Correct Answer : DFS

Ques 69 Which algorithm is preferred for shortest path in weighted graphs with non-
negaHve weights?

BFS
Bellman-Ford
Dijkstra
Floyd-Warshall

Correct Answer : Dijkstra

Ques 70 Which of the following algorithms is not used to ﬁnd an MST?

Dijkstra’s Algorithm
Prim’s Algorithm
Kruskal’s Algorithm
Borůvka’s Algorithm

Correct Answer : Dijkstra’s Algorithm

Ques 71 Which data structure is essenHal for implemenHng Kruskal’s algorithm eﬃciently?

Stack
Queue
Disjoint Set (Union-Find)
Heap

Correct Answer : Disjoint Set (Union-Find)

Ques 72 Which data structure is used to detect cycles in Kruskal’s algorithm?

Queue
Disjoint Sets
Priority Queue
Stack

Correct Answer : Disjoint Sets

Ques 73 If a problem can be solved by combining opHmal soluHons to non-overlapping

problems, the strategy is called _____________

Dynamic programming
Greedy
Divide and conquer
Recursion

Correct Answer : Divide and conquer

Ques 74 In the Longest Common Subsequence problem, which of the following approaches
is generally used?

Divide and conquer

Dynamic Programming
Breadth-First Search
Recursion

Correct Answer : Dynamic Programming

Ques 75 The Fibonacci sequence is a classic example of a problem that can be solved using:

Greedy algorithms
Dynamic programming
Backtracking
Branch and bound

Correct Answer : Dynamic programming

Ques 76 The 0/1 Knapsack problem is best solved using which technique?

Greedy Algorithms
Divide and Conquer
Dynamic Programming
Backtracking

Correct Answer : Dynamic Programming

Ques 77 Which technique is most suitable for solving the 0/1 Knapsack problem?

Greedy Algorithms
Divide and Conquer
Dynamic Programming
Backtracking

Correct Answer : Dynamic Programming

Ques 78 The Fibonacci sequence is an example of a problem solved using:

Dynamic programming
Greedy algorithms
Backtracking
Divide and Conquer

Correct Answer : Dynamic programming

Ques 79 Given a one-dimensional array of integers, you have to ﬁnd a sub-array with
maximum sum. This is the maximum sub-array sum problem. Which of these methods can
be used to solve the problem?

Dynamic programming
Two for loops (naive method)
Divide and conquer
Dynamic programming, naïve method and Divide and conquer methods

Correct Answer : Dynamic programming, naïve method and Divide and conquer methods

Ques 80 In the Z-value algorithm, which of the following statements correctly describes the
purpose of the Z-array for a given string?

Each entry in the Z-array stores the number of Hmes the string’s characters appear in
alphabeHcal order.
Each entry
𝑍[𝑖] in the Z-array stores the length of the longest substring starHng from 𝑖 that matches a
preﬁx of the string.
The Z-array values increase for posiHons where the characters are lexicographically larger
than the ﬁrst character of the string.
The Z-array is only used for strings that are palindromes.

Correct Answer : Each entry

𝑍[𝑖] in the Z-array stores the length of the longest substring starHng from 𝑖 that matches a
preﬁx of the string.

Ques 81 Which graph representaHon is more suitable for sparse graphs?

Adjacency matrix
Edge list
Adjacency list
Distance matrix

Correct Answer : Edge list

Ques 82 What is the diﬀerence between an edge list and an adjacency matrix?

Edge list uses less space than adjacency matrix

Adjacency matrix is more eﬃcient in searches
Edge list supports weighted graphs
Both 1 and 2

Correct Answer : Edge list uses less space than adjacency matrix

Ques 83 What is the characterisHc of BFS traversal?

Explores nodes layer by layer

Explores deeper nodes ﬁrst
Avoids cycles
Uses a stack

Correct Answer : Explores nodes layer by layer

Ques 84 What is the Hme complexity of the recursive implementaHon used to ﬁnd the nth
ﬁbonacci term?

O(1)
O(n2)
O(n!)
ExponenHal

Correct Answer : ExponenHal

Ques 85 Consider the recursive implementaHon to ﬁnd the nth ﬁbonacci number:

int ﬁbo(int n)
if n <= 1
return n
return __________

Which line would make the implementaHon complete?

fibo(n) + fibo(n)
fibo(n) + fibo(n – 1)
fibo(n – 1) + fibo(n + 1)
fibo(n – 1) + fibo(n – 2)

Correct Answer : ﬁbo(n – 1) + ﬁbo(n – 2)

Ques 86 Which of these is a classic example of an opHmizaHon problem solved using

dynamic programming?

Fibonacci sequence
Prim’s Algorithm
Shortest Path
Tower of Hanoi

Correct Answer : Fibonacci sequence

Ques 87 What is the primary applicaHon of Floyd-Warshall algorithm?

Finding MST
Finding all-pairs shortest paths
DetecHng negaHve cycles
Determining graph connecHvity

Correct Answer : Finding all-pairs shortest paths

Ques 88 Which of the following problems is NOT solved using dynamic programming?

0/1 knapsack problem

Matrix chain mulHplicaHon problem
Edit distance problem
FracHonal knapsack problem

Correct Answer : FracHonal knapsack problem

Ques 89 Kruskal’s algorithm is based on which approach?

Greedy approach
Dynamic programming
Backtracking
Divide and Conquer

Correct Answer : Greedy approach

Ques 90 What is the main advantage of Bellman-Ford over Dijkstra’s algorithm?

Handles negaHve weights

Faster
Simpler
Uses less memory

Correct Answer : Handles negaHve weights

Ques 91 When is an adjacency matrix more eﬃcient than an adjacency list?

In sparse graphs
In dense graphs
In unweighted graphs
In directed graphs

Correct Answer : In dense graphs

Ques 92 In Kruskal’s algorithm, how are edges sorted?

In decreasing order of weights

In increasing order of weights
Randomly
By the degree of endpoints

Correct Answer : In increasing order of weights

Ques 93 Which of the following statements is TRUE about Prim’s Algorithm for ﬁnding a
Minimum Spanning Tree (MST) in a connected, weighted graph?

It always starts with the edge of the minimum weight in the graph.
It grows the MST by selecHng the smallest edge that connects a node in the MST to a node
outside of it.
It only works with graphs that have unique edge weights.
It ﬁnds the shortest path between all pairs of nodes in the graph.

Correct Answer : It grows the MST by selecHng the smallest edge that connects a node in the
MST to a node outside of it.

Ques 94 What happens when a node is visited in DFS traversal?

It is marked as visited
It is pushed into the queue
It is revisited in cycles
All its neighbors are explored simultaneously

Correct Answer : It is marked as visited

Ques 95 How does Bellman-Ford handle negaHve weights?

It uses backtracking
It iteraHvely relaxes edges V-1 Hmes
It calculates all-pairs shortest paths
It discards negaHve cycles

Correct Answer : It iteraHvely relaxes edges V-1 Hmes

Ques 96 Which of the following statements is TRUE regarding Manacher’s Algorithm for
ﬁnding the longest palindromic substring in a string?

It works in
𝑂(𝑛^2) Hme by expanding around every possible center in the string.
It preprocesses the string by adding special characters to handle even-length palindromes
and achieves
𝑂(𝑛) Hme complexity.
It can only ﬁnd palindromic substrings of odd length.
The algorithm requires dynamic programming to store intermediate results.

Correct Answer : It preprocesses the string by adding special characters to handle even-
length palindromes and achieves
𝑂(𝑛) Hme complexity.

Ques 97 Which of the following statements is TRUE regarding topological sorHng in a

Directed Acyclic Graph (DAG)?

Topological sorHng can only be applied to undirected graphs.

It provides a linear ordering of nodes such that for every directed edge
𝑢→𝑣, u appears before 𝑣 in the ordering.
Topological sorHng works correctly even if the graph has cycles.
There is only one unique topological order for any given DAG.

Correct Answer : It provides a linear ordering of nodes such that for every directed edge
𝑢→𝑣, u appears before 𝑣 in the ordering.

Ques 98 In Dijkstra’s algorithm for ﬁnding the shortest path in a graph with non-negaHve
edge weights, which of the following statements is TRUE about how it selects the next node
to process?

It selects the node with the maximum edge weight connected to the start node.
It always processes nodes in the order they were added to the graph.
It selects the unvisited node with the smallest known distance from the starHng node.
It selects nodes randomly and updates distances accordingly.

Correct Answer : It selects the unvisited node with the smallest known distance from the
starHng node.
Ques 99 Why is Dijkstra’s algorithm eﬃcient for shortest paths in weighted graphs?

It only works for undirected graphs

It uses a priority queue
It can handle negaHve weights
It relaxes edges at each iteraHon

Correct Answer : It uses a priority queue

Ques 100 Why is Bellman-Ford preferred over Dijkstra in certain cases?

It is faster
It works with graphs having cycles
It works with negaHve weights
It does not use edge relaxaHon

Correct Answer : It works with negaHve weights

Ques 101 Which algorithm is eﬃcient for pazern matching with parHal matches?

Naive Algorithm
KMP Algorithm
Binary Search
Z-Algorithm

Correct Answer : KMP Algorithm

Ques 102 Which of the following problems is typically solved using dynamic programming?

Knapsack
SorHng
Binary Search
Maximum Flow

Correct Answer : Knapsack

Ques 103 Which dynamic programming problem aims to minimize the sum of selected
weights without exceeding a limit?

Fibonacci sequence
Subset Sum
Knapsack Problem
Minimum Spanning Tree

Correct Answer : Knapsack Problem

Ques 104 What does the Z-value array store in the Z-algorithm?

Lengths of suﬃxes matching the preﬁx of the string

Indices of matching substrings
Number of disHnct substrings
None of the above

Correct Answer : Lengths of suﬃxes matching the preﬁx of the string

Ques 105 Which of the following problems should be solved using dynamic programming?

Mergesort
Binary search
Longest common subsequence
Quicksort

Correct Answer : Longest common subsequence

Ques 106 Which of the following problems is typically solved using dynamic programming
due to subproblem overlap?

Longest common subsequence

Binary search
Quick Sort
Depth-ﬁrst search

Correct Answer : Longest common subsequence

Ques 107 What does the LPS array in KMP algorithm represent?

Longest Preﬁx Suﬃx

Longest Pazern Substring
Longest Preﬁx Match
None of the above

Correct Answer : Longest Preﬁx Suﬃx

Ques 108 Which of the following is NOT a valid representaHon of graphs?

Edge List
Adjacency Matrix
Adjacency List
Matrix Tree RepresentaHon

Correct Answer : Matrix Tree RepresentaHon

Ques 109 Which of the following is not a valid way to represent a graph?

Edge List
Adjacency Matrix
Adjacency List
Matrix Tree RepresentaHon

Correct Answer : Matrix Tree RepresentaHon

Ques 110 In dynamic programming, the technique of storing the previously calculated values
is called ___________

Saving value property

Storing value property
MemoizaHon
Mapping

Correct Answer : MemoizaHon

Ques 111 Consider the following code to find the nth fibonacci term using dynamic
programming:
1. int fibo(int n)
2. int fibo_terms[100000] //arr to store the fibonacci numbers
3. fibo_terms[0] = 0
4. fibo_terms[1] = 1
5.
6. for i: 2 to n
7. fibo_terms[i] = fibo_terms[i - 1] + fibo_terms[i - 2]
8.
9. return fibo_terms[n]
Which technique is used by line 7 of the above code?

OpHmal substructure
Overlapping subproblems
MemoizaHon
Greedy substructure

Correct Answer : MemoizaHon

Ques 112 Which of the following is true about a Minimum Spanning Tree (MST)?

MST always has the same weight as the shortest path tree
MST always includes all verHces of the graph
MST is unique for every graph
MST must be a directed acyclic graph

Correct Answer : MST always includes all verHces of the graph

Ques 113 In a complete graph with n verHces, how many edges are there in its minimum
spanning tree?

n
n-1
n+1
2n

Correct Answer : n - 1

Ques 114 In a Depth-First Search (DFS) traversal of a graph, which of the following
statements is TRUE about the order in which nodes are visited?
Nodes closer to the starHng node are always visited ﬁrst.
Nodes are visited in a recursive manner, going as deep as possible along each path before
backtracking.
Nodes with the highest degree are visited ﬁrst.
Nodes are visited in the reverse order of their addiHon to the graph.

Correct Answer : Nodes are visited in a recursive manner, going as deep as possible along
each path before backtracking.

Ques 115 When performing a Breadth-First Search (BFS) on an undirected graph from a
given starHng node, which of the following is TRUE about the order in which nodes are
visited?

Nodes are visited in the order they were added to the graph.
Nodes closer to the starHng node in terms of edge distance are visited earlier.
Nodes are visited based on their degree, with higher degree nodes visited ﬁrst.
Nodes are visited randomly regardless of their distance from the starHng node.

Correct Answer : Nodes closer to the starHng node in terms of edge distance are visited
earlier.

Ques 116 If a graph has negaHve edge weights, which algorithm cannot be used directly?

Prim’s Algorithm
Kruskal’s Algorithm
Borůvka’s Algorithm
None of the above

Correct Answer : None of the above

Ques 117 What is the Hme complexity of Dijkstra’s algorithm using a binary heap and
adjacency list?

O(V + E)
O((V + E) * log V)
O(V^2)
O(V^3)

Correct Answer : O((V + E) * log V)

Ques 118 What is the space complexity of the recursive implementaHon used to ﬁnd the nth
ﬁbonacci term?

O(1)
O(n)
On^2)
O(n^3)

Correct Answer : O(1)

Ques 119 What is the space complexity of the divide and conquer algorithm used to ﬁnd the
maximum sub-array sum?

O(n)
O(1)
O(n!)
O(n2)

Correct Answer : O(1)

Ques 120 What is the space complexity of the following for loop method used to compute
the nth ﬁbonacci term?

int ﬁbo(int n)
if n == 0
return 0
else
prevFib = 0
curFib = 1
for i : 1 to n-1
nextFib = prevFib + curFib
prevFib = curFib
curFib = nextFib
return curFib

O(1)
O(n)
O(n2)
ExponenHal

Correct Answer : O(1)

Ques 121 What is the Hme complexity to ﬁnd all neighbors of a node in an adjacency list?

O(1)
O(V)
O(E)
O(degree of the node)

Correct Answer : O(degree of the node)

Ques 122 What is the Hme complexity of Dijkstra’s Algorithm with a priority queue?

O(V^2)
O(E log V)
O(V log E)
O(E^2)

Correct Answer : O(E log V)

Ques 123 What is the Hme complexity of Kruskal’s algorithm using a union-ﬁnd data
structure?

O(E log V)
O(V log V)
O(E log E)
O(V^2)

Correct Answer : O(E log V)

Ques 124 The worst-case Hme complexity of the Knuth-Morris-Praz (KMP) algorithm is:

O(n^2)
O(n log n)
O(n)
O(n + m)

Correct Answer : O(n + m)

Ques 125 Which of the following best describes the KMP algorithm’s behavior on a pazern
with all unique characters?

O(n^2)
O(m) only
O(n + m)
None of the above

Correct Answer : O(n + m)

Ques 126 What is the Hme complexity of KMP string matching algorithm?

O(n^2)
O(n log n)
O(n + m)
O(nm)

Correct Answer : O(n + m)

Ques 127 What is the Hme complexity of the KMP string matching algorithm?

O(n^2)
O(n log n)
O(n + m)
O(nm)

Correct Answer : O(n + m)

Ques 128 In the Z-algorithm, what is the Hme complexity of compuHng the Z-values for a
string of length n?

O(n^2)
O(n log n)
O(n)
O(log n)

Correct Answer : O(n)

Ques 129 What is the Hme complexity of the following dynamic programming
implementaHon used to compute the nth ﬁbonacci term?

1. int fibo(int n)
2. int fibo_terms[100000] //arr to store the fibonacci numbers
3. fibo_terms[0] = 0
4. fibo_terms[1] = 1
5.
6. for i: 2 to n
7. fibo_terms[i] = fibo_terms[i - 1] + fibo_terms[i - 2]
8.
9. return fibo_terms[n]

O(1)
O(n)
On^2)
O(n^3)

Correct Answer : O(n)

Ques 130 What is the space complexity of the following dynamic programming
implementaHon used to compute the nth ﬁbonacci term?

int fibo(int n)
int fibo_terms[100000] //arr to store the fibonacci numbers
fibo_terms[0] = 0
fibo_terms[1] = 1

for i: 2 to n
fibo_terms[i] = fibo_terms[i - 1] + fibo_terms[i - 2]

return ﬁbo_terms[n]

O(1)
O(n)
On^2)
O(n^3)

Correct Answer : O(n)

Ques 131 What is the Hme complexity of the following for loop method used to compute the
nth ﬁbonacci term?
int ﬁbo(int n)
if n == 0
return 0
else
prevFib = 0
curFib = 1
for i : 1 to n-1
nextFib = prevFib + curFib
prevFib = curFib
curFib = nextFib
return curFib

O(1)
O(n)
O(n2)
ExponenHal

Correct Answer : O(n)

Ques 132 What is the Hme complexity of the following Java pseudocode that solves the
"Longest Common Subsequence" problem?
```java int lcs(String X, String Y) { int m = X.length(); int n = Y.length(); int dp[][] = new
int[m+1][n+1]; for (int i = 0; i <= m; i++) { for (int j = 0; j <= n; j++) { if (i == 0

o(n)
j == 0) { dp[i][j] = 0; } else if (X.charAt(i-1) == Y.charAt(j-1)) { dp[i][j] = dp[i-1][j-1] + 1; } else {
dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]); } } } return dp[m][n]; }```
O(n^2)
O(n * m), where n and m are the lengths of the two strings

Correct Answer : o(n)

Ques 133 What is the Hme complexity of solving Fibonacci using tabulaHon?

O(n)
O(log n)
O(2^n)
O(1)

Correct Answer : O(n)

Ques 134 What is the space complexity of an adjacency matrix in a graph with 'n' verHces?

O(n)
O(n^2)
O(n log n)
O(2^n)

Correct Answer : O(n^2)

Ques 135 What is the space complexity of an adjacency matrix for a graph with n verHces?

O(n)
O(n^2)
O(n log n)
O(2^n)

Correct Answer : O(n^2)

Ques 136 What is the space complexity of an adjacency matrix for a graph with n verHces?

O(n)
O(n^2)
O(n log n)
O(n^3)

Correct Answer : O(n^2)

Ques 137 What is the Hme complexity of the divide and conquer algorithm used to ﬁnd the
maximum sub-array sum?

O(n)
O(logn)
O(nlogn)
O(n2)

Correct Answer : O(nlogn)

Ques 138 What is the Hme complexity of solving the 0/1 Knapsack problem using dynamic
programming?

O(n)
O(nW)
O(2^n)
O(log n)

Correct Answer : O(nW)

Ques 139 What is the Hme complexity of the Bellman-Ford algorithm for V verHces and E
edges?

O(V^2)
O(V * E)
O(V + E)
O(V^3)

Correct Answer : O(V * E)

Ques 140 What is the space complexity of an adjacency list for a graph with V verHces and E
edges?

O(V + E)
O(V^2)
O(V log E)
O(VE)

Correct Answer : O(V + E)

Ques 141 What is the worst-case Hme complexity of BFS on a graph with V verHces and E
edges?

O(V)
O(V + E)
O(E^2)
O(V^2)

Correct Answer : O(V + E)

Ques 142 What is the space complexity of the Floyd-Warshall algorithm for a graph with V
verHces?

O(V)
O(V^2)
O(V + E)
O(V^3)

Correct Answer : O(V^2)

Ques 143 What is the Hme complexity of Prim’s algorithm using an adjacency matrix for V
verHces?

O(V^2)
O(V + E)
O((V + E) * log V)
O(V^3)

Correct Answer : O(V^2)

Ques 144 What is the space complexity of an adjacency matrix for a graph with V verHces?

O(V)
O(V^2)
O(E)
O(V + E)

Correct Answer : O(V^2)

Ques 145 What is the Hme complexity of Floyd-Warshall Algorithm for a graph with V
verHces?

O(VE)
O(V^2)
O(V^3)
O(E log V)

Correct Answer : O(V^3)

Ques 146 What is the Hme complexity of the Floyd-Warshall algorithm for a graph with 'V'
verHces?

O(VE)
O(V^2)
O(V^3)
O(E log V)

Correct Answer : O(V^3)

Ques 147 What is the Hme complexity of Floyd-Warshall algorithm for a graph with V
verHces?

O(VE)
O(V^2)
O(V^3)
O(E log V)

Correct Answer : O(V^3)

Ques 148 What is the space complexity of an adjacency list for a graph with V verHces and E
edges?

O(V^2)
O(V+E)
O(E log V)
O(V+E log V)

Correct Answer : O(V+E)

Ques 149 What is the space complexity of an adjacency list in a graph with V verHces and E
edges?

O(V^2)
O(V+E)
O(E log V)
O(V+E log V)

Correct Answer : O(V+E)

Ques 150 What is the Hme complexity of the Bellman-Ford algorithm for a graph with 'V'
verHces and 'E' edges?

O(V+E)
O(VE)
O(E log V)
O(V^2)

Correct Answer : O(VE)

Ques 151 What is the Hme complexity of Bellman-Ford algorithm in a graph with V verHces
and E edges?

O(V+E)
O(VE)
O(E log V)
O(V^2)

Correct Answer : O(VE)

Ques 152 What is the Hme complexity of the Bellman-Ford algorithm for a graph with V
verHces and E edges?

O(VE)
O(V^2)
O(E log V)
O(V + E)

Correct Answer : O(VE)

Ques 153 If an opHmal soluHon can be created for a problem by construcHng opHmal
soluHons for its subproblems, the problem possesses ____________ property.

Overlapping subproblems
OpHmal substructure
MemoizaHon
Greedy
Correct Answer : OpHmal substructure

Ques 154 Consider the following code to ﬁnd the nth ﬁbonacci term using dynamic
programming:

Which property is shown by line 7 of the above code?

OpHmal substructure
Overlapping subproblems
Both overlapping subproblems and opHmal substructure
Greedy substructure

Correct Answer : OpHmal substructure

Ques 155 Consider the following code snippet. Which property is shown by line 4 of the
below code snippet?

1. int sum[len], idx;

2. sum[0] = arr[0];
3. for(idx = 1; idx < len; idx++)
4. sum[idx] = max(sum[idx - 1] + arr[idx], arr[idx]);
5. int mx = sum[0];
6. for(idx = 0; idx < len; idx++)
7. if(sum[idx] > mx)
8. mx =sum[idx];
9. return mx;

OpHmal substructure
Overlapping subproblems
MemoizaHon
Greedy substructure
Correct Answer : OpHmal substructure

Ques 156 In dynamic programming, which property ensures that the soluHon to a problem
can be constructed eﬃciently from soluHons of smaller subproblems?

Greedy choice property

Overlapping subproblems
OpHmal substructure
Divide and conquer

Correct Answer : OpHmal substructure

Ques 157 What is the key property that allows dynamic programming soluHons to work
eﬃciently?

OpHmal Substructure
Greedy Choice Property
No overlapping subproblems
Independent decisions

Correct Answer : OpHmal Substructure

Ques 158 What key feature makes dynamic programming algorithms perform eﬃciently?

OpHmal Substructure
Greedy Choice Property
No overlapping subproblems
Independent decisions

Correct Answer : OpHmal Substructure

Ques 159 If an opHmal soluHon can be created for a problem by construcHng opHmal
soluHons for its subproblems, the problem possesses ____________ property.

Overlapping subproblems
OpHmal substructure
MemoizaHon
Greedy
Correct Answer : OpHmal substructure

Ques 160 What is the core idea behind dynamic programming?

Divide and Conquer

Recursive Backtracking
OpHmal Substructure and Overlapping Subproblems
MemoizaHon and TabulaHon

Correct Answer : OpHmal Substructure and Overlapping Subproblems

Ques 161 If a problem can be broken into subproblems which are reused several Hmes, the
problem possesses ____________ property.

Overlapping subproblems
OpHmal substructure
MemoizaHon
Greedy

Correct Answer : Overlapping subproblems

Ques 162 Suppose we ﬁnd the 8th term using the recursive implementaHon. The arguments
passed to the funcHon calls will be as follows:

fibonacci(8)
fibonacci(7) + fibonacci(6)
fibonacci(6) + fibonacci(5) + fibonacci(5) + fibonacci(4)
fibonacci(5) + fibonacci(4) + fibonacci(4) + fibonacci(3) + fibonacci(4)
+ fibonacci(3) + fibonacci(3) + fibonacci(2)
:
:
:
Which property is shown by the above funcHon calls?

Overlapping subproblems
OpHmal substructure
MemoizaHon
Greedy

Correct Answer : Overlapping subproblems

Ques 163 Which two properHes are essenHal for applying dynamic programming?

Greedy and Divide and Conquer

Overlapping Subproblems and OpHmal Substructure
OpHmal Substructure and Greedy
Divide and Conquer and MemoizaHon

Correct Answer : Overlapping Subproblems and OpHmal Substructure

Ques 164 Which array is essenHal in the KMP algorithm?

Z-array
Prefix-suffix (LPS) array
Suffix array
None of the above

Correct Answer : Preﬁx-suﬃx (LPS) array

Ques 165 Consider the following code to ﬁnd the nth ﬁbonacci term:

int ﬁbo(int n)
if n == 0
return 0
else
prevFib = 0
curFib = 1
for i : 1 to n-1
nextFib = prevFib + curFib
__________
__________
return curFib
Complete the above code.

prevFib = curFib
curFib = curFib
prevFib = nextFib
curFib = prevFib
prevFib = curFib
curFib = nextFib
prevFib = nextFib
nextFib = curFib

Correct Answer : prevFib = curFib

curFib = nextFib

Ques 166 What is the primary diﬀerence between Prim’s and Kruskal’s algorithms for ﬁnding
a minimum spanning tree?

Prim’s works only on dense graphs

Kruskal’s requires the graph to be directed
Prim’s builds the tree one node at a Hme, while Kruskal’s builds it by edges
None of the above

Correct Answer : Prim’s builds the tree one node at a Hme, while Kruskal’s builds it by edges

Ques 167 What is the primary diﬀerence between Prim’s and Kruskal’s algorithms?

Prim’s uses adjacency list

Kruskal’s uses adjacency matrix
Prim’s grows a tree
Kruskal’s grows a forest

Correct Answer : Prim’s grows a tree

Ques 168 In Prim’s algorithm, which data structure is o|en used to select the minimum
weight edge?

Disjoint Set
Priority Queue
Stack
Queue

Correct Answer : Priority Queue

Ques 169 What core feature do problems suitable for dynamic programming share?

Problems with overlapping subproblems

Problems with no dependencies
Problems with simple recursion
Problems with greedy choices

Correct Answer : Problems with overlapping subproblems

Ques 170 What is the key characterisHc of problems solved by dynamic programming?

Problems with overlapping subproblems

Problems with no dependencies
Problems with simple recursion
Problems with greedy choices

Correct Answer : Problems with overlapping subproblems

Ques 171 Which data structure is commonly used for BFS traversal?

Stack
Queue
Priority Queue
Set

Correct Answer : Queue

Ques 172 The following sequence is a ﬁbonacci sequence:

0, 1, 1, 2, 3, 5, 8, 13, 21,…..
Which technique can be used to get the nth ﬁbonacci term?

Recursion
Dynamic programming
A single for loop
Recursion, Dynamic Programming, For loops

Correct Answer : Recursion, Dynamic Programming, For loops

Ques 173 What is the key advantage of the KMP algorithm over brute force pazern
matching?

Reduces redundant comparisons

Faster on average
Uses less space
Works with negaHve weights

Correct Answer : Reduces redundant comparisons

Ques 174 What is a real-world applicaHon of Minimum Spanning Trees?

RouHng network connecHons

DetecHng deadlocks
Solving shortest paths
Pathﬁnding in mazes

Correct Answer : RouHng network connecHons

Ques 175 Which of the following cannot be solved using BFS in a binary maze?

Finding shortest path

CounHng number of paths
DetecHng unreachable areas
Solving weighted path problems

Correct Answer : Solving weighted path problems

Ques 176 What is the key preprocessing step in Kruskal’s algorithm?

Relaxing edges
SorHng edges by weight
Traversing verHces
CalculaHng shortest path

Correct Answer : SorHng edges by weight

Ques 177 Which data structure is commonly used for DFS traversal?

Stack
Queue
Priority Queue
Hash Map

Correct Answer : Stack

Ques 178 What is the key concept of Prim’s algorithm for ﬁnding MST?

Start from an arbitrary vertex

Select minimum weight edge
Relax all edges at once
Traverse all verHces

Correct Answer : Start from an arbitrary vertex

Ques 179 In the KMP algorithm, what is the purpose of the preﬁx table (pi-table)?

Track mismatches
Record shi|s in pazern
Store pazern frequencies
Store longest preﬁx-suﬃx match

Correct Answer : Store longest preﬁx-suﬃx match

Ques 180 In the KMP algorithm, the purpose of the LPS array is to:

Store longest suﬃxes of substrings

Store the longest preﬁx which is also a suﬃx
Track visited indices
Match the pazern in reverse order

Correct Answer : Store the longest preﬁx which is also a suﬃx

Ques 181 Which approach to solving the Fibonacci problem uses tabulaHon?

Recursion
Storing soluHons in a table iteraHvely
Backtracking
Greedy approach

Correct Answer : Storing soluHons in a table iteraHvely

Ques 182 In dynamic programming, what is “memoizaHon”?

Dividing the problem into subproblems

Storing soluHons of subproblems to avoid recomputaHon
A technique to opHmize graph traversal
None of the above

Correct Answer : Storing soluHons of subproblems to avoid recomputaHon

Ques 183 What is the core feature of problems solved by dynamic programming?

Greedy property
Subproblem overlap
Divide and conquer
Random selecHon

Correct Answer : Subproblem overlap

Ques 184 For an undirected graph, how is the adjacency matrix represented?

Symmetrical
Asymmetrical
Diagonal
Random

Correct Answer : Symmetrical

Ques 185 How is the adjacency matrix represented for an undirected graph?

Symmetrical
Asymmetrical
Diagonal
Random

Correct Answer : Symmetrical

Ques 186 How does tabulaHon diﬀer from memorizaHon?

TabulaHon uses recursion
TabulaHon solves subproblems iteraHvely
TabulaHon uses addiHonal memory
TabulaHon does not require problem overlap

Correct Answer : TabulaHon solves subproblems iteraHvely

Ques 187 In Kruskal’s Algorithm for ﬁnding a Minimum Spanning Tree (MST), which of the
following is TRUE about how edges are processed to ensure that cycles are avoided in the
MST?

Edges are added to the MST in the order they appear in the graph’s adjacency list.
The algorithm uses a union-ﬁnd (disjoint-set) data structure to detect and prevent cycles by
tracking connected components of nodes.
It relies on a breadth-ﬁrst search (BFS) to avoid cycles while adding edges.
It only works on graphs with unique edge weights to ensure no cycles are formed.

Correct Answer : The algorithm uses a union-ﬁnd (disjoint-set) data structure to detect and
prevent cycles by tracking connected components of nodes.

Ques 188 What is the condiHon to move to the next cell in a binary maze shortest path
problem?

The cell is visited

The cell is unvisited and open
The cell is visited and closed
The cell is blocked

Correct Answer : The cell is unvisited and open

Ques 189 What does the priority queue store in Dijkstra’s algorithm?

Only the source vertex

The current shortest distances
All edges
All verHces

Correct Answer : The current shortest distances

Ques 190 What happens when you relax an edge in the Bellman-Ford algorithm?

The edge is removed

The vertex is marked as visited
The distance to the vertex is updated
The edge weight is modiﬁed

Correct Answer : The distance to the vertex is updated

Ques 191 In a Directed Acyclic Graph (DAG), which of the following statements about
topological sorHng is CORRECT in terms of the number of possible topological orders?

A unique topological order exists for any DAG

The number of possible topological orderings is always equal to the number of verHces in
the DAG.
The number of topological orderings depends on the presence of verHces with no incoming
or outgoing edges.
The number of possible topological orderings depends on the structure of the DAG, with
more than one order possible when mulHple verHces share dependencies.

Correct Answer : The number of possible topological orderings depends on the structure of
the DAG, with more than one order possible when mulHple verHces share dependencies.

Ques 192 In the KMP (Knuth-Morris-Praz) algorithm, which of the following statements is
TRUE about the construcHon and use of the preﬁx funcHon (or LPS array)?

The prefix funcHon records the longest proper prefix of the pazern that is also a suffix,
helping avoid unnecessary comparisons.
The prefix funcHon stores the number of occurrences of each character in the pazern.
The prefix funcHon is recalculated from scratch each Hme a mismatch occurs.
The prefix funcHon is only needed if the pazern contains repeaHng characters.

Correct Answer : The prefix funcHon records the longest proper prefix of the pazern that is
also a suffix, helping avoid unnecessary comparisons.

Ques 193 In Dynamic Programming, what is the primary purpose of using memoizaHon?

To avoid recalculaHng soluHons to the same subproblems by storing their results.

To ensure that all subproblems are recalculated every Hme they are needed.
To improve space complexity by storing all results in an array.
To break down problems into enHrely independent subproblems.
Correct Answer : To avoid recalculaHng soluHons to the same subproblems by storing their
results.

Ques 194 What is the purpose of a queue in BFS?

To explore deeper levels

To maintain the order of node traversal
To detect cycles
To opHmize space usage

Correct Answer : To maintain the order of node traversal

Ques 195 What is the purpose of the preﬁx table (pi-table) in the KMP algorithm?

To store the matches found

To reduce redundant comparisons
To count the number of occurrences
To avoid backtracking

Correct Answer : To reduce redundant comparisons

Ques 196 What role does the preﬁx table (pi-table) play in the KMP algorithm?

To store the matches found

To reduce redundant comparisons
To count the number of occurrences
To avoid backtracking

Correct Answer : To reduce redundant comparisons

Ques 197 Which of the following is NOT a valid applicaHon of BFS?

Shortest path in unweighted graph

Checking biparHteness
Topological sorHng
Finding connected components

Correct Answer : Topological sorHng

Ques 198 What does a Minimum Spanning Tree (MST) minimize?

Number of verHces
Number of edges
Total edge weight
Maximum degree of verHces

Correct Answer : Total edge weight

Ques 199 What is the role of a disjoint set in Kruskal’s algorithm?

Sort edges by weight

Track connected components
Find minimum edge
Avoid negaHve cycles

Correct Answer : Track connected components

Ques 200 Which of the following problems can be solved by applying dynamic programming
with overlapping subproblems and opHmal substructure properHes?

Traveling Salesman Problem

Depth-First Search
Breadth-First Search
Cycle DetecHon in Graphs

Correct Answer : Traveling Salesman Problem

Ques 201 What data structure is essenHal for implemenHng Kruskal’s algorithm eﬃciently?

Binary Heap
Union-Find
Stack
Queue

Correct Answer : Union-Find

Ques 202 Which data structure is crucial for eﬃciently implemenHng Kruskal’s algorithm?

Binary Heap
Union-Find
Stack
Queue

Correct Answer : Union-Find

Ques 203 What does edge relaxaHon mean in Bellman-Ford algorithm?

AdjusHng edge weights

UpdaHng distances for adjacent nodes
Finding cycles in a graph
Adding new edges

Correct Answer : UpdaHng distances for adjacent nodes

Ques 204 How many Hmes are the edges relaxed in Bellman-Ford algorithm in a graph with
V verHces?

V
V-1
V+1
E

Correct Answer : V-1

Ques 205 In a graph with 'V' verHces, how many Hmes are the edges relaxed in the Bellman-
Ford algorithm?

V
V-1
V+1
E

Correct Answer : V-1

Ques 206 In the Bellman-Ford algorithm, how many Hmes are the edges relaxed for a graph
with V verHces?

V
V-1
V+1
E

Correct Answer : V-1

Ques 207 What is the main advantage of Floyd-Warshall algorithm over Dijkstra's algorithm?

Works for all pair shortest paths

Faster in all cases
Simpler to implement
Handles negaHve weights

Correct Answer : Works for all pair shortest paths

Ques 208 What is the main advantage of the Floyd-Warshall algorithm over Dijkstra’s
algorithm?

Faster execuHon
Works for negaHve weight cycles
Simpler implementaHon
Works on undirected graphs

Correct Answer : Works for negaHve weight cycles

Ques 209 What is the primary advantage of Floyd-Warshall Algorithm over Dijkstra’s
Algorithm?

Faster execuHon
Works for negaHve weight cycles
Simpler implementaHon
Works on undirected graphs

Correct Answer : Works for negaHve weight cycles

Ques 210 What is the key advantage of Bellman-Ford over Dijkstra’s algorithm?

Simpler implementaHon
Works with negaHve weights
Faster for dense graphs
Requires fewer iteraHons

Correct Answer : Works with negaHve weights

Ques 211 What is the main advantage of the Bellman-Ford algorithm over Dijkstra’s
algorithm?

Simpler implementaHon
Works with negaHve weights
Faster for dense graphs
Requires fewer iteraHons