Topics

UNIT 1 - Introduction to Data Structures

1 - Introduction to DS and Abstract data types - click here

2 - Array - Implementation, Insertion, deletion and searching operations - click here

3 - Stack - Implementation, Insertion, deletion and searching operations - click here

4 - Linked list - singly linked list implementation, Insertion, deletion and searching operations on linked list - click here

5 - Queues - Implementation, Insertion, deletion and searching operations - click here

UNIT 2 - Dictionaries and Hash Table

1) Dictionaries:  - Definition, Implementation - click here

 

2) Hash Table Representation: 

Hash functions - click here

Collision resolution Techniques - click here

Rehashing - click here

Extendible hashing - click here


UNIT 3 - Search Tree and AVL Tree

Search Tree: 

Binary Search Tree - Definition, Implementation - click here

Binary Search Tree Operations- Searching, Insertion and Deletion - click here

Binary Search Tree (BST) Traversals – Inorder, Preorder, Post Order - click here

Convert a normal BST to Balanced BST - click here


AVL Trees: 

AVL Trees - Definition, Height of an AVL Tree, AVL vs Balanced BST- click here

Red –Black Trees - click here

Splay Trees - click here


UNIT 4 - Graphs

Graphs: 

Graphs Introduction and Implementation - click here

Graph Traversal Methods - click here

Sorting:

Bubble Sort - click here

Selection Sort - click here

Insertion Sort - click here

Quick Sort - click here

Merge Sort - click here

UNIT 5 - Pattern Matching

Pattern Matching and Tries:


Pattern matching algorithms-Brute force - click here

The Boyer –Moore algorithm - click here

The Knuth-Morris-Pratt algorithm - click here

Standard Tries, Compressed Tries, Suffix tries - click here