Data Structures and Algorithms
Lectures
Roadmap
1
Introduction to Data Structures and Algorithms
2
Time Complexity and Big O Notation
3
Asymptotic Notations, Big O, Big Omega and Big Theta Explained.
4
Best Case, Worst Case and Average Case Analysis of an Algorithm
5
How to Calculate Time Complexity of an Algorithm
6
Arrays and Abstract Data type in Data Structure
7
Array as an abstract data type in Data structures
9
Operations on Arrays in Data Structures - Traversal, Insertion, Deletion and Searching
10
Coding Insertion Operation in Array in Data Structure
13
Introduction to Linked list
14
Linked list creation and traversal
15
Insertion of node in a linked list
17
Deletion in a linked list
18
Circular Linked List and Operations
21
Doubly Linked List
22
Introduction to Stack
29
Implementing stack using linkedlist
33
Parenthesis checking using stack
35
Infix, Prefix and Postfix Expressions.
38
Queue Data Structures
42
Introduction to Circular Queue
45
Queue using Linked Lists
47
Double-Ended Queue
48
Sorting Algorithms
61
Introduction to Trees
62
What is a Binary Tree
63
Types of Binary Tree
64
Representation of a Binary Tree
65
Linked Representation Of Binary Tree
66
Traversal in Binary Tree
67
PreOrder Traversal Code
67
PostOrder Traversal Code
69
InOrder Traversal Code
71
Binary Search Tree Introduction & Properties
72
Checking if a binary tree is a binary search tree
73
Search operation in a Binary Tree
76
Insertion & Deletion in a Binary Tree
79
AVL Trees Introduction
80
Rotation and Insertion in AVL Tree
81
LL, RR, RL, LR rotations in AVL Tree
82
C Code for AVL tree insertion & rotation (LL, RR, RL, LR rotation)
83
Introduction to Graphs
84
Representation of Graphs - Adjacency list, Adjacency matrix and other representations
85
Graph traversal and Graph traversal algorithm
86
Breadth First Search Graph Traversal
88
Depth First Search Graph Traversal
90
Spanning Trees & Maximum Number of Spanning Trees
91
Calculating Spanning tree Cost & Minimum Spanning Tree.
92
Prims Minimum spanning tree algorithm