PART – B

DATA STRUCTURES

PART – B QUESTIONS

Previous Next

1.i) Write the algorithm for insertion sort and demonstrate with an example.

ii) Sort the following nos.:43,32,16,7,-10,120,45,2,54,71,96 using Radix sort.

2.i) What are the advantages and disadvantages of various basic searching methods?

ii) Write algorithm to insert a node in the binary search tree and demonstrate.

3.i) Write an algorithm to perform exchange sort procedure on the given set of integers and discuss its time complexity.

ii) Sort the following integers using heap sort procedure:
17,8,3,11,342,5,23

4i) What is binary search tree? Explain it with suitable example. Write an algorithm to search an element in the binary search tree.

ii) Explain about any two hashing functions in detail with example.

5) Explain the Quick sort algorithm. Using this algorithm sort the following numbers:
15,97,13,28,101,188,5,3,1,56,54

6.i) Differenciate between Heap sort and Radix sort.
ii) Explain insertion sort algorithm .

7.i) Explain selection sort in detail.
ii) Explain sequential search with example

8.i) Explain binary search in detail.

9. i) Discuss the various representations of a binary tree in memory with suitable example. ii).What are the basic operations can be performed on a binary tree?Explain each of them in detail with suitable example.

Previous Next