Scribd
Upload
53 views5 pages

DS QB

DS QB for IAE 1

Uploaded by

jeelearning2405
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
53 views5 pages

DS QB

DS QB for IAE 1

Uploaded by

jeelearning2405
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/ 5

DS QB

THEORY:

1. Define Binary Search Tree. Discuss the cases of Deletion of


node in a binary search tree with examples.
2. Explain various methods to represent a Graph in the memory
with example.
3. Define Graph and Explain various Graph representation
techniques.
4. Differentiate between B-Tree and B+ Tree.
5. Differentiate between linear search and Binary search

WRITE A PROGRAM:

1. WAP to search a node of a doubly linked list.


2. WAP to perform following operations on circular linked
list
I. Insert the node at the end of list
II. Delete the first node
III. Count no of nodes
IV. Display the list

3. Write a program for polynomial addition using Linked


list.
4. Write a C Program to DFS Traversal of Graph. explain
DFS Traversal with suitable example.

NUMERICALS:

1. 2.Construct AVL Tree for


67,34,90,22,45,11,2,78,37,122.
2. Construct Huffman Tree. And Find Huffman codes
for each symbol given below.

Symbol P G E R I

Frequency 20 17 33 25 40

3. Construct a Binary Search Tree from the given


Traversal Sequence.
i. Inorder - DEBACFGIHJ
Preorder - FEDCBAGHIJ
ii. Inorder DBHEIAFJCG
Post Order BHIEBJFGCA

4. Construct B-Tree of Order 3. By inserting following


elements given as 77,97,75,64,53,14,26,49,82,59.
Show the B tree at each step of the insertion
Insert the given elements in the given B-Tree.

87,94,59,98,63,7,27

5. Apply Linear Probing and Quadratic Probing Hash


Functions to insert values in the hash table of size
ten.
show the number of collisions occur in each
technique.
27,72,63,42,36,18,29,101.

6. What is collision? Using linear probing insert the


following values in the Hash table of size eleven and
count no of collisions.

83,53,64,25,39,96,12,71

7. Construct B+ tree of Order 3 for the following data


set.

90,27,7,9,18,21,3,4,16,11,1,72
8. Write BFS Algorithm, Show BFS traversal for the
following directional graph with all the steps.

9. Construct Binary Search Tree for Following list of


elements
45,28,34,63,87,76,31,11,50,17.

10. Construct Expression Tree for the following


Expression Tree. (A+B/C) + ((D*E+F)/G)

Give the Output of Tree when in order of Preorder,


Postorder.

You might also like