Skip to content
Increase Font Size
Toggle Menu
Home
Read
Sign in
Search in book:
Search
Contents
Front Matter
1.
Introduction to Abstract Data Types
2.
List and List ADT
3.
Array Implementation of List ADT
4.
Linked List Implementation of List ADT
5.
Analysis of Algorithms
6.
Design of Algorithms
7.
Stack ADT
8.
Implementation of Stack ADT
9.
Applications of Stacks - I
10.
Applications of Stacks II
11.
Queue ADT
12.
Implementation of queue ADT
13.
Applications of Queue ADT
14.
Priority Queue and Applications
15.
Priority Queue and Heaps
16.
Dictionary ADT
17.
Hashing and Hashing Functions
18.
Hashing and Collisions
19.
Tree ADT -I
20.
Tree ADT - II
21.
Binary Search Trees-I
22.
Binary Search Trees-II
23.
Balanced Binary Search Trees and AVL Trees
24.
Insertion and Deletion - AVL Trees
25.
Red Black Trees -I
26.
Red Black Trees -II
27.
Splay Trees
28.
Multi-Way Trees and 2-3 Trees
29.
2-3-4 Trees
30.
B Trees
31.
Tries
32.
Introduction to Graphs
33.
Graph ADT and Graph Traversals
34.
Minimum Spanning Trees-I
35.
Minimum Spanning Trees- Kruskal AIgorithm
36.
Minimum Spanning Trees –Prim’s algorithm
37.
Topological sorting
38.
Topological Sorting as an Application of DFS
39.
Shortest Path Algorithm - I
40.
Shortest Path Algorithm II
Back Matter
Data structures
17
Hashing and Hashing Functions
