Lecture Notes || SNS Courseware

Lecture Notes

UNIT 1:

INTRODUCTION TO DATA STRUCTURES

Linked List

Linked List – Array Based Implementation

Linked List Based Implementation

Doubly Linked List Based Implementation

Circular Linked List Based Implementation

Stack Based Implementation

Queue Based Implementation

Tree

UNIT 2:

Binary search tree ADT

AVL Trees

AVL Trees-Problems

Binary heaps

B Tree and B+ Tree

Applications of trees

Huffman Tree

UNIT 3:

Graphs

Topological sort

BFS

DFS

Shortest path Algorithm

Euler Circuit

Biconnectivity

UNIT 4:

Hashing

Separate chaining

Open addressing

Rehashing

Extendible hashing

Disjoint Set ADT

Dynamic equivalence problem

Smart union algorithms