Curriculum
Section 1: Introduction to Data Structure
1 Introduction to data structure and Basic Terminology
2 Data structure Operations
Section 2: Data Structure Concepts
3 Array introduction
4 one dimensional array program
5 One dimensional array program output
6 Two dimension Array
7 Two dimension Array Initialization And accessing
8 Program for Two dimension Array Initialization And accessing
9 String introduction Part-1
10 String introduction Part-2
11 Program for reading string
12 String operations-substring,indexing,concatenation
13 String operations-delete,replace
14 String functions in C language
15 Programs for string operations
16 Programs for string operations continued
17 Abstract Data Type
18 Algorithm and its complexity
19 Link List Introduction
20 Representation of link list
21 Representation of link list continued
22 Circular link list and creation of node
23 Operations on link list and Insertion of node at the beginning
24 Operations on link list and Insertion of node at the beginning cont
25 Inserting node at tail
26 Inserting node at a given position Part-1
27 Inserting node at a given position Part-2
28 Inserting node at a given position remaining part
29 Traversing link list
Section 3: More on Link List
30 Deletion of node from a given link list_Part 01
31 Deletion of node from a given link list_Part 02
32 Implementation of link list
33 Program for link list_Part 01
34 Program for link list_Part 02
35 Applications of link list
36 Representing Polynomial using link list
37 Addition of polynomial using link list
38 Advantages and Disadvantages of link List
39 Introduction to Stack
40 Push and Pop Opeartion
41 Stack Overflow and Underflow
42 Implementation of Stack-Push and Pop
43 Pus and Implementation of Stack-Practical
44 Minimizing Overflow and Linked Stack
45 Implementation of Linked Stack
46 Implementation of Linked Stack Part 1
47 Implementation of Linked Stack Part 2
48 Implementation of Linkedstack Pop and Peek and Display
49 Application of Stack Polish Notations
50 Evaluation of Postfix Expression Using Stack
51 Conversion of Infix to Postfix Expression Using Stack Part 1
52 Conversion of Infix to Postfix Expression Using Stack Part 2
Section 4: Queue
53 Introduction of Queue and Algorithm For Enqueue
54 Introduction to Queue
55 Algorithm For Operations On Queue
56 Implementation of Queue Part 1
57 Implementation of Queue Part 2
58 Implementation of Linked Queue Part 1
59 Implementation of Linked Queue Part 2
60 Implemnentation of Linked Queue
61 Circular Quque Part 1
62 Circular Quque Part 2
63 Dequeue
64 Priority Queue Introduction
65 Priority Queue Using One Way List Representation
Section 5: Sorting
66 Priority Queue Part 1
67 Priority Queue Part 2
68 Sorting Introduction-Bubble Sort Starts
69 Bubble Sort Part 1
70 Bubble Sort Part 2
71 Bubble Sort Part 3
72 Bubble Sort Part 4
73 Bubble Sort Part 5
74 Bubble Sort Part 6
75 Bubble Sort Part 7
76 Insertion Sort Part 1
77 Insertion Sort Part 2
78 Insertion Sort Part 3
79 Insertion Sort Part 4
80 Insertion Sort Part 5
81 Insertion Sort Analysis
82 Selection Sort Introduction
83 Selection Sort Example
84 Algorithm of Selection Sort
85 Working of Selection Sort
86 Excetuion of Program and Analysis of Selection Sort
87 Divide and Conquer Approach and Merge Sort Intrduction
88 Merge Sort Algorithm, Example and Program
89 Merge Sort Working Part 1
90 Merge Sort Working Part 2
91 Merge Sort Working Part 3
92 Merge Sort Working Part 4
93 Merge Sort Working Part 5
94 Mergesort Analysis
95 Quick Sort Introduction
96 Quicksort Working Part 1
97 Quicksort Working Part 2
98 Quicksort Working Part 3
Section 6: Tree
99 Tree Introduction
100 Tree Basic Terms Part 1
101 Tree Basic Terms Part 2
102 Binary Tree
103 Strictly and Complete Binary Tree
104 Strictly and Complete Binary Tree Illustration
105 Sequential Representation of Binary Tree
106 Sequential Representation of Binary Tree Example
107 Linked Representation of Binary Tree
108 Operations on A Binary Tree
109 Traversing A Binary Tree and Preordere
110 Inorder Traversing
111 Postorder Traversing
112 Prorder Postorder Anf Inorder Example
113 Binary Search Tree Introduction
114 Bst Insertion Operation Example
115 Bst Insertion Operation Part 1
116 Bst Insertion Operation Part 2
117 Bst Search Operation
118 Inorder Traversal of Bst Part 1
119 Inorder Traversal of Bst Part 2
120 Preorder and Postorder Traversal of Bst
121 Deletion From Bst Part 1
122 Deletion From Bst Part 2
123 Implementation of Bst
124 Threaded Binary Tree
125 Two Way Threading
126 Introduction to Huffman Encoding
127 Huffman Encoding Algorithm
128 Huffman Encoding Example
129 Expression Trees
130 Avl Tree Introduction
131 Multiway Searh Tree
132 Avl Tree
133 Introduction to B-Tree
134 B-Tree Part 1
135 B-Tree Part 2
136 B-Tree Part 3
137 B-Tree Part 4
138 B-Tree Part 5
139 B-Tree Part 6
140 B-Tree Part 7
141 B-Tree Part 8
142 B+ Tree
Section 7: Graph
143 Graph Introduction
144 Graphh Terminology Part 1
145 Graphh Terminology Part 2
