ABSTRACT DATA TYPE-LECTURE 1
INTRODUCTION TO DATA STRUCTURES -LECTURE 2
ASYMPTOTIC NOTATION- LECTURE 3
CREATION OF SINGLE LINKED LIST- LECTURE 4
CREATION OF SINGLE LINKED LIST- LECTURE 5
DISPLAY FUNCTION IN SINGLED LIST-LECTURE 6
DELETE OPERATION IN SINGLE LINKED LIST- LECTURE 7
SEARCH OPERATION IN SINGLE LINKED LIST-
LECTURE 8
CIRCULAR LINKED LIST CREATION-LECTURE 9
DISPLAY OF CIRCULAR LINKED LIST-LECTURE 10
DELETE OPERATION IN CIRCULAR LINKED LIST-LECTURE 11
ADD AT BEGINNING IN CIRCULAR LINKED LIST-LECTURE 12
CREATION OF DOUBLE LINKED LIST-LECTURE 13
DISPLAY OF DOUBLE LINKED LIST-LECTURE 14
DELETE OPERATION IN DOUBLE LINKED LIST-LECTURE 15
ADDING AT BEGINNING POSITION IN DOUBLE LINKED LIST-LECTURE 16
ADD AFTER IN DOUBLE LINKED LIST-LECTURE 17
ADDITION OF TWO POLYNOMIALS USING SINGLE LINKED LIST-LECTURE 18
POLYNOMIAL REPRESENTATION USING LINKED LIST - LECTURE 19
PROGRAM OF ADDING TWO POLYNOMIALS BY SINGLE LINKED LIST-LECTURE 20
STACK WITH ARRAY PUSH OPERATION- LECTURE 21
STACK WITH ARRAY DISPLAY AND POP FUNCTIONS-LECTURE 22
STACK WITH LINKED LIST PUSH OPERATION-
LECTURE 23
STACK WITH LINKED LIST DISPLAY OPERATION-LECTURE 24
STACK WITH LINKED LIST POP OPERATION-
LECTURE 25
QUEUE USING ARRAYS INSERT OPERATION-LECTURE 26
QUEUE WITH ARRAY- DISPLAY FUNCTION-
LECTURE 27
QUEUE USING ARRAYS DELETE OPERATION-LECTURE 28
QUEUE WITH LINKED LIST INSERT OPERATION-LECTURE 29
QUEUE WITH LINKED LIST DISPLAY OPERATION-LECTURE 30
QUEUE WITH LINKED LIST DELETE OPERATION-LECTURE 31
CONVERSION FROM INFIX TO POSTFIX-LECTURE 32
EVALUATION OF POSTFIX EXPRESSION-LECTURE 33
TOWERS OF HANOI-LECTURE 34
INFIX TO POSTFIX CONVERSION PROGRAM-
LECTURE 35
EVALUATION OF POSTFIX EXPRESSION-LECTURE 36
CIRCULAR QUEUE-LECTURE 37
BINARY TREE TRAVERSAL-LECTURE 38
INODER TRAVERSAL USING STACK-LECTURE 39
INORDER TRAVERSAL USING STACK-LECTURE 40
POST ORDER TRAVERSAL USING STACK-LECTURE 41
BREADTH FIRST SEARCH(BFS)-LECTURE 42
DEPTH FIRST SEARCH(DFS)-LECTURE 43
SPANNING TREES-LECTURE 44
BINARY SEARCH TREE-LECTURE 45
QUICK SORT-1-LECTURE 46
QUICK SORT-2-LECTURE 47
RADIX SORT-PART1-LECTURE 48
RADIX SORT-PART2-LECTURE 49
RADIX SORT-PART3-LECTURE 50
MERGING-PART1-LECTURE 51
MERGING - PART2-LECTURE 52
MERGE SORT-PART1-LECTUE 53
MERGE SORT-PART2-LECTURE 54
LINEAR SEARCH-LECTURE 55
BINARY SEARCH-1-LECTURE 56
BINARY SEARCH-2-LECTURE 57
INTRODUCTION TO TREES AND GRAPHS-
LECTURE 58
BASIC TREE TERMINOLOGY-LECTURE 59
BINARY TREE-LECTURE 60
BINARY TREE CREATION FROM TREE TRAVERSAL-LECTURE 61
AVL TREE-LECTURE 62
AVL ROTATIONS -LECTURE 63
AVL TREE CREATION-LECTURE 64
INTRODUCTION TO B-TREES -LECTURE 65
CREATION OF B-TREES-LECTURE 66
INSERTION OPERATION OF B-TREE-LECTURE 67
DELETE OPERATION OF B-TREE-LECTURE 68
INTRODUCTION TO PRIORITY QUEUE-LECTURE 69
CREATION OF PRIORITY QUEUE-LECTURE 70
DISPLAY OF PRIORITY QUEUE-LECTURE-71
DELETE OPERATION IN PRIORITY QUEUE-
LECTURE 72
INTRODUCTION TO HASHING-LECTURE-73
COLLISION RESOLUTION-LECTURE 74
REHASHING-LECTURE 75
HASHINGPROBLEMS-1-LECTURE 76
HASHING PROBLEMS-2-LECTURE 77
HASHING PROBLEMS-3 LECTURE 78
EXTENDABLE HASHING-LECTURE 79
BUBBLE SORT-LECTURE 80
BUBBLE SORT-2-LECTURE 81
SELECTION SORT-1-LECTURE 82
SELECTION SORT-2-LECTURE 83
INSERTION SORT-1-LECTURE 84
INSERTION SORT-2-LECTURE 85
INTRODUCTION TO HEAP TREE-LECTURE 86
CREATION OF HEAP TREE-LECTURE 87
DELETE OPERATION IN HEAP TREE-LECTURE 88
DELETE OPERATION HEAP TREE-LECTURE 89
HEAP TREE CREATION PROGRAM-LECTURE 90
HEAP SORT PROGRAM-LECTURE 91
INTRODUCTION TO SPANNING TREE-LECTURE 92
KRUSKAL'S ALGORITHM-LECTURE 93
PRIM'S ALGORITHM-LECTURE 94
DICTIONARY-LECTURE 95