Note for Data Structure and Algorithms - DSA By Lovely Kiitian

Terminologies, Classifications, Operations, ADT, Algorithm and its Properties, Efficiency, Loops, Notations

Structures in C, Strings in C, Pointers, Pointers and Structures, Pointers and Functions, Pointers and Arrays, Memory management in C, Hash Tables

Terminologies, 1D Array, Operations on an Array, 2D Array, Address calculation, Matrix, Sparse Matrix, Operations on Matrix

Array vs Linked List, Single Linked List, Representation and Types, Operations on Single linked list, Header linked list, Circular linked list, Double Linked list

Operations on Stack, Representation of Stack, Linked list and Array implementation, Multiple Stack, Applications, Recursion, Infix, Postfix and Prefix, Towers of Hanoi

Operation an Queue, Representation of queue, Array and linked list implementation, Circular Queue, De-queue, Priority queue

Application of Tree, Binary Tree, Terminology, Expression Tree, Complete and Strict Binary Tree, Representation of Tree, Tree Traversal, Threaded Binary Tree, Conversion, BST and Its Operation, AVL Tree, Rotations, Single and Double Rotation, Operations on AVL

B-Tree and Its properties, Operations, Creation of B-tree with specific Order, Non-recursive algorithm for tree traversal, Construction of Binary Tree

Introduction to graph, terminologies, Graph Representation, Graph operation- Search and Traversal

Selection sort, Bubble sort, Insertion sort, Quick sort, Merge sort and heap sort, hashing, Commonly used hash functions, Collision, Open and Closed hashing