arrow_back
Introduction to Data Structure and Algorithms
Course Intoduction
What is Data Structure?
What is an Algorithms?
What is Pseudocode?
What is Flowchart?
What is UML?
Why are Data Structures and Algorithms important?
Concept of Data Structure
Data and Data Structure
Classification of Data Structure
Properties of Data Structure
Data Type and user defined data type
Data Type and user defined data type-2
Abstract Data Type(ADT)
Algorithm Analysis
Analysis of algorithms
How to analyze complexity
Experimental Study of Time Complexity in Python
Experimental Study of Space Complexity in Python
"Experimental Study of time and Space Complexities on Jupyter Notebook"
Functional Study of Time Complexity
Functional Study of Space Complexity
Order of Grwoth
Asymptotic Analysis And Asymptotic Notation
Asymptotic Analysis with best,avg and worst case
Asymptotic Notations-1
Asymptotic Notations-2
Example of Big-O Complexities
Complexity of Code-1
Complexity of Code-2
TimeSpace Trade Off
Array Data Structure
Data Structure in Python
Concept of Data Structure
Array Data Structure
Array AND Memory
What is Array?
Why We Need of Array
Low Level Array and Referential array
Array vs List
Array ADT
Implementation of Array: array() constructor
Implementation of Array
Implementation of Array: Important Points
Accessing Python Array Elements
Slicing in Array
Updating an Array & Adding elements
Removing Elements From Array
Searching and Sorting in Array
Stack
What is a Stack ?
Stack Implementation-1 using List
Stack Implementation-2 using list and functions
Stack implementation using Collections.deque
Stack implementation using queue.LifoQueue
Queues
What is a Queue?
Working of Queue
Types of Queue
Circular Queue
Circular Queue implementation in Python
Double Ended Queue
Queue implementation in python using collections.deque
Queue implementation in python using queue.Queue
Stack VS Queue
Linked List
What is Linked List?
Creation of Linked List in Python
Linked List Operations : INSERTION
Linked List Operations : DELETION
Types of Linked List
Doubly Linked List Operation: Insertion
Doubly Linked List Operation: Deletion
Circular Linked List- Its operations I
Circular Linked List- Its operations II
Summary
Tree Based DSA
Tree Data Structure
Tree Traversal
Example: Inorder, Preorder, Postorder
Python implementation (tree traversal)
Binary Tree, types of Binary Tree
Python Implementation of Binary Tree
Full Binary Tree
Perfect Binary Tree
Complete Binary Tree-I
Complete Binary Tree-II
Balanced Binary Tree
Binary Search Tree-I
Binary Search Tree-II
Binary Search Tree-III
Sorting
Bubble Sort
Bubble Sort-Python Implementation
Selection Sort with Python Implementation
Insertion Sort
Insertion Sort-Python Implementation
Merge Sort
Merge Sort Python Implementation
Quick Sort
Quick Sort-Python Implementation
Quick Sort Program,Complexity
Seraching
Linear Search
Binary Search
Graph in DSA
Graph: what is Graph? Graph Representation, Types of Graphs
Graph Representation-Adjacency Matrix
Graph Representation-Adjacency List
Pros and cons of Adjacency Matrix and List
Depth First Search
Breadth First Serach