Data Structures and Algorithms in Python
|
Explore data structures such as linked lists, stacks, queues, hash tables, and graphs; and search and sort algorithms!
Course Description
Recognize Popular Data Structures and Algorithms
Most computer programs are based on a few data structures and algorithms. Learn about what’s behind the hood of most of your computer interactions in this four-hour course! You’ll familiarize yourself with some of the most common data structures: linked lists, stacks, queues, and trees. You’ll also implement popular algorithms, such as Depth First Search, Breadth First Search, Bubble sort, Merge sort, and Quicksort.
Learn to Spot Data Structures and Algorithms in Everyday Life
You’ll practice applying data structures and algorithms to decks of cards, music playlists, international dishes, and stacks of books. You’ll walk away with the ability to recognize common data structures and algorithms, and implement them in day-to-day applications!
Analyze the Efficiency of Algorithms
Along the way, you’ll stop to analyze popular algorithms in terms of their efficiency. You’ll come to grips with “Big O Notation”, the industry standard for describing the complexity of an algorithm.
Sharpen Your Python Programming Knowledge
Being well-versed with data structures and algorithms means being able to take everyday problems and solve them using efficient code. You’ll be practising this in Python, you’ll take these fundamental and transferable skills with you to any programming language.
What You’ll Learn
Work with Linked Lists and Stacks and Understand Big O notation
You’ll begin by learning what algorithms and data structures are. You will discover two data structures: linked lists and stacks. You will then learn how to calculate the complexity of an algorithm by using Big O Notation.
Searching algorithms
This chapter will focus on searching algorithms, like linear search, binary search, depth first search, and breadth first search. You will also study binary search trees and how to search within them.
Queues, Hash Tables, Trees, Graphs, and Recursion
This second chapter will teach you the basics of queues, hash tables, trees, and graphs data structures. You will also discover what recursion is.
Sorting algorithms
This chapter will teach you some sorting algorithms, like bubble sort, selection sort, insertion sort, merge sort, and quicksort.
User Reviews
Be the first to review “Data Structures and Algorithms in Python”
You must be logged in to post a review.
There are no reviews yet.