Introduction To Data Structures
-
Intro To Data Structures (7:18)
-
Language To Be Used (3:26)
-
Datatypes (5:05)
-
Control Instructions (8:29)
-
Operators (9:10)
-
Pointers (16:49)
-
Types Of Pointers (6:54)
-
Call By Value (4:38)
-
Call By Reference (9:06)
-
Recursion (9:44)
-
Storage Classes (7:41)
-
Preprocessor Directives (6:15)
-
Arrays And Strings (8:14)
Analysis Of Algorithms
Searching
Sorting
Polynomials
Sparse Matrices
Linked Lists
-
Dynamic Memory Allocation (10:27)
-
Linked List (16:18)
-
Linked List Of Records (5:22)
-
Linked List Operations I (13:11)
-
Linked List Operations II (15:06)
-
Ascending Order Linked List (11:08)
-
Sorting A Linked List (7:44)
-
Reversing A Linked List (8:32)
-
Merging Linked Lists (10:02)
-
Concatenating Linked Lists (7:08)
-
Polynomial Addition Using Linked List (12:51)
-
Circular Linked List (16:51)
-
Doubly Linked List (11:07)
-
Sparse Matrix As A Linked List (10:21)
-
Recursive Count And Compare (11:55)
-
Recursive Copy And Append (8:32)
-
Unions (9:55)
-
Generalized Linked Lists (14:32)
-
Copying A Generalized List (8:41)
-
Depth Of A Generalized List (2:33)
-
Comparison Of Generalized Lists (5:26)
Stack And Its Applications
-
Stack Data Structure (6:16)
-
Implementation Of Stack (8:31)
-
Stack As A Linked List (14:12)
-
Types Of Expressions (3:31)
-
Infix To Postfix Conversion (11:25)
-
Infix To Prefix Conversion (8:54)
-
Prefix To Postfix Conversion (5:22)
-
Conversion Summary (7:45)
-
Implementation Of Infix To Postfix (11:38)
-
Implementation Of Prefix To Postfix (5:19)
-
Evaluation Of Postfix Expression (5:14)
-
Implementation Of Postfix Evaluation (7:17)
Queue Data Structure
Trees
-
Tree Data Structure (5:34)
-
Tree Terminology (6:42)
-
Tree Traversals (5:52)
-
Binary Tree Construction (15:34)
-
Array Representation Of Binary Tree (8:36)
-
Linked Representation Of Binary Tree (4:01)
-
Binary Search Tree (5:53)
-
Binary Search Tree Implementation (9:06)
-
Binary Search Tree Traversals (6:01)
-
Comparison Of Binary Trees (5:44)
-
Insertion In A BST (13:28)
-
Deletion In A BST (17:21)
-
Searching In A BST (6:39)
-
Threaded Binary Tree (11:10)
-
Implementation Of A Threaded Binary Tree (12:25)
-
Inorder Traversal Of Threaded Binary Tree (7:19)
-
Binary Heap (15:24)
-
Heap Sort (12:39)
-
AVL Tree (20:59)
Graphs
-
Graph Data Structure (6:36)
-
Adjacency Matrix Representation (6:01)
-
Adjacency List Representation (5:28)
-
Adjacency Multi-List Representation (12:22)
-
Orthogonal Representation Of Graph (8:41)
-
Depth First Search Traversal (4:55)
-
Implementation Of DFS (10:05)
-
Breadth First Search Traversal (8:10)
-
Implementation Of BFS (7:11)
-
Spanning Tree (8:28)
-
Kruskasl's MST Algorithm (7:02)
-
Prim's MST Algorithm (10:21)
-
Dijkstra Algorithm (15:10)
-
Topological Sort (11:38)
