4/2/24, 3:19 PM CRP

Log Out

College Resource Planning

List of Questions
Instruction:

Before locking kindly create pdf & check it properly

Question paper print in B/W mode.
Kindly use same font and same size
Try to use normal same style
Requesting use same font style
Example. Some question may bold some question in normal.
Avoid direcct copy and paste form MS-Word
For any sign use latex "FX"

SME Name: null

Text
Subject
All Code [Link]. Question Module Marks CO BL Book User Details Remarks
Name
Uname:soumens
Name:Mr.
Locked CSD815 0000001 Explain why we use algorithm? 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000002 Write recurrence relation of quick sort? 1 2 CO1 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000003 Explain time complexity with respect to an algorithm. 1 2 CO1 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000004 What is Big-O notation? 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000005 What is Big-omega notation ? 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000006 What is theta notation in algorithm? 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000007 Explain what is greedy algorithm? 3 2 CO3 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000008 What is Amortized Analysis? 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
State the properties of definiteness and finiteness for Name:Mr.
Locked CSD815 0000009 1 2 CO1 BL1 0
an algorithm. Soumen Sarkar
Mob:8348031734
Locked CSD815 0000010 What is the average case complexity of binary search 1 2 CO1 BL1 0 Uname:soumens
algorithm? Name:Mr.

[Link] 1/14
4/2/24, 3:19 PM CRP
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000011 Write recurrence relation of merge sort algorithm? 3 2 CO3 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000012 What is the drawback of substitution method? 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000013 State the limitations of Master theorem. 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Write recurrence relation of divide and conquer based Name:Mr.
Locked CSD815 0000014 1 2 CO3 BL2 0
max-min algorithm. Soumen Sarkar
Mob:8348031734
Uname:soumens
Write the recurrence relation for an algorithm to find Name:Mr.
Locked CSD815 0000015 1 2 CO1 BL2 0
factorial of a number. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000016 Define Asymptotic notations. 1 2 CO1 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000017 What is optimization problem? 2 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000018 What is dynamic programming? 3 2 CO3 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000019 What is backtracking? 3 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000020 What is red black tree? 2 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000021 What is B+ tree? 2 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000022 What is B tree? 2 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000023 What is binary search tree? 2 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
What do you mean by time complexity of an Name:Mr.
Locked CSD815 0000024 1 2 CO1 BL1 0
algorithm? Soumen Sarkar
Mob:8348031734
Uname:soumens
What do you mean by space complexity of an Name:Mr.
Locked CSD815 0000025 1 2 CO1 BL1 0
algorithm? Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000026 What is master's theorem? 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Slove the recurrence relation using master's theorem.
Name:Mr.
Locked CSD815 0000027 1 2 CO1 BL1 0
Soumen Sarkar
T(n) = 2T(n/2) + n.
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000028 What is least cost branch & bound? 3 2 CO3 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000029 What is optimal solution in algorithm? 3 2 CO3 BL2 0
Soumen Sarkar
Mob:8348031734
Locked CSD815 0000030 What is feasible solution in algorithm? 3 2 CO2 BL2 0 Uname:soumens
Name:Mr.

[Link] 2/14
4/2/24, 3:19 PM CRP
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000031 Why we use BFS? 3 2 CO3 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000032 What is n-ary tree? 2 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
A complete n-ary tree is a tree in which each node has
Uname:soumens
n children or no childre. Let I be the number of internal
Name:Mr.
Locked CSD815 0000033 nodes and L be the number of leaves node in a 2 2 CO2 BL5 0
Soumen Sarkar
complete n-ary tree, if L+41 and I+40, then what is the
Mob:8348031734
value of n?
Uname:soumens
Name:Mr.
Locked CSD815 0000034 What is DFS? 3 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000035 What is minimum spanning tree? 3 2 CO3 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Slove the recurrence relation using master's theorem.
Name:Mr.
Locked CSD815 0000036 1 2 CO1 BL5 0
Soumen Sarkar
T(n) = 4T(n/2) + n.
Mob:8348031734
Uname:soumens
Slove the recurrence relation using master's theorem.
Name:Mr.
Locked CSD815 0000037 1 2 CO1 BL5 0
Soumen Sarkar
T(n) = 16T(n/4) + n.
Mob:8348031734
Uname:soumens
Slove the recurrence relation using master's theorem.
Name:Mr.
Locked CSD815 0000038 1 2 CO1 BL5 0
Soumen Sarkar
T(n) = 3T(n/2) + n2. Mob:8348031734
Arrange functions in the increasing order of asymptotic
complexity of functions f1, f2, f3 and f4?

