×
Yes, you can do it.

# Note for Data Structure using C - DS By Bput Toppers

• Data Structure using C - DS
• Note
• Biju Patnaik University of Technology BPUT - BPUT
• Master of Computer Applications
• 6 Topics
• 340 Views
Bput Toppers
0 User(s)

#### Text from page-4

4 a. Create a binary search tree b. Traverse the tree in Inorder, Preorder and Post Order c. Search the tree for a given node and delete the node Write a program in C to implement insertion and deletion in tree. B 8. Write a program in C to implement insertion and deletion in AVL tree. 9. Write a menu driven program that implements Heap tree (Maximum and Minimum Heap tree) for the following operations. (Using array) Insert, Delete. 10. Write a program to implement double hashing technique to map given key to the address space. Also write code for collision resolution (linear probing) 11. Write a program in C to implement Dijkstras shortest path algorithm for a given directed graph. 12. Write a program in C to insert and delete nodes in graph using adjacency matrix. 13. Write a program in C to implement Breadth First search using linked representation of graph. 14. Write a program in C to implement Depth first search using linked representation of graph. 15. Write a program in C to create a minimum spanning tree using Kruskal’s algorithm. 16. Write a program in C to create a minimum spanning tree using Prim’s algorithm. 

#### Text from page-5

5 1 SORTING AND SEARCHING TECHNIQUES Unit Structure: 1.1 1.2 1.3 1.4 1.5 Sorting Searching Analysis of Algorithm Complexity of Algorithm Asymptotic Notations for Complexity Algorithms 1.1 SORTING Sorting and searching are the most important techniques used in the computation. When the history of computing might be defined ‘searching‘ and ‘sorting’ would have been at top. They are the most common ingredients of programming systems. The sorting techniques are classified as internal and external sorting. Here we are going to discuss the different sorting techniques such as bubble sort, selection sort, Insertion, Shell sorts and Sequential, Binary, Indexed Sequential Searches, Interpolation, Binary Search ,Tree Sort, Heap sort, Radix sort. 1.1.1 Insertion Sort It is one of the simplest sorting algorithms. It consists of N-1 passes. For pass P= 1 through N – 1, insertion sort ensures that the elements in positions 0 through P are sorted order. Insertion sort makes use of the fact that elements in positions 0 through P – 1 are already known to be in sorted order as shown in following table 1.1 Original 34 8 64 51 32 21 P=1 P=2 P=3 P=4 P=5 8 8 8 8 8 34 34 34 32 21 64 64 51 34 32 51 51 64 51 34 32 32 32 64 51 21 21 21 21 64 Positions Moved 1 0 1 3 4 Table 1.1 Insertion sort after each pass