Question Bank

Subject Code:PCCCS404
CO Distribution Analysis At A Glance
C.O. Type C.O. Total In-Percentage
CO1 24 18.60
CO2 39 30.23
CO3 45 34.88
CO4 21 16.28

Marks wise total no of CO Distribution, Total No of Question: 129

C.O. Type Marks:2 Marks:5 Marks:10
CO1 13 6 5
CO2 19 15 5
CO3 23 12 10
CO4 10 6 5

Page 1 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11
 p1-(55-255)
Modul
Sl.No. Question Marks CO BL
e
Find the running time of the following program:
function(int n){
55 for(int i=1; i<=n; i++) 5 2 CO1 BL1
for(int j=1; j<=n; j*=2)
printf(“*”);
}
56 Is 2n+1 = O(2n)? Justify your answer. 5 2 CO1 BL1
Find the time complexity of the following recurrence
58 relation, using the Recursion Tree method: 10 1 CO1 BL2
T (n) = 3T (n/2) + n log n
Define recursion tree with an example. State the
80 differences of Divide and Conquer with Dynamic 5 2 CO3 BL3
Programming?
Demonstrate the basic characteristics of dynamic
118 2 3 CO3 BL3
programming.
What exactly do you mean by dynamic programming
120 2 3 CO3 BL3
memorization?
Which approach should we consider when choosing
between the top-down approach and the bottom-up
123 5 3 CO3 BL3
approach solutions for the same problem? Explain with
an example.
Show how the dynamic programming approach can be
124 5 3 CO3 BL4
used to resolve matrix chain multiplication problems.
With an example explain Optimal Substructures
125 5 3 CO3 BL3
and Overlapping Subproblems characteristics.
Discuss the steps to get the minimum cost value for
the following matrices under matrix chain multiplication
126 10 3 CO3 BL3
using dynamic programming. The matrices have size
2x3, 3x4, 4x5, and 5x7.
Use the fundamental principle of Floyd-Warshall’s
127 algorithm to find the shortest path from node 2 to node 10 3 CO3 BL3
4 for the following graph.
153 What was the first problem proved as NP complete? 2 4 CO4 BL1
“P class belongs to NP class” – explain it with an
154 2 4 CO4 BL2
example.
164 Prove that 3-CNF SAT problem is NP Hard. 10 4 CO4 BL4
167 Prove that 3-CNF SAT problem is NP. 5 4 CO4 BL4
Prove that 2-CNF SAT problem is polynomial time
170 5 4 CO4 BL4
solvable.
Sort the following according to their asymptotic
195 complexity (in non-decreasing order) 2 1 CO1 BL1
n1/2 , log n , 100n , 50n + 2n , 5n2 + 7n log n + 10100
Write the algorithm for detecting cycle in an undirected
206 5 3 CO3 BL3
graph using BFS with the help of an example graph.
Write divide and conquer algorithm for matrix
207 5 2 CO3 BL3
multiplication.
253 Discuss the limitations of the Bellman-Ford algorithm. 2 3 CO3 BL2
Describe the kinds of issues that dynamic
254 2 3 CO3 BL2
programming can help us address.
Page 2 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11
 255 Solve Traveling Salesman Problem using DP strategy. 5 3 CO3 BL3
Write the differences between feasible solutions and
256 2 3 CO3 BL2
optimal solutions.
2 257 State the differences between 0/1 knapsack and
2 3 CO3 BL2
greedy knapsack with examples.
marks
258
When will a recurrence relation fall into Case 2 of
2 1 CO1 BL2
Master Theorem?
Write down the differences between feasible solutions
259 2 1 CO1 BL2
and optimal solutions.
260 Mention the steps of the Recursion tree method. 2 1 CO1 BL2
What is least cost branch and bound? Solve the below
0/1 Knapsack problem using least cost branch and
bound technique. M=15 Kg. Also show the state-space
tree.
261 Item Pi Wi 10 4 CO3 BL3
1 10 2 p2-(261-266)
2 10 4
3 12 6
4 18 9
Why Dijkstra’s algorithm fails with negative edge
weight? Explain with an example. How Bellman Ford
262 10 3 CO3 BL3
algorithm overcome this disadvantage of Dijkstra’s
shortest path algorithm? Explain with an example.
Describe the advantages of branch and bound over
264 brack tracking. How a maximization problem is solved 5 4 CO4 BL4
using branch and bound?
What is bounding function in the context of branch and
265 bound algorithm? Explain the bounding functions used 5 4 CO4 BL4
in solving 15-puzzle problem using branch and bound?
Describe Floyd-Warshall algorithm and derive its time
266 5 3 CO3 BL3
complexity.
267 Explain LIFO branch and bound. 2 4 CO3 BL3
Derive the time complexity of Bellman-Ford algorithm
268 2 3 CO4 BL4
in case of complete graph.
What is the time complexity of the knapsack problem using
269 branch and bound?
2 4 CO4 BL2