f1(n) = 2n Uname:soumens
Name:Mr.
Locked CSD815 0000039 1 2 CO1 BL2 0
Soumen Sarkar
f2(n) = n3/2
Mob:8348031734
f3(n) = nlogn

f4(n) = logn
Uname:soumens
Is the master theorem being applicable for all types of Name:Mr.
Locked CSD815 0000040 1 2 CO1 BL2 0
recurrence? Soumen Sarkar
Mob:8348031734
Uname:soumens
Mention different methods to solve Recurrence Name:Mr.
Locked CSD815 0000041 1 2 CO1 BL2 0
Relations. Soumen Sarkar
Mob:8348031734
Uname:soumens
Draw a complete graph on four nodes. Also draw all of Name:Mr.
Locked CSD815 0000042 3 2 CO2 BL2 0
its spanning tree. Soumen Sarkar
Mob:8348031734
Consider a B+ tree in which the maximum number of Uname:soumens
keys in a node is 5. What is the minimum number of Name:Mr.
Locked CSD815 0000043 keys ina any non-root node? 2 2 CO2 BL5 0
Soumen Sarkar
Mob:8348031734

A B+ tree can contain a maximum of 7 pointer in a

node. What is the minimum number of keys in leaves? Uname:soumens
Name:Mr.
Locked CSD815 0000044 2 2 CO2 BL5 0
Soumen Sarkar
Mob:8348031734

What is the maximum number of keys that a B+ tree of

order 3 and height 3 have? Uname:soumens
Name:Mr.
Locked CSD815 0000045 2 2 CO2 BL5 0
Soumen Sarkar
Mob:8348031734

A B-tree of order 4 anf of height 3, what will be the Uname:soumens

maximum no of keys? Name:Mr.
Locked CSD815 0000046 2 2 CO2 BL5 0
Soumen Sarkar
Mob:8348031734
Locked CSD815 0000047 What is the balance factor in AVL tree? 2 2 CO2 BL2 0 Uname:soumens
Name:Mr.

[Link] 3/14
4/2/24, 3:19 PM CRP
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000048 What is the worst case time complexity of quick sort? 1 2 CO1 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
What is the time complexity of Kruskal algorithm for Name:Mr.
Locked CSD815 0000049 3 2 CO2 BL2 0
finding MST? Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000050 Distinguish between Algorithm and Psuedocode? 1 2 CO1 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Write possible prefixes of the given string Name:Mr.
Locked CSD815 0000051 5 2 CO5 BL5 0
S=”aabaacdabadc”. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000052 What is branch and bound technique in algorithm? 3 2 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
State the difference between flow and capacity of a Name:Mr.
Locked CSD815 0000053 3 2 CO4 BL2 0
network. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000054 What is residual capacity in network flow? 3 2 CO3 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000055 What is bounding function? 3 2 CO3 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000056 Define classes P with example. 6 2 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000057 Define classes NP with example. 6 2 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000058 Define classes NP-complete with example. 6 2 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000059 Define classes NP-Hard with example. 6 2 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Differentiate among P, NP class of problems with Name:Mr.
Locked CSD815 0000060 6 2 CO6 BL1 0
suitable examples. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000061 What is polynomial time reducibility? Give example(s). 6 2 CO6 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
What are the three properties of NP-complete Name:Mr.
Locked CSD815 0000062 6 5 CO6 BL2 0
problems? Soumen Sarkar
Mob:8348031734
Uname:soumens
Under what circumstances the condition "P = NP" is Name:Mr.
Locked CSD815 0000063 6 5 CO6 BL2 0
true? Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000064 What is Cook's theorem? 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000065 Describe Clique Decision Problem (CDP). 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000066 What do you mean by non-deterministic algorithms? 6 5 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Locked CSD815 0000067 Explain set cover problem. 6 5 CO6 BL1 0 Uname:soumens
Name:Mr.

