Data Structure and Algorithm

Introduction to Algorithm

Data Structure and Types

Operations of Data Structure

Performance Analysis of Algorithm

Abstract Data Type (ADT)

Algorithm Design and Techniques

Asymptotic Notations, Big Oh, Omega and Theta Notation

Recursion Data Structure

Principles of Recursion

Types of Recursions

Tower of Hanoi (TOH) using Recursion

Fibonacci Series

Applications of Recursion

Stack Data Structure

Stack Operations

Applications of Stack

Infix, Prefix and Postfix Conversion in Stack

Queue Data Structure

Queue Operations

Types of Queues

Circular Queue

Priority Queue

Double-Ended Queue (Deque)

Applications of Queues

Linked List Data Structure

Operation of Link List

Singly Linked List

Doubly Linked List

Circular Singly Linked List

Circular Doubly Linked List

Tree Data Structure

Binary Tree

Binary Tree Traversal

Binary Search Tree

AVL Tree (Balanced Tree)

B-Tree

Splay Tree

Huffman Coding Algorithm

Sorting Data Structure

Insertion Sort

Selection Sort

Quick Sort

Shell Sort

Bubble Sort

Merge Sort

Binary Sort (Binary Insertion Sort)

Heap Sort

Radix Sort

Bucket Sort

Linear Search

Binary Search

Hashing Data Structure

Separate Chaining Collision Technique

Linear Probing Collision Technique

Quadratic Probing Collision Technique

Double Hashing Collision Resolution

Rehashing

Extended Hashing

Graph Data Structure

Types of Graph

Graph Representations

Spanning Tree and Minimum Spanning Tree

Depth First Search (DFS)

Breadth First Search (BFS)

Kruskal's Algorithm

Prim’s Algorithm

Dijkestra's Algorithm

Greedy Algorithm

Divide and Conquer Algorithm

Dynamic Programming

Randomized Algorithm

Backtracking Algorithm