QUESTION BANK CLASS TEST 2

DATA STRUCTURE USING C(22317)

CO/IF
2 MARKS
1. Describe given two types of graphs : Directed and Undirected graph

2. Define : (i) General tree (ii) Binary tree

3. Explain the following terminologies with respect to graph :(i)In degree (ii) Out degree (iii)
Successor (iv) Predecessor
4. Describe circular linked list with suitable diagram. Also state advantage of circular linked list
over linear linked list.

5. Draw tree for given expression (2b + 5c)2 (4d – 6e)5

6. Define the following terms w.r.t. tree : (i) In-degree, (2) Out-degree

OR

7. Draw an expression tree for the following expression : (a – 2b + 5c)2 * (4d = 6e)5
8. Differentiate between tree and graph
9. Compare Linked List and Array.
4 MARKS
1. For the following graph : (i) Give adjacency matrix representation (ii) Give adjacency list
representation

2. Construct a binary search tree for following elements : 22, 27, 14, 31, 40, 43, 44, 10, 20, 35 Show
each step of construction of BST.
3. Write an algorithm to insert a new node at the beginning of a Singly linked list. Give example

4. Write an algorithm to search an element in linked list.

5. Create a Singly linked list using data fields 70, 50, 30, 40, 90. Search a node 40 from the singly
linked list & show procedure step-by-step with the help of diagram from start to end.

6. Draw a binary search tree for the given numbers : 50, 33, 44, 22, 77, 35, 60, 40.
7. Construct a singly linked list using data fields 21, 25, 96, 58, 74 and show procedure step-by-step
with the help of diagram start to end
8. Consider the graph given in following figure and answer given questions.

9. Show with suitable diagrams how to delete a node from singly linked list at the beginning, in
between and at the end of the list.
10. Perform Inorder, Preorder and Postorder traversal of the binary tree shown in figure below.