Data Structures and Algorithms Using Python
Master Data structure Algorithm by understanding concepts through time complexity and implementation using Python 3.
Lectures -180
Resources -9
Duration -17 hours
30-days Money-Back Guarantee
Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.
Course Description
The course Data Structures and Algorithm using Python covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, and dynamic programming. You will also learn a lot about sorting data and how it helps with searching.
Data Structures and Algorithms Using Python Course Overview
This course will teach you the fundamentals of recursion and data structures in Python. You will learn how to break down a large problem into smaller and smaller subproblems until you reach a base case that can be solved easily.
You will learn concepts using Python 3 and PyCharm IDE. All the code and examples will be available for you to download and practice. This course is ideal for programmers who want to learn a new way of thinking about problem-solving.
You will also learn about different data structures, such as arrays, lists, stacks, queues, trees, and graphs, and how to implement them using recursion. The course will cover the following topics:
What is recursion?
The basic structure of a recursive function
The base case and the recursive case
Time and space complexity of recursive functions
Recursive data structures
Recursive algorithms for common problems such as factorial, Fibonacci numbers, and binary search
Using recursion to solve coding problems
Arrays
Lists
Stacks
Queues
Trees
Graphs
Magic Framework
Computer Programming
Dynamic Programming
Goals
What will you learn in this course:
Apply basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.
Apply various data structures such as stack, queue, hash table, priority queue, binary search tree, graph and string to solve programming challenges.
Apply graph and string algorithms to solve real-world challenges: finding shortest paths.
Solve complex programming challenges using advanced techniques.
Understand the concept of recursion.
Implement recursive functions in Python.
Analyze the time and space complexity of recursive functions.
Use recursion to solve common problems.
Understand different data structures.
Implement data structures using recursion.
Use data structures to solve problems.
Prerequisites
What are the prerequisites for this course?
Basic computer programming.
Basic Mathematics knowledge
Basic computer with access to the internet.
Curriculum
Check out the detailed breakdown of what’s inside the course
Introduction
6 Lectures
- Introduction of DSA 04:39 04:39
- Introduction to DSA- Part 2 04:26 04:26
- Introduction to DSA- Part 3 04:17 04:17
- Introduction to DSA- Part 4 01:57 01:57
- Introduction to DSA- Part 5 02:47 02:47
- Introduction to DSA- Part 6 01:57 01:57
Recursion
9 Lectures
Algorithm Runtime
7 Lectures
Array Implementation
5 Lectures
Stack in Data structures
5 Lectures
Queue in Data structure
11 Lectures
Linked List in Data Structure
24 Lectures
Tree in Data Structure
25 Lectures
Binary Search Tree
8 Lectures
AVL Tree in Data Structure
13 Lectures
Binary Heap
10 Lectures
Trie in Data Structure
3 Lectures
Hashing in Data Structure
7 Lectures
Sorting in Data Structures
16 Lectures
Graphs in Data Structure
23 Lectures
Magic Framework
1 Lectures
Greedy Algorithm
6 Lectures
Instructor Details
Chandramouli Jayendran
eCourse Certificate
Use your certificate to make a career change or to advance in your current career.
Our students work
with the Best
Related Video Courses
View MoreAnnual Membership
Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses
Subscribe nowOnline Certifications
Master prominent technologies at full length and become a valued certified professional.
Explore Now