Scribd
Upload
28 views3 pages

Unit-II - ADS - IMP QP

Uploaded by

varuntejasingampalli2005
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
28 views3 pages

Unit-II - ADS - IMP QP

Uploaded by

varuntejasingampalli2005
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

II B.

Tech I Sem ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

UNIT-II

Important Question Bnak

Short Questions:
1 Define Maxheap with example.
2 Define Minheap with example.
3 Write the applications of heap trees.
4 Define Graph.
5 Define connected components.
6 Define biconnected components
7 Write the applications of Graphs.
8 Explain about divide and conquer.
9 Write general method of divide and conquer.
10 Write the applications of Convex hull

Essay Questions:
1 Explain about max heap algorithm and Create the following elements35,33,42,10,14,19,27,44,26,31.

2. List the operation of Heap.

3. Explain about min heap algorithm and Create the following elements 44,33,77,11,55,58,66

4.Briefly explain about Graph terminology.

5.Briefly explain about Graph representations with examples.

6. Apply graph traversal technique DFS for the following graph.

Page | 1
II B.Tech I Sem ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

7.Apply graph traversal technique BFS


FS for the following graph.

8.Explain
Explain Quicksort Algorithms with example.

9.Explain
Explain Merge sort Algorithms with example.

10.Explain
Explain in detail about convex hull.

11.Explain
Explain in detail about stresses’ matrix multiplication.

12.Apply
pply merge sort technique for the word “EXAMIN
“EXAMINATIONS”.

13.Apply
Apply graph traversal technique DFS for the following graph .

14.Exaplain about heap Insertion and inserting 60 element in the below heap tree with formulaized step by step
process.

Page | 2
II B.Tech I Sem ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS

15.Exaplain
Exaplain about heap Deletion and Delete 50 element in the below heap tree with formulaized step by step process.

16.Check whether it is a Bi-Connected


Connected graph or Not?

Page | 3

You might also like