CS/B.

TECH(N)/EVEN/SEM-4/4416/2022-2023/1124
.....,,�...-· ....---,.
MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL
Paper Code: ES-CS40l!/PCC-CS 404/PCC-CS404/PCC-CSD 402/PCCCS404 Design & Analysis of Algorithms
UPID : 004416
�
Time Allotted : 3 Hours Full Marks :70
The Figures in the margin Indicate full marks.
Candidate are required to give their answers In their own wards as far as practtcable

Group-A (Very Short Answer Type Question)

1. Answer any ten of the following : [ 1 x 10 = 10)
! 11 State True/False: Approximation algorithm guaranties the best quality of solut1on.
(Ill State True/False: O(logn) > O(n)
1 1111 What is the time complexity of Knapsack algorithm using Greedy method?
{IVJ State True/ False: Adjacency matrix and Path Matrix are same.
(VI State True/ False: Ordered searching algorithm Is a Polynomial Algorithm.
(VI) State True/False: Brute Force method gives the best quality of solution.
(VII) State True/ False: Travelling Salesman Problem is a Non-Polynomial problem.
(VIII ) Name one heuristic method of searching.
(IX) Best case time complexity of Bi nary search algorithm Is ______

om
(X) The time complexity of Floyd's algorithm is _______
(XIJ Backtracking follows _________ traversal technique.
{XII) What is spanning tree?
t.c
Group-B (Short Answer Type Question)
Answer any three of the following [ S x 3 = 15)
bu

2. Write down an algorithm to solve the Job Sequencing with Deadline Problem using Greedy method. What [SJ
is the time complexity of your algorithm?
3. Find the maximum flow of the following network. Mention each step clearly. [5J
yw
m

4. Write down an algorithm in Greedy method to find the minimum spanning tree by Prim's algorithm. What [SJ
is the time complexity of your algorithm?
5. (a) State Cook's Theorem. (5)
(b) Define Clique with example.

6. Define the following terms: [5J

(i) Brute Force Algorithm
1/3
 (ii) Approximation Algorithm

Group-C jlong Answer Type Question)

Answer any three of the following [ 15 X 3 = 45)
7. (a) Find the minimum spanning tree using Prim's method from the following graph. Mention each step I

r
[6
clearly.

18

om
L......................................-................................J
(b) Write an algorithm to find all solutions of N-Queens problem using backtracking. [4I
t.c
(c) What Is the time complexity of your algorithm? [1)
(d) Write an algorithm to find all pairs shortest path using Floyd's method. [4I
8. (a) Write down an algorithm of Quick Sort. [sI
bu

(b) Derive the best, worst and average case time complexity of your algorithm. I 2+3+5 J
9. (a) Find the minimum number of scalar operation needed to multiply the matrices Al, Al., A3 and A4 [ 5)
having dimensions 30x35, 35x15, 15x5 and SxlO respectively.
(b) Write down an algorithm using Greedy method to find minimum spanning tree by Krushkal's [ 5)
yw

algorithm.
(c) Find the time complexity of your algorithm. [ 3)
(d) Differentiate between Backtracking and Branch and Bound. [2 I
m

10. (a) Find the transitive closure of vertex A from the following graph: [ 3)

(b) Define the following terms: I 12 I

(I) Directed graph
(ii) Undirected graph

2/3
 (Iii) In-Degree and Out-Degree
(iv) Complete Graph
(v) Artfculatfon Point
(vi) Bridge
11. (a) Differentiate between recursion a,nd Iteration. I3I
(b) Find the time complexity of the following recurrence relations using Maste,r's Theorem. [ 4+4 I
(i)

(ii)

T(n) = Jil,�!+log n
\ 2/

(c) (c) Define little omega notation. Explain with an example. [ 2+2)

*** END OF PAPER **•

om
t.c
bu
yw
m

3/3