[Link] 4/14
4/2/24, 3:19 PM CRP
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000068 Explain vertex cover problem. 6 5 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000069 Explain the satisfiability problem.. 6 5 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000070 Define Aggregate Method in Amortized analysis. 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000071 Define Accounting Method in Amortized analysis. 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000072 Define Potential Method in Amortized analysis. 1 2 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000073 Define augmenting path in network flow. 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000074 Describe maxflow min cut theorem. 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000075 How does backtracking differ from exhaustive search? 3 2 CO2 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000076 What is tabulation in dynamic programming? 3 2 CO2 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
What happens when a top-down approach of dynamic Name:Mr.
Locked CSD815 0000077 3 2 CO2 BL2 0
programming is applied to any problem? Soumen Sarkar
Mob:8348031734
Uname:soumens
What is the efficient way to solve the Travelling Name:Mr.
Locked CSD815 0000078 3 2 CO2 BL2 0
Salesman problem? Soumen Sarkar
Mob:8348031734
Uname:soumens
What is the overlapping sub-problem property in Name:Mr.
Locked CSD815 0000079 3 2 CO2 BL2 0
dynamic programming? Soumen Sarkar
Mob:8348031734
Uname:soumens
What is the main drawback of using a depth-first Name:Mr.
Locked CSD815 0000080 3 2 CO2 BL2 0
search strategy in branch and bound algorithms? Soumen Sarkar
Mob:8348031734
Uname:soumens
Write the recurrence relation of binary search and
Name:Mr.
Locked CSD815 0000081 calculate the time complexity using substitution 1 5 CO1 BL5 0
Soumen Sarkar
method.
Mob:8348031734
Uname:soumens
Explain the concept of substitution method for analysis Name:Mr.
Locked CSD815 0000082 1 5 CO1 BL3 0
of algorithms. Give an example. Soumen Sarkar
Mob:8348031734
Uname:soumens
Explain the concept of Recurrence Tree Method for Name:Mr.
Locked CSD815 0000083 1 5 CO1 BL2 0
analysis of algorithms. Support with examples. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000084 State and explain master theorem 1 5 CO1 BL1 0
Soumen Sarkar
Mob:8348031734
Solve the recurrence relation using Master method:
Uname:soumens
I. T (n) = 2T (n/2) + n Name:Mr.
Locked CSD815 0000085 1 5 CO1 BL3 0
Soumen Sarkar
Mob:8348031734
II.T(n)=3T(n/4)+n2
Solve the recurrence relation using substitution
method: Uname:soumens
Name:Mr.
Locked CSD815 0000086 1 5 CO1 BL5 0
T (n) = 2T (n/2) + n, where T(1) = 1 Soumen Sarkar
Mob:8348031734

[Link] 5/14
4/2/24, 3:19 PM CRP
Solve the recurrence relation using substitution
method: Uname:soumens
Name:Mr.
Locked CSD815 0000087 1 5 CO1 BL5 0
T (n) = T (n-1) + n, where T(1) = 1 Soumen Sarkar
Mob:8348031734

Slove the recurrence relation using recursion tree Uname:soumens

method: Name:Mr.
Locked CSD815 0000088 1 5 CO1 BL3 0
Soumen Sarkar
T(n) = 3T(n/4) + cn2 Mob:8348031734
Slove the recurrence relation using recursion tree Uname:soumens
method: Name:Mr.
Locked CSD815 0000089 1 5 CO1 BL3 0
Soumen Sarkar
T(n) = T(n/5) + T(4n/5) + n2 Mob:8348031734
Uname:soumens
Solve the recurrence relation using any method: Name:Mr.
Locked CSD815 0000090 1 5 CO1 BL5 0
Soumen Sarkar
T(n) = √n T(√n)+n.
Mob:8348031734
Solve the recurrence relation using any method: Uname:soumens
Name:Mr.
Locked CSD815 0000091 1 5 CO1 BL5 0
T(n)=2T(√n)+logn Soumen Sarkar
. Mob:8348031734
Solve fractional knapsack problem for the following:
Uname:soumens
n=6, P= (18, 5, 9, 10, 12, and 7), W= (7, 2, 3, 5, 3, and
Name:Mr.
Locked CSD815 0000092 2), maximum sack capacity M=13. 3 5 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Solve fractional knapsack problem for the following:

Uname:soumens
n=7, P= (5, 10, 15, 7, 8, 9 and 4), W= (1, 3, 5, 4, 1, 3
Name:Mr.
Locked CSD815 0000093 and 2), maximum sack capacity M=15. 3 5 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

There are 5 tasks T1, T2, ……..T5. The Execution of

each task requires one unit of time. We can execute
one task at a time. Each task Ti has a profit Pi and
deadline di. Profit Pi is earned if the task is computed
before the end of the dith unit of time.
Uname:soumens
Name:Mr.
Locked CSD815 0000094 Task T1 T2 T3 T4 T5 3 5 CO3 BL5 0
Soumen Sarkar
Profit 20 15 10 5 1 Mob:8348031734
Deadline 2 2 1 3 3
What is the maximum profit earned?

There are 7 tasks T1, T2, ……..T7. The Execution of

