This document contains an index of data structures and algorithms topics including sorting methods, searching techniques, stacks and queues implementations, linked lists, binary search trees, heaps, hashing, and graphs. It lists common sorting algorithms like bubble sort, insertion sort, and selection sort. It also includes topics like sequential and binary search, stack and queue implementations using arrays and linked lists, linked list operations, binary search trees, min and max heaps, hashing methods and collision resolution, and graph representations and algorithms for shortest path and minimum spanning trees.
This document contains an index of data structures and algorithms topics including sorting methods, searching techniques, stacks and queues implementations, linked lists, binary search trees, heaps, hashing, and graphs. It lists common sorting algorithms like bubble sort, insertion sort, and selection sort. It also includes topics like sequential and binary search, stack and queue implementations using arrays and linked lists, linked list operations, binary search trees, min and max heaps, hashing methods and collision resolution, and graph representations and algorithms for shortest path and minimum spanning trees.
This document contains an index of data structures and algorithms topics including sorting methods, searching techniques, stacks and queues implementations, linked lists, binary search trees, heaps, hashing, and graphs. It lists common sorting algorithms like bubble sort, insertion sort, and selection sort. It also includes topics like sequential and binary search, stack and queue implementations using arrays and linked lists, linked list operations, binary search trees, min and max heaps, hashing methods and collision resolution, and graph representations and algorithms for shortest path and minimum spanning trees.
No. 1. Sorting a. Bubble Sort b. Insertion Sort c. Selection sort d. Shell sort e. Radix Sort 2. Searching a. Sequential Search b. Binary Search 3. Stacks & Queues a. Array implementation b. Stack- Linked List implementation c. Ordinary Queue d. Circular queue e. Double ended queue f. Queue- Linked List implementation g. Evaluation of postfix expressions h. Balancing of parenthesis i. BFS 4. a. Implementation of singly LINKED LISTS b. Implementation of two singly LINKED LISTS c. Implementation of Circular Linked List d) Two Singly Linked Lists to Merge, Append, Union, Intersection e) Implementation of doubly LINKED LISTS 5. BINARY SEARCH TREES 6. HEAP a) MinHeap b) MaxHeap 7. HASHING a. Methods for Hashing b. Method for Collision Resolution 8. GRAPHS a) Represent a graph using the Adjacency Matrix b) Find the Shortest Path in a Graph using Warshall’s Algorithm c) Find the Minimum Spanning Tree (using ANY method Kruskal’s Algorithm or Prim’s Algorithm)