Introduction to Data Structures and Algorithms
-
Data Structures and Algorithms (4:20)
-
Measuring Running time of Algorithms (3:06)
-
Asymptotic Analysis (3:13)
-
Big O Notation (3:40)
-
Finding Big O (4:24)
-
Tight and Loose Upper Bounds (1:29)
-
Big O analysis of Algorithms (2:05)
-
Finding Time Complexity (2:56)
-
Big O analysis of Algorithms: Examples (6:59)
-
Worst case, Best case and Average Case Analysis (4:09)
-
Common Complexities (3:03)
-
Abstract Data Types (5:05)
Linked List
-
Introduction (10:18)
-
Traversing and Searching a Single Linked List (9:08)
-
Finding pointers in a Single linked list (5:12)
-
Insertion in a Single Linked List (7:27)
-
Insertion in a Single Linked List..contd (8:39)
-
Deletion in a Single Linked List (6:58)
-
Copy Constructor, Destructor and Assignment Operator (9:51)
-
Reversing a Single Linked List (3:05)
-
Finding and Removing a cycle in a Linked list (12:53)
-
Sorting a Linked list using Bubble Sort (9:01)
-
Merging of sorted Linked lists (14:03)
-
Sorting a Linked list using Merge Sort (5:05)
-
Doubly linked list (3:51)
-
Insertion in a doubly linked List (8:06)
-
Deletion from doubly linked list (5:52)
-
Reversing a doubly linked list (3:19)
-
Circular linked list (3:36)
-
Insertion in a circular Linked List (6:10)
-
Deletion in a circular linked list (4:03)
-
Concatenation (4:28)
-
Linked List with Header Node (5:32)
-
Sorted linked list (6:42)
Stack and Queue
-
Introduction (2:09)
-
Stack (1:29)
-
Array Implementation of Stack (7:44)
-
Linked List Implementation of Stack (4:44)
-
Queue (1:13)
-
Array Implementation of Queue (8:09)
-
Circular Queue (8:34)
-
Linked List implementation of Queue (4:56)
-
Queue through Circular Linked List (3:04)
-
Deque (9:10)
-
Priority Queue (2:59)
-
Checking validity of an expression containing nested parentheses (6:35)
-
Evaluating Arithmetic Expressions (3:21)
-
Polish Notations (5:56)
-
Converting infix expression to postfix expression (11:37)
-
Evaluation of postfix expression (4:13)
Recursion
-
Introduction (2:38)
-
Flow of control in Recursive functions (2:09)
-
Winding and unwinding phase (1:12)
-
Factorial (3:39)
-
Printing numbers from 1 to n (2:35)
-
Sum of digits of an integer (3:45)
-
Base conversion (2:41)
-
Finding nth power of a number (2:05)
-
Euclids Algorithm (3:16)
-
Fibonacci Series (2:46)
-
Tower of Hanoi (6:58)
-
Tail recursion (2:52)
-
Recursion vs. Iteration (1:26)
Binary Tree
-
Introduction to Trees (6:01)
-
Binary Tree (6:48)
-
Strictly Binary Tree and Extended Binary Tree (5:15)
-
Full binary tree and Complete Binary Tree (4:58)
-
Array Representation of Binary trees (3:26)
-
Linked Representation of Binary Trees (2:06)
-
Binary Tree in C++ (2:22)
-
Traversal in Binary Tree (2:06)
-
Preorder Traversal (5:12)
-
Inorder Traversal (5:07)
-
Postorder Traversal (4:40)
-
Level order traversal (4:26)
-
Finding height of a Binary tree (3:07)
-
Constructing Binary tree from Traversals (1:35)
-
Constructing binary tree from inorder and preorder traversals (4:23)
-
Constructing binary tree from postorder and inorder traversals (3:48)
Binary Search Tree
Heap
Sorting
-
Introduction (5:02)
-
Sort Stability (2:25)
-
Selection Sort (1:49)
-
Selection Sort Example (1:18)
-
Selection Sort in C++ (3:21)
-
Analysis of Selection Sort (2:20)
-
Bubble Sort (2:24)
-
Bubble Sort in C++ (4:34)
-
Improvement in Bubble Sort (2:16)
-
Analysis of Bubble Sort (2:04)
-
Insertion Sort (2:37)
-
Insertion Sort Example (2:22)
-
Insertion Sort in C++ (3:32)
-
Analysis of Insertion sort (4:40)
-
Shell Sort (2:23)
-
Shell Sort Example (2:07)
-
Shell Sort in C++ (3:31)
-
Analysis of Shell Sort (3:29)
-
Merging two Sorted Arrays (6:26)
-
Recursive Merge Sort (2:29)
-
Recursive Merge Sort in C++ (3:28)
-
Analysis of Merge Sort (0:36)
-
Iterative Merge Sort (1:31)
-
Iterative Merge Sort in C++ (2:47)
-
Quick Sort (6:56)
-
Quick Sort in C++ (6:56)
-
Analysis of Quick Sort (3:00)
-
Binary tree sort (3:05)
-
Binary Tree Sort in C++ (2:20)
-
Analysis of Binary Tree Sort (1:14)
-
Heap Sort : C++ implementation and Analysis (1:55)
-
Radix Sort (4:17)
-
Radix Sort : C++ implementation and Analysis (5:40)
-
Address Calculation Sort (4:50)
-
Address Calculation Sort in C++ (2:41)
-
Analysis of Address Calculation Sort (1:02)
Searching
Hashing
-
Direct Addressing (4:17)
-
Hashing (6:26)
-
Collisions (2:10)
-
Hash Functions (9:13)
-
Open Addressing : Linear Probing (10:48)
-
Open Addressing : Quadratic Probing (7:40)
-
Open Addressing : Double Hashing (9:21)
-
Deletion in Open Addressed Tables (5:23)
-
Implementation of Open Addressing (7:14)
-
Separate Chaining (6:54)
-
Implementation of Separate Chaining (5:29)