each task requires one unit of time. We can execute
one task at a time. Each task Ti has a profit Pi and
deadline di. Profit Pi is earned if the task is computed
before the end of the dith unit of time. Uname:soumens
Name:Mr.
Locked CSD815 0000095 3 5 CO3 BL5 0
Task T1 T2 T3 T4 T5 T6 T7 Soumen Sarkar
Mob:8348031734
Profit 35 30 25 20 15 12 5
Deadline 3 4 4 2 3 1 2
What is the maximum profit earned?

There are 9 tasks T1, T2, ……..T9. The Execution of

each task requires one unit of time. We can execute
one task at a time. Each task Ti has a profit Pi and
deadline di. Profit Pi is earned if the task is computed
Uname:soumens
before the end of the dith unit of time. Name:Mr.
Locked CSD815 0000096 3 5 CO3 BL5 0
Soumen Sarkar
Task T1 T2 T3 T4 T5 T6 T7 T8 T9 Mob:8348031734
Profit 15 20 30 18 18 10 23 16 25
Deadline 7 2 5 3 4 5 2 7 3
What is the maximum profit earned?
A text is made up of the characters a, b, c, d, e each Uname:soumens
occuring with the probability 0.11, 0.40, 0.16, 0.09, 0.24 Name:Mr.
Locked CSD815 0000097 3 5 CO3 BL5 0
respectively. The optimal Huffman coding technique will Soumen Sarkar
have the average length of _______ Mob:8348031734
Given the symbols A, B, C, D, E, F, G and H with the Uname:soumens
probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and Name:Mr.
Locked CSD815 0000098 3 5 CO3 BL5 0
12/30 respectively. The optimal Huffman coding Soumen Sarkar
technique will have the average length of _______ Mob:8348031734
Locked CSD815 0000099 Find the optimal solution to the fractional Knapsack 3 5 CO3 BL5 0 Uname:soumens
problem with given data using greedy method: Name:Mr.

[Link] 6/14
4/2/24, 3:19 PM CRP
Capacity of the Knapsack is 8. Soumen Sarkar
Mob:8348031734
Item Weight Benefit
A 2 60
B 3 75
C 4 90
Uname:soumens
Explain the differences between greedy method and Name:Mr.
Locked CSD815 0000100 3 5 CO3 BL3 0
dynamic programming with examples? Soumen Sarkar
Mob:8348031734
Suppose we have a weighted undirected graph with
Uname:soumens
negative edge weights. Now between Prims and
Name:Mr.
Locked CSD815 0000101 Kruskal which one is used to finding the MST or both 3 5 CO3 BL3 0
Soumen Sarkar
can be used for finding the MST? Explain it with
Mob:8348031734
justification
Uname:soumens
Which is efficient: Backtracking or Branch and Bound? Name:Mr.
Locked CSD815 0000102 3 5 CO3 BL3 0
Explain. Soumen Sarkar
Mob:8348031734
Uname:soumens
With an example explain graph coloring problem using Name:Mr.
Locked CSD815 0000103 3 5 CO3 BL4 0
backtracking strategy. Soumen Sarkar
Mob:8348031734
Uname:soumens
How we can apply branch-and-bound strategy to solve Name:Mr.
Locked CSD815 0000104 3 5 CO3 BL4 0
15-puzzle problem. Soumen Sarkar
Mob:8348031734
Uname:soumens
Distinguish the differences between fractional Name:Mr.
Locked CSD815 0000105 3 5 CO3 BL3 0
knapsack and 0/1 knapsack with examples. Soumen Sarkar
Mob:8348031734
Uname:soumens
Explain the steps to find all pair shortest path of a Name:Mr.
Locked CSD815 0000106 3 5 CO3 BL3 0
graph using dynamic programming. Soumen Sarkar
Mob:8348031734
Uname:soumens
Write an algorithm for 4–queen’s problem. Give time Name:Mr.
Locked CSD815 0000107 3 5 CO3 BL4 0
complexity for the problem. Soumen Sarkar
Mob:8348031734
Uname:soumens
Define the Subset Sum Problem. How can
Name:Mr.
Locked CSD815 0000108 backtracking be used to solve the Subset Sum 3 5 CO3 BL4 0
Soumen Sarkar
Problem?
Mob:8348031734
Uname:soumens
Define the Graph Coloring Problem. Describe an
Name:Mr.
Locked CSD815 0000109 example of a real-world problem that can be modeled 3 5 CO3 BL4 0
Soumen Sarkar
using the Graph Coloring Problem.
Mob:8348031734
Uname:soumens
What is the 15 Puzzle Problem? Can any arrangement Name:Mr.
Locked CSD815 0000110 3 5 CO3 BL4 0
of tiles in the 15 Puzzle grid be solved? Soumen Sarkar
Mob:8348031734
Uname:soumens
What is the N-Queens Problem? What are the Name:Mr.
Locked CSD815 0000111 3 5 CO3 BL2 0
constraints imposed by the N-Queens Problem? Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000112 Discuss KMP algorithm for string pattern matching. 5 5 CO5 BL2 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Discuss two types of string-matching algorithms along Name:Mr.
Locked CSD815 0000113 5 5 CO5 BL3 0
with their worst-case time complexity. Soumen Sarkar
Mob:8348031734
Uname:soumens
Find the prefix table (π table) for the given pattern P = Name:Mr.
Locked CSD815 0000114 5 5 CO5 BL5 0
“abcabcabcde”. Soumen Sarkar
Mob:8348031734
Find feasible solution for the following list of jobs. Also
find the total profit earned. Assume that each job needs
one unit in time in a single machine. Uname:soumens
Name:Mr.
Locked CSD815 0000115 4 5 CO4 BL5 0
Job No I II III IV V Soumen Sarkar
Mob:8348031734
Profit 50 30 10 20 15
Deadline 2 1 3 2 4
Uname:soumens
Explain the role of Find & Union method in detecting Name:Mr.
Locked CSD815 0000116 5 5 CO5 BL4 0
cycle in a graph. Soumen Sarkar
Mob:8348031734

