Scribd
Upload
24 views2 pages

IA2-Question Bank Ds

Uploaded by

Ann Elizabeth Thomas
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
24 views2 pages

IA2-Question Bank Ds

Uploaded by

Ann Elizabeth Thomas
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/ 2

Data Structures and Applications

Question Bank-IA2
2024-2025
Sem:3 Sec: ’C’
1.Develop C function to perform the following operations
i). Concatenation of two single linked list
ii), Find the length of single linked list

2. Write C function for the following operations on doubly linked linked list
i). Insert an element at front ii). Delete an element from front iii). Search an item

3. Describe different types of binary tree with example

4. Prove that:
a) The maximum number of nodes on level i of a binary tree is 2i, i ≥ 0.
b). The maximum number of nodes in a binary tree of depth k is 2k -1, k ≥ 1.

5.Write the recursive function for : i )inorder ii)preorder iii) postorder.also find preorder,
inorder and postorder sequence for the following binary tree

6. Given the following traversal, draw binary tree


i)Inorder:4 2 5 1 6 7 3 8 Postorder:4 5 2 6 7 8 3 1
ii).Preorder: F A E K C D H G B Inorder: E A C K F H D B G

7. Develop C functions to insert an item into BST and construct BST step by step for the
given data 100,85,45,55,110,20,70,65,113,145,132,96.

8. Develop recursive C function for implementing


i). Iterative search in BST
ii). Recursive search in BST
9.Explain selection tree with an example.

10.What is forest? Explain the steps how forest can be converted into binary tree with an
example. Write the recursive steps of forest traversal.

11.Show adjacency matrix and adjacency list representation of the given graph

12.write C function for DFS, also apply DFS and BFS traversal for the following graphs.

13. Give the difference between BFS and DFS.

14.Describe the types of leftist tree with an example.

15.Explain Different types of hash functions with an example.

16.what is collision? What are the methods used to resolve collision?

17. Explain linear probing. also apply linear probing for the given hash table of size 10 to
insert the keys 72, 27, 36, 24, 63, 81, 92, and 101 into the table.
(Take h(k) = k mod m, m = 10).

You might also like