2 270
How Branch and bound approach differs from
backtracking?
2 4 CO4 BL2
marks
When Bellman-Ford algorithm outperforms over
271 2 4 CO3 BL2
Dijkstra algorithm?
Which algorithmic approach is used in Floyd- Warshall
272 2 3 CO2 BL1
algorithm?
Write down the pseudocode to compute the shortest
273 2 3 CO4 BL1
path in the Dijkstra algorithm.
What is the time complexity of the Bellman-Ford
274 2 3 CO2 BL1
algorithm?
Can we solve the all pair shortest path problem using
275 2 3 CO3 BL4
the Dijkstr algorithm? Justify your answer.
How Dijkstra algorithm outperforms the Bellman-Ford
276 2 3 CO3 BL3
algorithm?
Page 3 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11
 Illustrate the problem of graph coloring with a suitable
277 2 3 CO3 BL2
example.
How can the Graph Coloring problem be applied to
278 2 3 CO3 BL4
real-world scenarios?
2 How can the N-Queens problem be extended to a
marks279 generalized version with different board sizes and 2 3 CO3 BL4
numbers of queens?
Write down the time complexity for the Subset Sum
280 2 3 CO3 BL2
problem using backtracking.
Write down some real-life application of fractional
281 2 3 CO3 BL2
knapsack problem.
282 State the Max Flow Min cut theorem for network flow. 2 4 CO4 BL2
283 Write down a few applications on network flow. 2 4 CO4 BL4
What do you mean by in-flow and out-flow for a node in
284 2 4 CO4 BL3
a flow network?
What do you mean by capacity of the flow
285 network? Can the flow through an edge be greater 2 4 CO4 BL3
than its capacity?
Using the dynamic programming approach, find
whether a solution exists or not to the Subset Sum
286 Problem for the set of integers {2, 3, 7, 8, 10} and a 10 3 CO3 BL5
target sum of 14. Show your work step by step and
explain the time complexity of your algorithm.
Calculate the maximum flow between the source and
the sink in the given below graph using the Folk-
Fulkerson algorithm p3-(286-293)

287 10 3 CO3 BL4

Write an algorithm that implements the backtracking

algorithm for the Subset Sum problem, and use it to
288 5 3 CO3 BL3
find a subset that adds up to a target sum for a given
input set.
Explain with an example how network flow is used to
289 5 4 CO4 BL4
solve bipartite matching.
Present a backtracking algorithm to solve the n-queen
290 problem and apply it to solve the 4-queen problem. 5 3 CO3 BL4
Show the intermediate steps.
Give an example to show a greedy graph coloring
291 2 3 CO3 BL2
algorithm dose not always provide the optimal solution.
292 Analyze the complexity of Ford-Fulkerson algorithm. 5 4 CO4 BL3
To solve the Tower of Hanoi problem, create a
293 2 1 CO1 BL2
recursive function.

Page 4 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11
 for(int i=0;i<=n;i++)

294 i*=k; 2 1 CO1 BL2

Find the time complexity using Big-oh notation.

2 295 Define Omega-notation. 2 1 CO1 BL2
Express the following function in terms of the Big-O
marks notation.
296 2 1 CO1 BL2
g(n) = log2 n + n
Find the time complexity of the following recurrence
297 relation: 2 1 CO1 BL2
T (n) = 2T(n/2) + n
298 Find the lower bound for f(n) = 5n^2. 2 1 CO1 BL2
299 Write down the advantages of the Master Theorem. 2 1 CO1 BL2
What is the minimum possible value of the input size in
300 2 1 CO1 BL2
the deepest level of a recursion tree?
Sort the following according to their asymptotic
complexity (in non-decreasing order)
301 2 1 CO1 BL2
n^1/2, log n, 100n, 50n + 2^n, 5n^2 + 7n log n +
10^100
Consider a program whose worst-case time complexity
302 is f(n) = n[1 + 1/2 + 1/3 +.....+ 1/n]. Prove that f(n) is 5 1 CO1 BL2
O(n log n).
303 Justify n! = O(n^n). 5 1 CO1 BL2
Find out the time complexity of the binary search
304 5 1 CO1 BL2
algorithm, using the Recursion Tree method.
Find the time complexity for the following recurrence,
305 using Master Theorem: 5 1 CO1 BL2
T(n) = T(2n/3) + 1
Find the time complexity of the following recurrence
306 relations using the Recursion Tree method: 10 1 CO1 BL2
T (n) = 3T ( n/4 ) + O(n^2).
Find the asymptotic upper bound of the following
recurrence relation with the help of the Recursion Tree
307 method: 10 1 CO1 BL2