[Link] 7/14
4/2/24, 3:19 PM CRP
Uname:soumens
Write the recurrence relation of binary search and
Name:Mr.
Locked CSD815 0000117 calculate the time complexity using substitution 5 5 CO4 BL4 0
Soumen Sarkar
method.
Mob:8348031734
Uname:soumens
Find the max heap based on the given data:
Name:Mr.
Locked CSD815 0000118 5 5 CO4 BL5 0
Soumen Sarkar
6, 10, 5, 8, 12, 9, 10, 7, 18, 56, 97, 89
Mob:8348031734
Consider the problem having weights and profits are:

Weights: {3, 4, 6, 5}
Uname:soumens
Name:Mr.
Locked CSD815 0000119 Profits: {2, 3, 1, 4} 4 5 CO4 BL5 0
Soumen Sarkar
The weight of the knapsack is 8 kg, find the optimal Mob:8348031734
solution for the 0/1 knapsack problem making use of
dynamic programming approach.
Consider the problem having weights and profits are:

Weights: {2, 3, 4, 5}
Uname:soumens
Name:Mr.
Locked CSD815 0000120 Profits: {1, 2, 5, 6} 4 5 CO4 BL5 0
Soumen Sarkar
The weight of the knapsack is 8 kg, find the optimal Mob:8348031734
solution for the 0/1 knapsack problem making use of
dynamic programming approach.
Uname:soumens
Name:Mr.
Locked CSD815 0000121 P ⊆ NP. Justify your answer. 6 5 CO6 BL4 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Given an undirected graph G, is it 2-colourable. Decide Name:Mr.
Locked CSD815 0000122 6 5 CO6 BL6 0
with a polynomial time algorithm. Soumen Sarkar
Mob:8348031734
Uname:soumens
If an NP-complete problem Q is solved in polynomial Name:Mr.
Locked CSD815 0000123 6 5 CO6 BL2 0
time, then prove that NP = P. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000124 Show that 3-colouring problem is NP-complete. 6 5 CO6 BL4 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
“Any NP problem is verifiable in polynomial time”- Name:Mr.
Locked CSD815 0000125 6 5 CO6 BL4 0
justify your answer. Soumen Sarkar
Mob:8348031734
Let S be an NP-complete problem and Q and R be two Uname:soumens
other problems not known to be in NP. Q is polynomial Name:Mr.
Locked CSD815 0000126 6 5 CO6 BL4 0
time reducible to S and S is polynomial-time reducible Soumen Sarkar
to R. Then what will be class of Q and R? Mob:8348031734
Uname:soumens
Explain the TSP using dynamic programming for the
Name:Mr.
Locked CSD815 0000127 following distance matrix. Distance matrix = [ [0 10 3 5 CO3 BL5 0
Soumen Sarkar
15 20] [5 0 9 10] [6 13 0 12] [8 8 9 0] ]
Mob:8348031734
Uname:soumens
Explain the TSP using dynamic programming for the
Name:Mr.
Locked CSD815 0000128 following distance matrix. Distance matrix = [ [0 16 3 5 CO3 BL5 0
Soumen Sarkar
11 6] [8 0 13 16] [4 7 0 9] [5 12 2 0] ]
Mob:8348031734
Uname:soumens
Define the terms flow networks and flow. What are the Name:Mr.
Locked CSD815 0000129 4 5 CO4 BL2 0
essential properties of flow? Soumen Sarkar
Mob:8348031734
Illustrate Bellman-Ford algorithm to find shortest path Uname:soumens
Name:Mr.
Locked CSD815 0000130 from one node to another node with an example. 4 5 CO4 BL5 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000131 Differentiate between B Tree and B+ Tree. 2 5 CO2 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Generate a B-Tree of order 3 (2-3 tree) for the Name:Mr.
Locked CSD815 0000132 2 5 CO2 BL5 0
following key values 25,10,12,15,39,64,53. Soumen Sarkar
Mob:8348031734
Locked CSD815 0000133 Find the maximum flow from the following graph 4 5 CO4 BL5 0 Uname:soumens
between node 0 and node 5 using Ford-Fulkerson Name:Mr.
algorithm . Soumen Sarkar
Mob:8348031734

