Scribd
Upload
9 views1 page

QuestionBank2 DS

Uploaded by

disha1106tandel
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
9 views1 page

QuestionBank2 DS

Uploaded by

disha1106tandel
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

1.

Write recursive C functions for inorder, preorder and postorder traversals of a binary
tree.
2. Problems related to inorder, preorder, postorder traversals (…Given tree..).
3. Define Binary tree. Explain the representation of a binary tree with a suitable example.
4. Define the Threaded binary tree. Construct Threaded binary for the following elements:
(…Given elements…).
5. Define complete, full, and skewed binary trees with proper examples.
6. Design an algorithm to traverse a graph using Depth First Search (DFS) and Breadth
First Search (BFS). Apply DFS and BFS for the graphs given (…Given Graph…..).
7. Construct a binary tree from the Post-order and In-order sequence given. (From Pre-
order and In-order)
8. Define Binary Search tree. Construct a binary search tree (BST) for the given elements:
(…Given Elements..) Traverse using in-order, pre-order, and post-order traversal
techniques.
9. Define the Disjoint set. Consider the tree created by the weighted union function on the
sequence of unions: union(0,1), union(2,3), union(4,5), union(6,7), union(0,2),
union(4,6), and union(0,4). Process the simple find and collapsing find on eight finds
and compare which find is efficient.
10. What is chained hashing? Discuss its pros and cons. Construct the hash table to insert
the keys: (……Given keys……) in a chained hash table of 9 memory locations. Use
h(k) = k mod m.
11. Define the leftist tree. Give its declaration in C. Check whether the given binary tree is
a leftist tree or not (…Given tree…). Explain your answer.
12. What is dynamic hashing? Explain the following techniques with examples:
i) Dynamic hashing using directories
ii) Directory less dynamic hashing
13. Define min Leftist tree. Meld the given min leftist trees. (…Given 2 trees….)
14. Define forest. Transform the given forest into a binary tree. (…Given forest..)
15. Show the adjacency matrix and adjacency list representation of the given graph.
(…Given graph...)
16. What is collision in hashing? What are the methods to resolve collision? Explain any
one with proper example.
17. Explain optimal binary search tree with example.

You might also like