GateXAIML
100% Free GATE DA

Data Structures and Algorithms

12 Chapters 104 Video Lectures Notes + PYQs PDF
Your Progress 0 / 104 videos watched (0%)
Ch. 1 Ch. 2 Ch. 3 Ch. 4 Ch. 5 Ch. 6 Ch. 7 Ch. 8 Ch. 9 Ch. 10 Ch. 11 Ch. 12
Introduction to Data Structures & Algorithms
Analysis Framework
Asymptotic Notations
Big O Notation
Big Omega Notation
Big Theta Notation
Properties of Big O, Big $\Omega$ & Big $\Theta$
Little $o$ & Little $\omega$ Notation
Relationship Between $O$, $\Omega$, $\Theta$, $o$ & $\omega$
Worst, Best & Average Case Analysis
Analysis of Non-Recursive Algorithms
Recurrence Relations -- Base Case Method
Recurrence Relations -- Recursion Tree Method
Master Theorem
Analysis of Recursive Algorithms
Practice Problems on Time Complexity
GATE PYQs on Time Complexity
Stack and Stack Operations: Push, Pop & Peek
Applications of Stack $\vert$ Infix & Postfix Expressions
Applications of Stack $\vert$ Infix & Prefix Expressions
Applications of Stack $\vert$ Balanced Parentheses & Recursion
GATE PYQs on Stacks
Practice Problems on Stacks
Queue and Operations: Enqueue & Dequeue
Circular Queue
Circular Queue with One Slot Empty
GATE PYQs on Queues
Practice Problems on Queues
Introduction to Linked Lists
Singly Linked List Insertion: Head, Tail & Middle
Singly Linked List Deletion: Head, Value & Position
Singly Linked List Reversal: Iterative & Recursive
Doubly Linked List Insertion: Head, Tail & Position
Doubly Linked List Deletion: Head, Value & Position
Circular Linked List Insertion: Head, Tail & Position
Circular Linked List Deletion: Head, Tail & Position
Classic Problems in Linked Lists
GATE PYQs on Linked Lists
Problem Solving on Linked Lists
Introduction to Trees
Binary Trees
Binary Tree Traversal: Inorder, Preorder & Postorder
Tree Reconstruction: Inorder, Preorder & Postorder
Theorems & Properties of Binary Trees: Full, Perfect & Complete
Inorder Successor & Predecessor in BST
Binary Search Trees $\vert$ Properties, Insertion and Search
BST Deletion: All 3 Cases $\vert$ Leaf, One Child & Two Children
GATE PYQs on Binary Trees
GATE PYQs on Binary Search Trees
Practice Problems on Binary Trees & Binary Search Trees
Introduction to Hashing & Load Factor
Collision Resolution: Separate Chaining $\vert$ Hashing
Collision Resolution: Open Addressing & Linear Probing $\vert$ Hashing
Collision Resolution: Open Addressing & Quadratic Probing
Collision Resolution: Open Addressing & Double Hashing $\vert$ Hashing
Performance Analysis of Open Addressing & Separate Chaining
GATE PYQs on Hashing
Practice Problems on Hashing
Introduction to Graph Theory
Connected Graphs & Connected Components
Walk, Trail, Circuit, Path & Cycle
Graph Representation
Havel-Hakimi Theorem $\vert$ Graph Theory
GATE PYQs on Basics of Graph Theory
Practice Problems on Basics of Graph Theory
Breadth First Search & Properties
Depth First Search & Properties
Topological Sort (DFS Method & Kahn's Algorithm)
GATE PYQs on DFS, BFS & Topological Sort
Practice Problems on DFS, BFS & Topological Sort
Dijkstra's Algorithm: Single Source Shortest Path
Bellman-Ford Algorithm
Floyd-Warshall: All-Pairs Shortest Path & Transitive Closure
GATE PYQs on Shortest Paths
Practice Problems on Shortest Paths
Binary Search
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
GATE PYQs on Searching and Sorting
Practice Problems on Searching and Sorting
Practice Problems on Time Complexity
Practice Problems on Stacks
Practice Problems on Queues
Problem Solving on Linked Lists
Practice Problems on Binary Trees & Binary Search Trees
Practice Problems on Hashing
Practice Problems on Basics of Graph Theory
Practice Problems on DFS, BFS & Topological Sort
Practice Problems on Shortest Paths
Practice Problems on Searching and Sorting
GATE PYQs on Time Complexity
GATE PYQs on Stacks
GATE PYQs on Queues
GATE PYQs on Linked Lists
GATE PYQs on Binary Trees
GATE PYQs on Binary Search Trees
GATE PYQs on Hashing
GATE PYQs on Basics of Graph Theory
GATE PYQs on DFS, BFS & Topological Sort
GATE PYQs on Shortest Paths
GATE PYQs on Searching and Sorting