[Link] 8/14
4/2/24, 3:19 PM CRP

Uname:soumens
Name:Mr.
Locked CSD815 0000134 Discuss Naive algorithm for string pattern matching. 4 5 CO4 BL4 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Write an algorithm for 8–queen’s problem. Give time Name:Mr.
Locked CSD815 0000135 4 5 CO4 BL4 0
complexity for the problem. Soumen Sarkar
Mob:8348031734
Uname:soumens
Distinguish the differences between fractional Name:Mr.
Locked CSD815 0000136 4 5 CO4 BL4 0
knapsack and 0/1 knapsack with examples. Soumen Sarkar
Mob:8348031734
Uname:soumens
Define the Subset Sum Problem. How can
Name:Mr.
Locked CSD815 0000137 backtracking be used to solve the Subset Sum 4 5 CO4 BL4 0
Soumen Sarkar
Problem?
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000138 Define State space tree in backtracking. 4 5 CO4 BL4 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Differentiate between Divide and Conquer and Name:Mr.
Locked CSD815 0000139 4 5 CO4 BL4 0
Dynamic Programming. Soumen Sarkar
Mob:8348031734
Find the optimal solution to the fractional Knapsack
problem with given data using greedy method:
Capacity of the Knapsack is 8. Uname:soumens
Name:Mr.
Locked CSD815 0000140 Item Weight Benefit 4 5 CO4 BL4 0
Soumen Sarkar
A 2 60 Mob:8348031734
B 3 75
C 4 90
Apply PRIMS algorithm on the following graph to find
minimum spanning tree. Show all the steps.
Uname:soumens
Name:Mr.
Locked CSD815 0000141 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Apply PRIMS algorithm on the following graph to find

minimum spanning tree. Show all the steps.

Uname:soumens
Name:Mr.
Locked CSD815 0000142 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Apply Kruskal algorithm on the following graph to find

minimum spanning tree. Show all the steps.

Uname:soumens
Name:Mr.
Locked CSD815 0000143 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Apply Kruskal algorithm on the following graph to find

minimum spanning tree. Show all the steps.
Uname:soumens
Name:Mr.
Locked CSD815 0000144 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

[Link] 9/14
4/2/24, 3:19 PM CRP
Find the shortest path from node A to node E using
Bellman-Ford algorithm.

Uname:soumens
Name:Mr.
Locked CSD815 0000145 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Find out the shortest path from node 0 to all other

vertices for the following graph using Dijkstra algorithm.
Show all the steps.
Uname:soumens
Name:Mr.
Locked CSD815 0000146 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Perform multiplications of the given matrices using

Strassen's algorithm: Uname:soumens
Name:Mr.
Locked CSD815 0000147 4 10 CO4 BL5 0
Soumen Sarkar
Mob:8348031734

Perform multiplications of the given matrices using

Strassen's algorithm and show all the steps: Uname:soumens
Name:Mr.
Locked CSD815 0000148 4 10 CO4 BL5 0
Soumen Sarkar
Mob:8348031734

Consider the following weights and profits :

Uname:soumens
Weights: {3, 4, 6, 5}, Profits: {2, 3, 1, 4}. The weight of Name:Mr.
Locked CSD815 0000149 3 10 CO3 BL5 0
the knapsack is 11. Suggest a solution vector with Soumen Sarkar
maximum profit using 0/1 knapsack method (use Mob:8348031734
dynamic approach).
Consider the following weights and profits :
Uname:soumens
Weights: {3, 4, 6, 5}, Profits: {2, 3, 1, 4}. The weight of Name:Mr.
Locked CSD815 0000150 3 10 CO3 BL5 0
the knapsack is 8. Suggest a solution vector with Soumen Sarkar
maximum profit using 0/1 knapsack method (use Least Mob:8348031734
cost Branch & Bound approach).
Use the fundamental principle of Floyd-Warshall’s all-
pairs-shortest-path algorithm to find the shortest path
from node 2 to node 4 for the following graph.

