Department: Computer Science &

Engineering
CAY: 2024-25

Question Bank
th
PROGRAMME: B.tech CSE (4 Sem)
COURSE Design & Analysis of algorithm SEMESTER: 4th
TITLE:
COURSE BTCS 403-18 CREDITS: 3
CODE:
SESSION: 2024-25 FACULTY-IN- Er. Sarabjit Kaur
CHARGE:

Ques Topics CO’s Marks

Section 1
1. What is algorithm? CO1 2

2. What are the features of algorithm? CO1 2

3. What are Asymptotic notation? CO2 2

4. Define Big-Oh CO2 2

5. Define Big-Theta CO2 2

6. Define Big-Omega CO2 2

7. Define little-o CO2 2

8. Define little-theta CO2 2

9. Define little-omega CO2 2

10. What are complexities? CO2 2

11. What is time complexity of algorithm? CO5 2

12. What is space complexity of algorithm? CO4 2

13. Explain Algorithm for Bubble Sort with example? CO4 2

14. Explain Algorithm for Merge Sort with example? CO3 2

15. Explain Algorithm for Insertion Sort with example? CO4 2

16. Explain Algorithm for Quick Sort with example? CO4 2

17. What are differences between searching and sorting? CO5 2

18. What are differences between Binary and linear search? CO5 2

19. What is order of algorithm? CO5 2

20. What is Knapsack algorithm? CO5 2

21. Give example of Dynamic programming approach? CO3 2

22. What is basic principle of Divide and conquer? CO3 2

23. List applications of DFS and BFS. CO4 2

24. How prim’s algo is better than Kruskal? Explain. CO3 2

25. List various steps for design of algorithm CO3 2
26. Are solutions overlapping in DP approach? CO2 2
27. Asymptotic notations Omega is transitive”. Justify CO2 2
28. Solve recurrence equation T(n) = 9T(n/3)+n CO3 2

29. Write any algorithm to find shortest path CO3 2

30. What is travelling Salesman problem? CO3 2
31. What is Flow network? CO2 2

32. What do you mean by Minimum spanning tree? CO1 2

33. 1. Define branch and bound. CO2 2

2. How does Brute force work?

34. What is difference in greedy and brute force CO1 2

approach?

SECTION 2
35. 1. Explain big-oh Computation for following CO2 5
structure :-
 Sequencing
 If-Else
 For loop
 While loop
 Recursion
36. Solve following instance of Knapsack CO1 5
Problem using Branch and Bound Technique
(assume W=4)
Item w v
s
11 1 2
12 2 3
13 3 4
37. Apply Prims and Kruskal algorithm to the CO1 5
graph to obtain minimum spanning tree. Do
these algorithms generate same output?
Justify.

38. Write an algorithm for merging two arrays into CO2 5

one arrays. Explain with suitable example.

39. Modify Djikstra algorithm to solve an CO2 5

example.

40. Solve the recurrence relation: CO2 5

T(n)=2T(n/2)+nT(n)=2T(n/2)+n using the
Master Theorem.

41. Explain the divide and conquer approach CO2 5

with an example of Merge Sort.

42. Write the algorithm for Quick Sort and CO2 5

analyze its worst-case time complexity.

43. Explain the dynamic programming approach CO4 5

with an example of the Fibonacci series.

44. Solve the 0/1 knapsack problem using dynamic CO4 5

programming for a given set of items.
45. Explain the Dijkstra’s algorithm for finding the CO2 5
shortest path in a graph.

46. Explain the Floyd-Warshall algorithm for all- CO2 5

pairs shortest paths.

47. Explain the branch and bound technique CO2 5

with an example of the traveling salesman
problem.

48. Explain the heap sort algorithm and its time CO2 5
complexity.

49. Explain the knapsack problem and its CO4 5

solution using dynamic programming.

50. Fine Big-Oh for following notations:- CO5 5

51. Explain Term Algorithm with its characteristics. CO1 5

52. What is Knapsack problem? Justify “All Optimal CO4 5

solutions will fill the knapsack exactly”.

53. Explain general method of Branch and Bound. CO5 5

54. Find Minimum cost spanning tree of following tree CO4 5

