Scribd
Upload
9 views

Design and Analysis of Algorithms

design and analysis of algorithms

Uploaded by

dikshadevadiga24
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Design and Analysis of Algorithms

design and analysis of algorithms

Uploaded by

dikshadevadiga24
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

44673/C0230

Reg. No.
III Semester B.C.A.5 Degree (CBCS)
Examination, April-2023
DESIGN AND ANALYSIS OF ALGORITHM (Theory)
(Repeaters)

Time:3 Hours Maximum Marks: 80


Instructions toCandidates :
Allthree sections are compulsory.
2. Draw diagrams wherever necessary.

SECTION-A
Answer any ten questions. (10×2-20)
1. a) Define algorithm.
b) Write apseudo code convention for while loop.
c) Define space and time complexity of an algorithm.
d) Define divide and conquer method.
e) Write the differences between straightmaxmin and recursive maxmin algorithm.
Define feasible and optimai solution.
Differentiate betwecn dynamic programming and greedy method.
h) What do you mean by two way merge pattern?
i) Define tree traversal.

Differentiate between directed graph and undirected graph, withneat diagram.


k) Define Hamiltonian cycle.
I) For the given graph, state the in degree and out degree ofnode l and 2.

|P.T.O.
SECTION-B
Answer any four questions. (4x5=20)
2. Explain characteristics of analgorithm.
3. Explain asymptotic notations.
4. Explain Binary search algorithm in detail.
5. Using the greedy knapsack algorithm find optimalsolution for following, n=7,m=20
P, to P,) = (10,5,15,7,6,18,3)
(W, to W,) - (2,3,5,7,1,4, 1).
6. Write a algorithm to find all pairs of shortest path.
7 Write a note on sum of sub set problem.
SECTION -C
Answer any four full questions. (4×10=40)
8. Explain the various pseudo code conventions for specifying algorithm. (4+6)
9. a) Write a note on strassen's matrix multiplication.
b) Sortthefollowing array using quick sort a{1:8} 5,3,1,4,8,2,9,7.
10. a) Find shortest path and its length from source vertex l toall the destinations for the
given graph.

b) Find the minimum cost spanning tree using prims algorithm.

14
(3) 44673/CO230

Write a note on 4x4 queen's problem.


11. a) problem.
Write a note on travelling sales man
b) following.
Write a short notes on any two of the
12.
Search (BFS).
a) Breadth First
b) Depth First Search (DES).
c) Backtracking.
d) N-queen problem.

You might also like