Paper Code:MCA 20106

SRI Y.N.COLLEGE (AUTONOMOUS)-NARSAPUR, W.G.Dt.

Dr.C.S.RAO PG CENTRE(A)

 (Affiliated to Adikavi Nannaya University) 

I M.C.A PG Examinations, March - 2024 (At the end of 1st Semester)

For Regular (2023-25 batch), Supplementary (2022-24 batch) 

DESIGN AND ANALYSIS OF ALGORITHMS

Paper - VI

Date: 14.03.2024 FN 

Duration:3hrs

Max Marks:75

SECTION-A(4x15-60Marks)

Time: 3 Hours

Max Marks:75

1. a) Explain the fundamentals of Algorithmic Problem Solving

(OR)    15M

b) Explain different types of Asymptotic Notations.

2. a) Explain the Divide and Conquer strategy for Merge Sort. Illustrate with example

(OR)     15M

b) Explain Depth First Search using the decrease and conquer technique with an example 3. a) Explain Floyd's Algorithm for all-pairs shortest paths problem with an example

(OR)    15M

b) Discuss Prim's Algorithm for minimum spanning tree

4. a) Explain NP-Complete and NP-Hard problems

(OR)     15M

b) Explain the Traveling Salesman Problem using the branch and bound technique

SECTION-B (5X3-15 Marks)

5. Answer any FIVE questions of the following

a) Define Space and Time Complexity

b) Bubble Sort

c) Binary Tree Traversals

d) Topological Sorting

e) Notion of the Heap

f) Define Greedy Method

g) Decision Trees

h) 4-Queens Problem