55. Solve:- CO3 5

 T(n)=T(n−1)+O(n)
 T(n)=2T(2n)+O(n)
 T(n)=7T(n/2)+18n^2

56. Solve a travelling sales person problem using CO1 5

dynamic programming.

57. Write a function to compute lengths of shortest paths CO2 5

between all pairs of nodes for the given adjacency
matrix with suitable example

58. Describe Travelling Salesperson Problem (TSP) CO3 5

using Dynamic Programming
59. Describe Travelling Salesperson Problem (TSP) using CO3 5
Branch and Bound.

60. Write an algorithm for linear search and analyze the CO3 5
algorithm for its time complexity.

61. What is pseudo-code? Explain with an example CO3 5

62. Write Pseudocode for BFS and DFS with suitable CO4 5
example.
63. Explain Bin packing problem with example. CO4 5

64. Write a short note on Master Method. CO3 5

65. Explain Greedy method with example CO2 5

66. Solve For minimum cost spanning tree:- CO1 5

67. Write a brief note on Substitution method. Give an CO3 5

example.

68. Explain 0-1 Knapsack problem. CO3 5

SECTION 3
69. 1. Solve Transitive closure. CO2 10

70. Give a set S=<1, 4, 5, 6, 7, 3> and W=12. Obtain the sum of subset CO3 10
using backtracking approach.

71. Define flow network and write an iterative Ford-Fulkerson's method

for solving Max- Flow problem.
72. Find the longest common subsequence for the following two sequences CO2 10
using dynamic programming. Show the complete process.
 X=100101001
Y=101001.

73. A) How the performance can be analyzed? Explain with the example. CO2 10
B) Give the algorithm for transpose of a matrix m x n and find the time
complexity of the algorithm using step count method.

74. Find the Big-Oh notations for the following functions: CO4 10
(і) (л)=78889
(ii) f(n)=6n²+135
(iii) f(n)=7n²+8n+56
(iv) f(n)=n+35n² +84

75. Write a short note on following: CO3 10

i. Heuristics and their characteristics
ii. Network flow algorithm

76. CO3 10
Why do we perform topological sorts only on DAGs? Explain

77. Using Dijkstra’s algorithm find the shortest path from A to D for the CO4 10
following graph.

78. 1. Write a detailed note on the following: CO1 10

A) Substitution Method
B) Network Flow Algorithm

79. Explain fractional knapsack problem with example. CO5 10

80. Take the following list of functions and arrange them in ascending CO5 10
order of growth rate. That is, if function g(n) immediately follows
function f(n) in your list, then it should be the case that f(n) is O(g(n)).
 f1(n) = n 2.5 , f2(n) = √(2)n , f3(n) = n + 10 , f4(n) = 10 n , f 5(n) =
100 n and f6(n) = n2 log(n)

81. Sort the list 415, 213, 700, 515, 712, 715 using Merge sort algorithm. CO5 10
Also explain the time complexity of merge sort algorithm.

82. Write an algorithm for merging two sorted arrays into one array. CO5 10
Explain with suitable examples.

83. Write a short note for the following: CO3 10

A. Divide and conquer technique
B. Greedy algorithm

84. Define -Warshall‘s algorithm. Find transitive closure of digraph in CO3 10

detail.

85. CO3 10

86. What is Knapsack problem? Justify that "All optimal solutions will fill CO1 10
the knapsack exactly".

87. Explain the concepts of P, NP and NP completeness. CO1 10

88. What are NP hard problems? Write short notes on the procedures of the CO4 10
following approximation algorithms to solve TSP using suitable
examples.

i. Nearest Neighbor algorithm.

ii. Twice-around-the-tree algorithm.
89. Give a set S=<1,4,5,6,7,3> and W=12. Obtain the sum of subset using CO5 10
backtracking approach.

90. Write the general procedure of dynamic programming. CO5 10

91. What are heuristics? What are their characteristics? CO4 10

92. Define flow network and write an iterative Ford-Fulkerson's method for CO4 10
solving Max- Flow problem.

93. Explain the Big-Oh computation for each of the following control CO5 10
structures:

(i) Sequencing
(ii) If-then-else
(iii)“for” loop
(iv) “While” loop
(v) Recursion