Uname:soumens
Name:Mr.
Locked CSD815 0000151 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Use the fundamental principle of Floyd-Warshall’s all-

pairs-shortest-path algorithm to find the shortest path
from node 1 to node 3 for the following graph.

Uname:soumens
Name:Mr.
Locked CSD815 0000152 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Locked CSD815 0000153 Use the fundamental principle of Floyd-Warshall’s all- 3 10 CO3 BL5 0 Uname:soumens
pairs-shortest-path algorithm to find the shortest path Name:Mr.
of all nodes for the following graph. Soumen Sarkar
Mob:8348031734

[Link] 10/14
4/2/24, 3:19 PM CRP

Use the fundamental principle of Floyd-Warshall’s all-

pairs-shortest-path algorithm to find the shortest path
of all nodes for the following graph.

Uname:soumens
Name:Mr.
Locked CSD815 0000154 3 10 CO3 BL5 0
Soumen Sarkar
Mob:8348031734

Illustrate Bellman-Ford algorithm to find shortest path

from node-1 to all other nodes with reference to the
following directed graph:

Uname:soumens
Name:Mr.
Locked CSD815 0000155 3 10 CO3 BL6 0
Soumen Sarkar
Mob:8348031734

Uname:soumens
Find optimal parenthesization using Dynamic
Name:Mr.
Locked CSD815 0000156 programming strategy for obtaining product of matrices 3 10 CO3 BL6 0
Soumen Sarkar
ordered as: A(2x3), B(3x4), C(4x5), and D(5x2).
Mob:8348031734
Uname:soumens
Explain matrix chain multiplication using dynamic
Name:Mr.
Locked CSD815 0000157 programming for the following matrices. The matrices 3 10 CO3 BL6 0
Soumen Sarkar
have size 5x4, 4x7, 7x2, and 2x3
Mob:8348031734
Apply Backtracking to solve the following sub-set sum Uname:soumens
problem Name:Mr.
Locked CSD815 0000158 4 10 CO4 BL6 0
Soumen Sarkar
w = {5,10,12,13,15,18}, n=6 and sum=30 Mob:8348031734
Uname:soumens
Find the maximum and minimum algorithm using divide Name:Mr.
Locked CSD815 0000159 4 10 CO4 BL6 0
and conquer with an example. Soumen Sarkar
Mob:8348031734
Uname:soumens
Write down Merge sort algorithm and explain it with an Name:Mr.
Locked CSD815 0000160 2 10 CO2 BL3 0
example. Soumen Sarkar
Mob:8348031734
Uname:soumens
Write down Quick sort algorithm and explain it with an Name:Mr.
Locked CSD815 0000161 2 10 CO2 BL3 0
example where pivot is the first element of the array. Soumen Sarkar
Mob:8348031734
Uname:soumens
Using KMP algorithm find whether the pattern P= Name:Mr.
Locked CSD815 0000162 4 10 CO4 BL4 0
<0010> is in the text T =<1100011010001010> or not. Soumen Sarkar
Mob:8348031734
Uname:soumens
Define 2SAT and 3SAT problem. Show that 2SAT is in Name:Mr.
Locked CSD815 0000163 6 10 CO6 BL3 0
P but 3SAT is NP-complete. Soumen Sarkar
Mob:8348031734
Uname:soumens
Why KMP is better than Naïve Explain KMP algorithm Name:Mr.
Locked CSD815 0000164 5 10 CO5 BL2 0
with example. Soumen Sarkar
Mob:8348031734
Locked CSD815 0000165 Find the maximum flow from the following graph 5 10 CO5 BL4 0 Uname:soumens
between source to sink. Name:Mr.
Soumen Sarkar
Mob:8348031734

[Link] 11/14
4/2/24, 3:19 PM CRP

Given a 4x4 chessboard, how many distinct Uname:soumens

arrangements of four queens can be placed on the Name:Mr.
Locked CSD815 0000166 4 10 CO4 BL6 0
board without threatening each other? Explain all the Soumen Sarkar
steps with suitable state space tree. Mob:8348031734
Solve the recurrence relation using Recurrence Tree
Uname:soumens
method
Name:Mr.
Locked CSD815 0000167 5 10 CO5 BL6 0
T(n)= 2T (n/2) + n. Satisfy the solution with method of Soumen Sarkar
substitution. Mob:8348031734

