DON BOSCO INSTITUTE OF TECHNOLOGY, MUMBAI 400070

Session 2024-25 (EVEN Semester)

IA-1 QUESTION BANK

Subject: ANALYSIS OF ALGORITHM (CSC402) S.E. (COMPS)

Sr. Question Module Marks

No.
1 Explain recurrences and various methods to solve recurrences. 1 2

2 Explain Master theorem with suitable example. 1 2

3 What are asymptotic notations? Define Big O, Ω and theta with the help of examples and 1 2
graphical notation
4 Explain Recurrence with example. 1 2

5 Explain Substitution Method with example 1 2

6 Explain Recursion Tree Method with example. 1 2

7 Solve the following using Master Method: T(n) =8 T(n/2) + n2 1 2

8 Explain asymptotic notations. `1 2

9 Define P class, NP class, NP-hard, NP-complete 1 2

10 Compare Greedy and Divide and Conquer approaches for algorithm design. 2 2

11 Explain the general procedure of Divide and Conquer Strategy 2 2

12 Explain how divide and conquer is used in Binary Search with example 2 2

13 Sort the list using merge sort algorithm and show its computing time is O(nlogn) : 2 2
10,5,7,6,1,4,8,3,2,9.
14 Write an algorithm for finding minimum and maximum using divide and conquer. Also, derive 2 2
its complexity.
15 Differentiate between Prims and Kruskals algorithm. 3 2

16 Describe the relationship among the P class, NP class, NP-hard, NP-complete. 1 2

17 Differentiate between divide & conquer and Greedy method. 2 2

18 Write an abstract algorithm for greedy design method. 2 2

19 Write and explain binary search algorithm 2 2

20 Specify the problem statement for fractional knapsack mathematically. 3 2

Prepared by Dr. Shaikh Phiroj

 DON BOSCO INSTITUTE OF TECHNOLOGY, MUMBAI 400070
Session 2024-25 (EVEN Semester)
21 Find the Minimum spanning trees of the following graph using Prim’s Algorithm. 3 5

10 1 25
6
14 2

15 7
24 16

5
18 3
22 4 12

22 Find the Minimum spanning trees of the following graph using Kruskal’s Algorithm. 3 5

10 1 25
6
14 2

15 7
24 16

5
18 3
22 4 12

23 Solve the following instance of job sequencing with deadlines problem n=7, 3 5
profits(p1,p2,p3,p4,p5,p6,p7)=(3,5,20,18,1,6,30) and deadlines
(d1,d2,d3,d4,d5,d6,d7)=(1,3,4,3,2,1,2). Schedule the jobs in such a way so as to get maximum
profit.
24 Sort the numbers using Quick Sort. Also, derive the time complexity of Quck Sort Sort. 2 5
50, 31, 71, 38, 77, 81, 12, 33
25 Explain Quick sort with algorithm and example 2 5

26 Consider the instance of knapsack problem where n=6, M=15, profits are 3 5
(P1,P2,P3,P4,P5,P6)=(1,2,4,4,7,2) and weights are (w1,w2,w3,w4,w5,w6)=(10,5,4,2,7,3).
Find maximum profits using fractional knapsack.
27 Write and explain the greedy knapsack and obtain the solution to following knapsack problem 3 5
where n=7, m=15, (p1,p2,…,p7)=(10,5,15,7,6,18,3), (w1,w2,….,w7)(2,3,5,7,1,4,1)

Prepared by Dr. Shaikh Phiroj

 DON BOSCO INSTITUTE OF TECHNOLOGY, MUMBAI 400070
Session 2024-25 (EVEN Semester)
28 Compare Prim’s and Kruskal’s method for finding minimum spanning trees. Find MST for the 3 5
following using Prim’s method.

6
b e
1 5 4
4

a d 3 f h
2 2
3 1
c 4 g

29 Find MST of following graph using Prim’s and Kruskal’s Algorithm. 3 5

0
3
6
1
1 3
5
5

3 4 2
6 4

2 5
6

30 Find shortest path from vertex 1 to vertex 4 using Dijkstra’s algorithm for the following graph. 3 5

4
2 3
7 8
5
1 2 5 4

3 6 3
6 5

Prepared by Dr. Shaikh Phiroj

 DON BOSCO INSTITUTE OF TECHNOLOGY, MUMBAI 400070
Session 2024-25 (EVEN Semester)
31 Apply dijkstra’s algorithm on the following graph. Consider vertex 0 as source. 3 5

32 Five Jobs with the following deadlines and profits: 3 5

JobID Deadline Profit
A 2 100
B 1 19
C 2 27
D 1 25
E 3 15

Find the maximum profit using the Greedy strategy.

33 Find MCST using Prims Algorithm for the following graph. 3 5

34 Find the shortest path from vertex S using Dijkstra’s algorithm, 3 5

Prepared by Dr. Shaikh Phiroj