T(n) = T(n/4) + T(n/2) + O(n^2).

Explain the essential properties of algorithms. Find the
308 time complexity of the following recurrence relation: 10 1 CO1 BL2
T(n) = 2T(n^(1/2)) + log n

p4-(302-327)
Page 5 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11
 Write an algorithm to design the Fibonacci series. Let f
(n) and g(n) be asymptotically positive functions.
309 Prove or disprove each of the following conjecture: 10 1 CO1 BL3

f (n) = O(g(n)) implies g(n) = O( f (n)).

Explain the TSP using dynamic programming for the
310 following distance matrix. Distance matrix = [ [0 2 9 10 3 CO3 BL3
10] [1 0 6 4] [15 7 0 8] [6 3 8 0] ]
How do you calculate the time complexity of a greedy
311 5 2 CO2 BL3
algorithm? Explain with a suitable example.
Explain the Fractional Knapsack problem and provide
a step-by-step approach to solve it using a Greedy
312 5 2 CO2 BL3
Algorithm. What is the time complexity of the
algorithm?
In what scenarios is the Fractional Knapsack problem
more suitable than the 0/1 Knapsack problem? Provide
313 5 2 CO2 BL4
an example scenario and explain how you would solve
it using the Fractional Knapsack algorithm.
Explain how the Fractional Knapsack algorithm can be
modified to solve the 0/1 Knapsack problem. Provide
314 10 2 CO2 BL5
an example scenario and explain how you would solve
it using the modified algorithm.
Explain the Job Sequencing problem with
deadlines and how it can be solved using a Greedy
315 5 2 CO2 BL4
algorithm. Provide an example scenario and explain
how you would solve it using the Greedy algorithm.
Describe the Minimum Spanning Tree (MST) problem
and how it can be solved using Kruskal's Algorithm.
316 Discuss the time complexity of the algorithm and any 10 2 CO2 BL4
limitations or assumptions made in the problem.
Provide an example scenario to illustrate your answer.
Discuss the time complexity of Prim's Algorithm and
317 any limitations or assumptions made in the problem. 5 2 CO2 BL4
Provide an example scenario to illustrate your answer.
Describe the concept of a minimum spanning tree and
318 show using a practical scenario/example how it can be 5 2 CO2 BL4
used to solve a real-world problem.
A company has limited shelf space to store different
products, each with a weight and a value. The
company wants to select the products to store on the
319 5 2 CO2 BL5
shelves to maximize its profit while respecting the
weight constraint. How can you solve this problem
using some known algorithmic solution?
A project manager might have a set of tasks to
complete, each with a duration and a priority. The
manager wants to select the tasks to work on such that
320 5 2 CO2 BL5
it maximizes the total priority while respecting the
available duration. How can you solve this problem
using some known algorithmic solution?

Page 6 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11
 In a transportation network, the nodes represent cities
or towns, and the edges represent roads or railway
321 lines connecting them. How can you use some existing 5 2 CO2 BL5
algorithmic solution to find the most cost-effective way
of connecting all the cities?
In telecommunications, antennas need to be placed in
such a way that they do not interfere with each other's
322 signals. Show how you can solve/model this problem 5 3 CO3 BL5
using the concept of the N-Queens problem to find the
optimal placement of antennas on a grid.
In cartography, graph coloring is used to color the
regions of a map such that adjacent regions have
323 different colors. Show using an example scenario with 5 3 CO3 BL5
at least 8 regions, how this problem can be modeled
using graph coloring problem.
Consider a city with multiple intersections that have
traffic lights. Each traffic light controls the flow of traffic
for a particular direction. The traffic lights at different
324 intersections should be coordinated in a way that 10 3 CO3 BL5
minimizes traffic congestion and delays. Show how
graph coloring problem can be used to solve this
problem
Consider the following variation of the subset sum
problem: given a set of integers S = {a1, a2, ..., an}, find
a subset T of S such that the sum of the elements of T
is as close as possible to a target integer k, without
325 exceeding it. If there are multiple subsets that achieve 10 3 CO3 BL6
the same closeness to k, choose the one with the
minimum elements.
Describe an algorithm to solve this problem. Analyze
the complexity of your algorithm.
Consider a transportation network consisting of a set of
factories and a set of warehouses, connected by a
network of roads. Each factory has a certain supply of
goods that need to be transported to the warehouses,
and each warehouse has a certain demand for goods.
The transportation cost between each factory and
326 10 4 CO4 BL6
warehouse is known, and each road has a certain
capacity that limits the amount of goods that can be
transported on it.
Formulate this problem as a network flow problem, and
describe how to construct the corresponding flow
network.
Explain how the Ford-Fulkerson Algorithm works for
327 10 4 CO4 BL3
network flow. Analyze its time complexity.
What is the time complexity of the greedy algorithm
328 2 2 CO2 BL3
used in the fractional knapsack problem?
Can the greedy fractional knapsack algorithm be used
329 2 2 CO2 BL3
to solve the subset sum problem?
What is the main drawback of the greedy algorithm
330 2 2 CO2 BL3
used in the fractional knapsack problem?
Page 7 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11

