Unit 1: Hashing

a. Hashing:

b. Extensible Hashing:

Concept & Example

c. Skip List:

Concept

Code

Unit 2: Tree

a.

Unit 3: Graph

a. Dijkstra's Shortest Path Algo:

Concept

Example

b. Minimum Spanning Tree:

Prim's Algo

Kruskal's Algo

b. Topological Sorting:

Concept and Example

Unit 4

a. Splay Tree

Concept

Construction and Operation

Example

b. AA Tree - Concept and Construction with example

Deletion in AA tree

c. AVL Tree

Example

Unit 5: Multi Dimensional Tree

a. B Tree - Concept and Properties

Insertion in a B Tree with Example

Deletion in a B-Tree, Deletion (Part B)

Unit 6: File Handling

Unit 1: Basic Concepts

Unit 2: Data Encryption Techniques

a. Block Mode of Operations

ECB & CBC

Feedback Mode