Scribd
Upload
19 views1 page

Question Bank

DS question Bank

Uploaded by

Padiyappa Koogati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
19 views1 page

Question Bank

DS question Bank

Uploaded by

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

Maratha Mandal Engineering College, Belagavi

Department of Computer Science & Engineering


QUESTION BANK ON MODULE-3, 4, 5

1. With the C program explain how the elements are inserted and deleted from a doubly linked list
2. Write the following functions for singly linked list: i) Reverse the list ii)Concatenate two lists
3. Explain the concept of Sparse Matrix representation using linked lists. Represent the following
sparse matrix in linked list format.
0 0 0 3 4
5 0 7 0 8
0 0 0 0 0
0 2 6 9 0
4. Define tree? Explain the following with example i) Root node ii) Degree iii) Sibling
iv) Depth of a tree v) Ancestor vi)Internal & External Nodes
5. With an example, explain the different types of representation of tree.
6. Define a binary tree. With example show array and linked representation of binary tree.
7. Mention different types of binary trees and explain briefly.
8. Write the C-routines to traverse the tree using i) Inorder ii) Pre-order iii) Post-order iv)Level
order and write Inorder, Pre-order, Post-order & Level order traversal for the given tree

9. What is threaded binary tree? Write the rules to construct the threads. Explain with example.
10. Describe the binary search tree with an example. Write the iterative and recursive function to
search for a key value in a binary search tree.
11. Construct a binary search tree for the inputs 22, 14, 18, 50, 7, 6, 12, 32, 25, 14, 5, 6, 2, 18, 20, -1
12. Construct the binary tree (B-tree) from the given traversals: Preorder: A B D G C E H I F
In-order: D G B A H E I C F
13. State & Explain the properties of a binary tree in detail.
14. What is a graph? Write the terminologies used in graph.
15. Explain matrix and adjacency list representation of graphs with example.
16. Explain different graph traversal methods.
17. Explain selection tress with example.
18. Define forest. Explain rules to transform forest to binary tree with an example.
19. Write ADT for graph.
20. Define hashing. Differentiate static & Dynamic Hashing
21. Define hash function. Explain Hashing functions with example.
22. What is collision? What are the methods to resolve collision? Explain them with example.
23. Explain two types of Leftist Trees.
24. Obtain OBST for n=4, (a1,a2,a3,a4)=(do, if, int, while) where p1,p2,p3,p4=(3,3,1,1) and
(q0,q1,q2,q3,q4)=(2,3,1,1,1)
25. Write short note on priority queues.

You might also like