DSA with Python Course - Boost Your Skills with AI-Powered Learning | Edureify



DSA with Python

480 hours
lessons
BEGINNER
Course Progress
0 % Complete
1 . Introduction

Introduction to DSA

20 min

Why learn DSA?

20 min

Prerequisites

20 min

Python Lists

20 min
2 . Sorting Algorithms

Sorting

20 min

Bubble Sort

20 min

Selection Sort

20 min

Insertion Sort

20 min

Merge Sort

20 min

Quick Sort

20 min

Counting Sort

20 min
3 . Search Algorithms

Search Algorithms

20 min

Linear Search

20 min

Binary Search

20 min
4 . Linked List

Linked List

20 min

Linked List Operations

20 min

Examples: Linked List

20 min
5 . Circular Linked List

Introduction to Circular Linked List

20 min

Circular Linked List Operations

20 min

Examples: Circular Linked List

20 min
6 . Doubly Linked List

Introduction to Doubly Linked List

20 min

Doubly Linked List Operations

20 min

Examples: Doubly Linked List

20 min
7 . Stacks and Queue

Stack

20 min

Queue

20 min

Drawbacks of Linear Queues

20 min

Circular Queue

20 min

Double Ended Queue (Deque)

20 min
8 . Hashing

Introduction to Hashing

20 min

Hashing Techniques

20 min

Hash Collision

20 min

Hash Collision Resolution

20 min

Hash Functions

20 min

Additional Topics

20 min
9 . String Matching Algorithm

Introduction

20 min

Brute Force Method

20 min

Rabin-Karp String Matching Algorithm

20 min

KMP Algorithm

20 min
10 . Tree Data Structure

Non-linear Data Structure

20 min

Tree Data Structure

20 min

Implementation of Trees

20 min

Tree Traversal

20 min
11 . Binary Tree

Introduction to Binary Trees

20 min

Properties of Binary Trees

20 min

Implementation of Binary Trees

20 min

Traversal of Binary Tree

20 min

Types of Binary Trees

20 min

Example: Huffman Coding

20 min

Example: Binary Search Tree

20 min
12 . Heaps

Array Representation of Binary Tree

20 min

Introduction to Heaps

20 min

Heap Operations

20 min

Heapify

20 min

Heap Sort

20 min

Heap as a Priority Queue

20 min
13 . Graph Data Structure

Graph Data Structure

20 min

Graph Terminologies

20 min

Adjacency Matrix

20 min

Adjacency List

20 min

Graph Traversal With DFS Algorithm

20 min

BFS Algorithm

20 min
14 . Relationships in a Graph

Graph Connectivity

20 min

Touring a Graph

20 min

Graph Comparisons and Special Properties

20 min

Types of Graph

20 min
15 . Graph Based Algorithms

Graph Based Algorithms

20 min

Topological Sorting

20 min

Dijkstra's Algorithm

20 min

Bellman Ford's Algorithm

20 min

Ford Fulkerson Algorithm

20 min

Spanning Trees

20 min

Kruskal's Algorithm

20 min

Prim's Algorithm

20 min
16 . Greedy Algorithms

Introduction to Greedy Algorithms

20 min

The Classroom Scheduling Problem

20 min

Coin Change Problem

20 min

The Fractional Knapsack Problem

20 min

0-1 Knapsack Problem

20 min
17 . Sorting (II)

Additional Sorting Techniques

20 min

Bucket Sort

20 min

Radix Sort

20 min

Shell Sort

20 min
18 . Balanced Trees

Introduction to Balanced Trees

20 min

AVL Trees

20 min

Red-Black Trees

20 min
19 . What's Next?

What's Next?

20 min

Course Curriculum

Module 1: Web Development Fundamentals

Module 2: Advanced JavaScript Concepts

Module 3: Building Responsive Layouts

Module 4: Working with APIs

📱 Download BootSelf app to access full course content

Ready to Start Learning?

Download our app now and start your journey to becoming a web development professional!