|
Introduction to Asymptotic Notations & Analysis
|
|
|
|
Lecture 1: Introduction to Asymptotic Analysis (Part-1)
|
|
|
|
Lecture 2: Aysmptotic Notations (Part-2)
|
|
|
|
Lecture 3: Asymptotic Notations (Part-3)
|
|
|
|
Correction
(4 pages)
|
|
|
|
Lecture 4: GATE PYQs on Asymptotic Notations
|
|
|
|
Lecture 5: Time Complexity of Loops
|
|
|
|
Correction in the below Question from previous lecture
(2 pages)
|
|
|
Linked List
|
|
|
|
Lecture 1: Introduction to Linked Lists
|
|
|
|
Lecture 2: Operations on Linked Lists
|
|
|
|
Lecture 3: Recursion on Linked List
|
|
|
Stacks & Queues
|
|
|
|
Lecture 1: Stack and its Applications
|
|
|
|
Lecture 2: Stack GATE PYQs
|
|
|
|
Lecture 3: Queue and its Applications
|
|
|
|
Lecture 4: Stack & Queue Conversion | GATE PYQs
|
|
|
|
Lecture 5: GATE PYQs Solutions
|
|
|
Trees
|
|
|
|
Lecture 1: Introduction to Trees
|
|
|
|
Lecture 2: Binary Tree Properties & GATE PYQs
|
|
|
|
Lecture 3: Representation of Binary Trees
|
|
|
|
Lecture 4: Tree Traversals
|
|
|
|
Lecture 5: Tree Traversals Part-2
|
|
|
|
Lecture 6: Binary Search Trees Part-1
|
|
|
|
Lecture 7: BST Part-2
|
|
|
|
Lecture 8: AVL Tree Part-1
|
|
|
|
Lecture 9: AVL Tree Part-2
|
|
|
|
Lecture 10: AVL Tree Part-3
|
|
|
|
Lecture 11: Heap Part-1
|
|
|
|
Lecture 12: Heap Part-2
|
|
|
|
Lecture 13: Heap Part-3
|
|
|
Graphs
|
|
|
|
Lecture 1: Introduction to Graphs
|
|
|
|
Lecture 2: DFS & BFS -- Graph Traversal Algorithms
|
|
|
|
Lecture 3: Topological Sorting & Dijkstra's Algorithm
|
|
|
Searching & Hashing
|
|
|
|
Lecture 1: Searching Algorithms (Linear & Binary Search)
|
|
|
|
Lecture 2: Hashing (Part-1)
|
|
|
|
Lecture 3: Hashing (Part-2)
|
|
|
|
Lecture 4: GATE PYQs on Hashing
|
|
|
Sorting Algorithms
|
|
|
|
Basic Sorting Algorithms
|
|
|
|
Lecture 1: Insertion, Bubble & Selection Sort
|
|
|
|
Divide & Conquer based Sorting Algorithms
|
|
|
|
Lecture 2: Merge Sort
|
|
|
|
Lecture 3: Quick Sort
|
|
Launch your Graphy