Data Structures and Algorithms with Python
Data Structures and Algorithms with Python
Learn core data structures and algorithms in this DSA using Python course. Covers stacks, queues, trees, and sorting with a hands-on warehouse project and quiz to strengthen problem-solving skills.
About this course
Learn core data structures and algorithms in this DSA using Python course. Covers stacks, queues, trees, and sorting with a hands-on warehouse project and quiz to strengthen problem-solving skills.
Earn a certificate with an Academy Pro+ subscription
Stand out to recruiters
Share on professional channels
Globally recognised
Land your dream job
Course outline
Industry focussed curriculum designed by experts
Foundations of Python and Fundamental Data Structures
5 items
1.22 hr
- Course Overview
- Introduction and Foundations of Python
- List
- Tuple
- Dictionary
- Set
- Strings
Stack and Queue in Python
6 items
0.42 hr
- Stack IsEmpty - Implementation
- Push - Implementation
- Pop - Implementation
- Queue IsEmpty - Implementation
- Enqueue - Implementation
- Dequeue - Implementation
Linked Lists
4 items
0.29 hr
- Introduction to LinkedList
- Declaration and Initialization
- LinkedList Insertion - Implementation
- LinkedList Deletion - Implementation
Trees and Binary Search Trees
9 items
0.35 hr
- Tree Traversal Implementation
- Tree Traversal Pseudocode
- BST - Insertion Pseudocode
- BST - Insertion Implementation
- BST - Searching Algorithm
- BST - Searching Pseudocode
- BST - Searching Implementation
- BST - Deletion Pseudocode
- BST - Deletion Implementation
Traversals, Heaps and Priority Queues
4 items
0.19 hr
- Level Order Traversal - Pseudocode
- Level Order Traversal - Searching
- Level Order Traversal - Implementation
- Heaps and Priority Queues
Introduction to Algorithms
16 items
3.03 hr
- What is an Algorithm
- Classification of Algorithms
- Algorithmic Analysis
- Types of Algorithmic Analysis
- Need to learn Complexity Theory
- Time Complexity
- Worst case Time Complexity
- Space Complexity
- Complexity Theory
- P and NP
- NP-Complete and NP-Hard
- Travelling Salesman Problem
- Introduction to Recursion
- Problem Solving on Recursion
- Time Complexity-2
- Space Complexity-2
Searching Algorithms
6 items
0.48 hr
- Linear Search
- Linear Search - Implementation
- Binary Search
- Binary Search - Implementation
- Three Sum - Problem
- Three Sum - Implementation
Sorting Algorithms
27 items
3.16 hr
- Introduction to Sorting
- Bubble Sort vs Selection Sort vs Insertion Sort
- Introduction to Bubble Sort
- Bubble Sort - Pseudocode
- Bubble Sort - Analysis
- Bubble Sort - Implementation
- Introduction to Selection Sort
- When to use Selection Sort
- Selection Sort - Pseudocode
- Selection Sort - Analysis
- Selection Sort - Implementation
- Introduction to Insertion Sort
- When to use Insertion Sort
- Insertion Sort - Pseudocode
- Insertion Sort - Analysis
- Insertion Sort - Implementation
- Introduction to Merge Sort
- When to use Merge Sort
- Merge Sort - Pseudocode
- Merge Sort - Implementation
- Introduction to Quick Sort
- When to use Quick Sort
- Quick Sort - Analysis
- Quick Sort - Implementation
Divide and Conquer
4 items
0.41 hr
- Introduction to Divide & Conquer
- Calculating Time Complexity
- Advantages & Disadvantages
- Divide & Conquer - Application
Greedy Algorithms
6 items
1.03 hr
- Introduction to Greedy Algorithm
- Working of Greedy Algorithm
- Greedy Problem1
- Greedy Problem2
- Greedy Problem3
- Application of Greedy Algorithm
Get access to the complete curriculum with your free trial
Start 7-Day Free TrialGuided Projects
Solve real-world projects with a step-by-step guide, starter code templates, and access to model solutions to boost your skills and build a standout resume.
Get a project certificate to add to your resume
Earn a certificate for every project you complete.
- GUIDED PROJECT 1
- Warehouse Package Sorting System
- In this project, you have been tasked with developing a system for a warehouse that sorts incoming packages based on priority and size. The warehouse has different zones, and each zone can only accommodate a certain number of packages. The goal is to optimize the sorting process to minimize time and maximize space efficiency.
Gain skills & build your resume with complete access to guided projects in your free trial
Start 7-Day Free TrialCourse Instructors
Mr. Vishwa Mohan
Staff Engineer @ LinkedIn | IIT Grad | Technology enthusiast | Mentor | Public Speaker
Subscribe to Academy Pro+
Build skills and prepare for jobs with access to 500+ courses, certificates and tools.
Subscribe To Pro+ • $25/MonthSkill Prep
Build skills with courses, practice with tools and earn certificates.
500+ courses
500+ Coding Exercises
Microsoft & AWS certificates
Job Prep
Work on industry-relevant scenarios, build professional resumes & prepare for jobs with mock interviews
50+ Guided Projects
AI Resume Builder
AI mock interviews
Advance your career with
Top University programs
Gain industry-relevant skills through learning from top faculty, guidance from industry mentors, and hands-on projects.
MIT IDSS
12 weeks  • Online
MIT Professional Education
12 Weeks  • Online
McCombs School of Business at The University of Texas at Austin
7 months  • Online
McCombs School of Business at The University of Texas at Austin
7 months  • Online
McCombs School of Business at The University of Texas at Austin
6 months  • Online