| Lecture No. | Description | Lecture By |
|---|---|---|
| Lecture 1 | Fundamentals of algorithm analysis Big ‘O’ notations, Time and space complexity of algorithms | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 2 | Linked lists: singly, operations, insertion, traverse | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 3 | linked lists: singly: reverse display, reverse link list, doubly linked lists | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 4 | Stacks & Implementation | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 5 | Queues, Circular queue & Implementation | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 6 | Double stack, Multistacks | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 7 | Multiqueues, Deques, | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 8 | Polynomial Arithmetic | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 9 | infix, postfix and prefix arithmetic expression conversion | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 10 | prefix arithmetic expression conversion and evaluations | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 11 | Trees: Binary trees: Definition | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 12 | Tree Implementation | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 13 | Tree Traversals (recursive) | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 14 | Tree Traversals (stack based non-recursive) Pre Order, In-order | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 15 | Tree Traversals (stack based non-recursive) Post order | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 16 | Tree Traversals (stack based non-recursive) | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 17 | Heaps and priority queues | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 18 | Threaded binary tree | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 19 | AVL Trees: Introduction, rotation | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 20 | AVL Trees Examples | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 21 | B-Tree: need, properties, creation, uses | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 22 | B+ tree, B* tree | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 23 | Graphs: Representation (Matrix and Linked) | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 24 | Graph Traversals | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 25 | Connected components, Spanning trees | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 26 | Shortest path and Transitive closure, Dijkstra’s Algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 27 | Topological sort | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 28 | Activity network, Critical path, Path enumeration-1 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 29 | Activity network, Critical path, Path enumeration-2 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 30 | Floyd Warshall’s Algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 31 | Coloring of Graphs | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 32 | Spanning Tree, Minimum Spanning Tree Algorithms Kruskal’s Algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 33 | Prim’s Algorithm | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 34 | Problem discussion of Spanning tree, Activity Network | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 35 | Searching & Sorting: Binary search, Hash function, Hash table, Search tree | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 36 | Internal sort: Radixsort, Insertion sort, Selection sort, Shell sort, Heap sort. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 37 | Quick sort & example sorting, Merge sort & example sorting | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 38 | Files: Sequential file organization, creating updating retrieving from sequential files | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 39 | advantages and disadvantages of sequential file organization | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 40 | Data representation and density | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 41 | parity and error control techniques, devices and channels | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 42 | double buffering and block buffering | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 43 | Handling sequential files in C language, seeking, positioning | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 44 | Reading and writing binary files in C | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 45 | Polyphase merge | Lecture by , Lecture by , Lecture by , Lecture by |