Uname:soumens
Analyse average case performance of quick sort
Name:Mr.
Locked CSD815 0000168 algorithm using recurrence tree. Also, derive the 5 10 CO5 BL4 0
Soumen Sarkar
recurrence relation.
Mob:8348031734
Uname:soumens
Analyse average case performance of Merge sort
Name:Mr.
Locked CSD815 0000169 algorithm using recurrence tree. Also, derive the 5 10 CO5 BL4 0
Soumen Sarkar
recurrence relation.
Mob:8348031734
Solve Travelling Salesman Problem using Branch and Bound
Algorithm in the following graph:

Uname:soumens
Name:Mr.
Locked CSD815 0000170 5 10 CO5 BL6 0
Soumen Sarkar
Mob:8348031734

Solve Travelling Salesman Problem using Branch and Bound

Algorithm in the following matrix:

Uname:soumens
Name:Mr.
Locked CSD815 0000171 5 10 CO5 BL6 0
Soumen Sarkar
Mob:8348031734

Uname:soumens
Define vertex cover problem. Prove that vertex cover is Name:Mr.
Locked CSD815 0000172 6 10 CO6 BL3 0
NP complete. Soumen Sarkar
Mob:8348031734
Suppose we perform a sequence of stack operations
on a stack whose size never exceeds k. After every k
Uname:soumens
operations, we make a copy of the entire stack for
Name:Mr.
Locked CSD815 0000173 backup purposes. Show that the cost of n stack 6 10 CO6 BL6 0
Soumen Sarkar
operations, including copying the stack, is O(n) by
Mob:8348031734
assigning suitable amortized costs to the various stack
operations.
Uname:soumens
Show that Hamiltonian cycle problem for digraphs, is Name:Mr.
Locked CSD815 0000174 6 10 CO6 BL4 0
NP-complete. Soumen Sarkar
Mob:8348031734
Uname:soumens
Show that Travelling Salesman Problem is NP- Name:Mr.
Locked CSD815 0000175 6 10 CO6 BL3 0
complete. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000176 Define P, NP, NP-complete and NP-Hard. 6 10 CO6 BL1 0
Soumen Sarkar
Mob:8348031734
Draw an example of a graph with 10 vertices and 20 Uname:soumens
edges that has a Hamiltonian cycle. Also, draw an Name:Mr.
Locked CSD815 0000177 6 10 CO6 BL4 0
example of a graph with 10 vertices and 20 edges that Soumen Sarkar
does not have a Hamiltonian cycle. Mob:8348031734

[Link] 12/14
4/2/24, 3:19 PM CRP
Give a complete, weighted graph G, such that its edge Uname:soumens
weights satisfy the triangle inequality but the MST- Name:Mr.
Locked CSD815 0000178 6 10 CO6 BL4 0
based approximation algorithm for TSP does not find Soumen Sarkar
an optimal solution. Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000179 Describe Convex hull with an example. 4 10 CO4 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000180 Describe minkowski sum with an example. 4 10 CO4 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Describe longest common subsequence with an Name:Mr.
Locked CSD815 0000181 5 10 CO5 BL1 0
example. Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000182 What is shape similarity? 4 5 CO4 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000183 What is polygon partitioning? 4 5 CO4 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000184 What is nearest neighbor search? 4 5 CO4 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000185 What is range search? 4 5 CO4 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000186 What is intersection detection? 4 5 CO4 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000187 What is set cover problem? 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000188 What is approximate string matching? 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000189 What is text compression? 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000190 What is longest Common substring? 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000191 Explain different types of cryptography? 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734
Uname:soumens
Name:Mr.
Locked CSD815 0000192 Explain shortest common superstring? 5 5 CO5 BL1 0
Soumen Sarkar
Mob:8348031734

Analysis of Subject Code:CSD815

CO Distribution Analysis At A Glance
Total No of Question: 192
Total No Of C.O.
C.O. In Percentage
in the Question
Type (%)
Paper
CO1 39 20.31%
CO2 28 14.58%
CO3 47 24.48%
CO4 29 15.10%
CO5 23 11.98%
CO6 26 13.54% ;

[Link] 13/14
4/2/24, 3:19 PM CRP
Marks wise total no of CO Distribution
Total No of Question: 192
Marks Marks Marks
C.O. Type
2 5 10
CO1 28 11 0
CO2 24 2 2
CO3 10 22 15
CO4 1 20 8
CO5 1 14 8
CO6 6 12 8

[Link] 14/14