Lecture 1
Introduction: Basic Terminologies: Concept of Data Structure, Choice of right Data Structure

Lecture 2
Algorithms, how to design and develop algorithm, Complexity of algorithm.

Lecture 3
Operations: insertion, deletion, traversal

Lecture 4
Analysis of an Algorithm

Lecture 5
Searching: Linear Search and Binary Search

Lecture 6
Search Techniques and their complexity analysis.

Newton law
Title goes here

Newton's laws of motion relate an object's motion to the forces acting on it. In the first law, an object will not change its motion unless a force acts on it. In the second law, the force on an object is equal to its mass times its acceleration

Table title

Lecture 7
Stack and its operations: Algorithms and their complexity analysis

Lecture 8
Applications of Stacks: Expression Conversion and evaluation

Lecture 9
Corresponding algorithms and complexity analysis

Lecture 10
Queue, Types of Queue: Simple Queue

Lecture 11
Circular Queue, Priority Queue

Lecture 12
Operations on each types of Queues

Lecture 13
Algorithms and their analysis

Lecture 14
Linked Lists: Singly linked lists: Representation in memory

Lecture 15
Algorithms of several operations: Traversing, Searching, Insertion into, Deletion from linked list

Lecture 16
Linked representation of Stack and Queue, Header nodes

Lecture 17
Doubly linked list: operations on it and algorithmic analysis

Lecture 18
Circular Linked Lists: all operations their algorithms and the complexity analysis.

Lecture 19
Trees: Basic Tree Terminologies

Lecture 20
Different types of Trees: Binary Tree, Threaded Binary Tree

Lecture 21
Binary Search Tree, AVL Tree

Lecture 22
Operations on Binary Search Tree, AVL Tree and their algorithms with Complexity analysis

Lecture 23
Applications of Binary Trees. B Tree, B+ Tree: definitions

Lecture 24
Algorithms and analysis of B Tree, B+ Tree

Parabola
- y = 3x^2 + 12x - 12: An example of a parabola equation
- y = 2(x - 3)^2 + 4: An example of a parabola equation where the vertex is (-3, 4) and it opens upwards
- y^2 = 24x: An example of a parabola equation
- 2(y - 3)^2 + 24 = x: An example of a parabola equation
- (y - 5)^2 = 8(x - 2): An example of a parabola equation where the focus is the point (4, 5)

Lecture 25
Sorting and Hashing: Objective and properties of different sorting algorithms

Lecture 26
Sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort

Lecture 27
Quick Sort, Merge Sort

Lecture 28
Heap Sort

Lecture 29
Performance and Comparison among all the methods

Lecture 30
Graph: Basic Terminologies and Representations

Lecture 31
Graph search algorithms

Lecture 32
Graph traversal algorithms

Lecture 33
Complexity analysis