Scribd
Upload
14 views3 pages

Advanced Data Structure and Algorithm

The document outlines the examination structure for the Advanced Data Structures and Algorithms course, including parts A and B with specific questions on algorithm analysis, data structures, and complexity. It covers topics such as time and space complexity, B Trees, graph traversal, dynamic programming, and NP-Completeness. The exam consists of multiple-choice and detailed problem-solving questions aimed at assessing students' understanding of advanced data structures and algorithms.

Uploaded by

sobipunitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views3 pages

Advanced Data Structure and Algorithm

The document outlines the examination structure for the Advanced Data Structures and Algorithms course, including parts A and B with specific questions on algorithm analysis, data structures, and complexity. It covers topics such as time and space complexity, B Trees, graph traversal, dynamic programming, and NP-Completeness. The exam consists of multiple-choice and detailed problem-solving questions aimed at assessing students' understanding of advanced data structures and algorithms.

Uploaded by

sobipunitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ME Degree Examinations Jan/Feb - 2025

24PCS101 - ADVANCED DATA STRUCTURES AND ALGORITHMS


First Semester

Duration : 3 Hour Max Marks: 100

Part A
Answer All Questions
10X2-20

1. Analyze the timeand space complexity of the below code:


Function AlgorithmA(Array A):
n=Length(A)
For from 0 to n-1:
i

j
For from 0 to n-1:

Perforn Operation

2. Prove that if fn)-O(gn) and g(n)=o(f(n) then fn) =0(gn).


3. ldentify the usage of B Tree in Database Indexingand access.

4. For the set of keys {1,4,5, 10,16,17,21}Construct a binary search tree of height 3.

5. Compare Breadth First Search with Depth First Search.

6. Interpret the working principle of Floyd - Warshall


Algorithm.

7. Outline the sequence of steps to be followed in developing a dynamic programming algorithm.

8. Give an example of a problem that can be solved using a greedy algorithm.

9. Why is the satisfiability problem (SAT) important in NP-Completeness?

10. StateCook's theorem.

Part B
Answer AllQuestions
5X13=65

11. ai) Howefficiency ofan algorithm is measured? Describe in detail about Asymptotic notations with

examples.(7 Marks)

i)For T(n)=7T(n/2) +1 8n.Solve the recurrencerelation using Substitution method.(6 Marks)


OR
b. Differentiate best, worst and average case analysis with examples & diagrams. Also, Explain how it
can be performed forLinear Searching in an array.
12. a)ldentify the advantage of Red Black Tree over Binary Search Trees. Construct Red Black tree for th a
following sct of clements 10,12,1,14,6,5,8,1 5,3, 1,13 and 2. 16,

1
OR
byConstruct a B tree of order 5 by inserting the following clements:

3,t4,7,1,8S.H7,
B.6,23,12,20,26,446,18,24,25 and 19.

13. ayllustrate the working of Breadth - First and Depth - First traversal on a Graph with pseudocode and

example.

OR
byi. Write the all pair shortest path algorithm.(5 Marks)

i.Solve the below graph using the all pairs shortest path algorithm.(8 Marks)

4
3
2

5
9

qoenPeAore
14. á) Explain the algorithm to solve Matrix Chain Multiplication using Dynamic Programining with
efficiency.

OR
b) A character coding problem. A data file of 100,000 characters contains only the characters a-f, with
the frequencies indicated as below:

d e f

Frequency(in thousands) 45 13 12 16 9 5
Show the steps in constructing the Huffman Tree representing the optimal prefix code.

15. ay Elaboratethe following


()NP Completeness Problem

(ii) Reducibility

OR
b) Prove that if any NP-Compiete problen is poiynomiai-time solvable then P-NP.Equivalently,if any
problem in NP is not polynomial-time solvable, then no NP-complete problem is polynomial-time
solvable.
Parte
Amwer Al Oueatna

nA (lHHnnt the mmnnm qanng tee uing ink and KnkakAlehe SoreNoe A Ala
ind the w of the ree

hAplysuitable atyorthn to tind shortest path hom 'A' o every other node of Aforthe figure given

below

Also, write tlhe steps tor (ndig the slotext path

You might also like