2 marks
 What is the objective of the job sequencing problem
331 2 2 CO2 BL2
with deadline?
What is the difference between a spanning tree and a
332 2 2 CO2 BL2
minimum spanning tree?
333 Is a minimum spanning tree unique for a given graph? 2 2 CO2 BL2
334 What is the objective of the N-Queen problem? 2 3 CO3 BL2
Can the greedy algorithm always find the optimal
335 2 3 CO3 BL2
coloring for a given graph?
How does backtracking work in the subset sum
336 2 3 CO3 BL3
problem?
Describe the fundamental difference between Divide
337 2 2 CO2 BL2
and Conquer algorithm and Greedy algorithm.
Solve the 8-puzzle problem using branch and bound.

338 10 4 CO4 BL5

p5-(338-349)
Apply Floyd Warshall Algorithm and find out all pair
shortest path matrix using dynamic programming.

339 10 1 CO3 BL3

Compare Dijkstra's Algorithm and Bellman Ford

340 Algoirthm with proper example. How to detect negative 10 3 CO4 BL4
cycle in a directed graph?
341 Write down the algorithm to merge two sorted arrays. 5 2 CO2 BL2
342 Derive state space tree for FIFO branch and bound. 5 4 CO2 BL2
343 Derive state space tree for LIFO branch and bound. 5 4 CO2 BL3
Write the average case time complexity of quick sort.
344 5 2 CO2 BL2
When qucik sort perform worst and why?
Page 8 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11
 Write the recurrence relation of merge sort. What is in
345 5 2 CO2 BL2
place and out place merging of two sorted arrays.
10,5,7,6,15
346 Apply quick sort and write down each 5 2 CO2 BL3
intermediate step's result.
Discuss merge sort algorithm with an example. Explain
347 10 2 CO2 BL2
the time complexity of merge sort.
Solve the 15-puzzle problem using branch and bound.

348 10 4 CO2 BL3

"For any comparison based sorting at least nlogn

comparisons are required". Justify the statement. Write
349 the algorithm for finding k-th minimum and k-th 10 2 CO2 BL4
maximum element from an array using divide and
conquer algorithm.
Write down the time complexity of Strassen's matrix
350 2 2 CO2 BL2
multiplication.
Write down the time complexity of matrix multiplication
351 2 2 CO2 BL2
using general divide and conquer.
What type of algorithmic strategy is used to solve
352 2 2 CO2 BL4
Quicksort?
With Branch and Bound, which kind of probmems can
353 2 4 CO2 BL2
2 354 be solved?
Define in place sorting. 2 2 CO2 BL2
mar 355 Define out place sorting. 2 2 CO2 BL2
ks 356 Write down the algorithmic statergy used in Bellman
Ford algorithm.
2 3 CO3 BL3
What algorithmic strategy is used in Dijkstra's shortest
357 2 3 CO3 BL3
path algorithm?
Write down the time complexity of merging two sorted
358 2 3 CO2 BL3
sub arrays.
What is the time complexity of all pair shortest path
359 2 3 CO3 BL3
using Dijkstra's shortest path algorithm.
If edges have negative weights, which algorithm is
360 suitable for finding shortest from source vertex to all 2 3 CO3 BL3
other vertices?
361 State a real-world application of the N-Queen problem. 2 2 CO2 BL2
Can the Subset Sum problem be solved in polynomial
362 2 2 CO2 BL2
time?
363 What are the two main steps involved in backtracking? 2 2 CO2 BL2

Page 9 of 9
© Q.Bank:PCCCS404, Printed by:G12169sc, Date & Time:2-5-23 11:19:11