lOMoARcPSD|51180532
question paper ADS
Advanced Data Structure (Anna University)
Scan to open on Studocu
Studocu is not sponsored or endorsed by any college or university
Downloaded by student mca (
[email protected])
lOMoARcPSD|51180532
Part-C: 1x 15 =15 Marks
Explain the Concept of MinimumSpanningTree. How do you obtain the MST for Given
tree using PRIMSAlgorithm?Explain the flow of Algorithmfor the Given Example
10
A 15 K2 CO6
2 6
16
or
B |Write an Algorithm to perform Matrix Chain MultiplicationUsing Dynamic Programming. 15 K2 CO6
Validate the Correctnessof the Algorithm with an Example
lOMoARcPSD|51180532
Register Number
A
Karpaga VinayagaCollege of Engineering and Technology
308, ChengalpattuDistrict
GST Road, Chinna Kolambakam- 603
MODEL-IAT-||: 2023-24::0DDsemester
Max. Marks 100
MCA/ Master ofComputer Applications
Semester: 01 R2021 Date:
Time :3 Hours
MC4101 :Advanced Data Structuresand Algorithms
BL1 -Remembering BL3 -Applying BL5 -Evaluating
Blooms Taxonomy Levels (BL)
BL2 -Understanding BL4 -Analyzing BL6-CreatingMarks zzzZZZ
BL CO
No Part-A: Answer AIlQuestions. 10 x 2 = 20 Marks
2 K1 CO1
List the measure to evaluatethe performanceof an Algorithm
2 Define Recursion K1 COI
2 KI CO2
|Outlinea Binary Tree withan Example
4 What is ared black tree? Give Example 2 K1 CO2
Outline a directed graph with an Example 2 KI CO3
6 What is minimum SpanningTree? 2 Kl CO3
2 Ki
7 Distinguishbetween Greedy and Dynamic Programming CO4
8 What is memorizationin dynamic Programming?Why do we use it? 2 KI CO4
9 Define P and NP Class Problems 2 K1 CO5
10 How do you prove a problem in NP-Complete 2 KI CO5
Part-B: Answer AllQuestions. 5x 13 = 65 Marks
A Elaboratethe Substitutionmethod for solving recurrenceswith an example 13 Ki COi
11
B Define Asymptotic analysis of Algorithms. Describe Asymptotic Notations and its 13 K1 COi
|importance'sin the analysis with suitable illustrations.
|(i)Writethe procedureto insert a given node Z in a binary search Tree.(5)
A (ii)Give the Properties of Red-Black Tree. Write the Procedure to delete a node from red 13 KI CO2
12
black Tree.(8)
B |(i)Givethe Propertiesof Btree.Write the procedureto insert a node into a Fibonacci Heap(8) 13
(i)Discussthe procedureto insert a node into aFibonacciHeap(5) KI CO2
A Outline the steps in the DijikstrasShortestpath Algorithm with an exampleand relevant 13 KI CO3
13
Diagrams
Or
BElaborateBFS and DFS traversal on a graph with an Example and relevant Diagram 13 KI CO3
A|List the elementsof dynamic Programming.Describeeach with suitable example 13 KI CO4
Or
14
(i)What is activity Selection Problem in Greedy Algorithm? Explain activity Selection
B Problem using a Greedy strategy with an Example (ii)Illustratethe construction of a 13 KI CO4
Huffman Code using an Example
A
Elaborate the Followingwith an Example NP COMPLETENESSand REDUCIBILITY
13 KI COS
15
Present an Example of aProblem that belongs to the class NP and also NP Hard AND COS
Ipresent an Elaborate note on the Same 13 KI
