Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
72 views1 page

Data Structures Mid-2 Imp Questions

Uploaded by

rakeshpasuladi12234
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
72 views1 page

Data Structures Mid-2 Imp Questions

Uploaded by

rakeshpasuladi12234
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/ 1

Data Structures

UNIT-3

1. What is AVL tree? Explain the rotations by inserting the given data 63,
9, 19, 27, 18, 108, 99, 81.
2. List out the properties of B-Tree and Construct a B-Tree with following
data 5,3,21,9,13,22,7,10,11,14,8,16
3. What is the importance of Red-Black Tree? Create a Red-Black Tree
with the following sequence of numbers 8, 18,5,15,17,25,40 and 80.
4. Explain the insertion and deletion operation in B+ Tree for the
following data 1, 3, 5, 7, 9, 2, 4, 6, 8, 10

UNIT-4

1. Explain DFS graph Traversal method with an example.


2. Explain BFS graph Traversal method with an example.
3. Write a brief note on external sorting.
4. Differentiate Max-Heap, Min-Heap and explain Heap Sort with an
example.
5. What is mean by sorting? Illustrate the concept of Quick sort with an
example.
6. What is a Merge Sort and sort the following array {14, 7, 3, 12, 9, 11,
6, 12}.

UNIT-5

1. Explain pattern matching algorithms.


2. Explain in detail of boyer-moore algorithm.
3. Explain the Knuth-Morris-Pratt algorithm.
4. Give the applications pattern matching.
5. Explain the brute force pattern matching algorithm.
6. Distinguish between standard and compressed tries.
7. Explain about suffix tries with an example.

You might also like