University of California San Diego

Algorithmic Toolbox

Neil Rhodes
Daniel M Kane
Michael Levin

Instructors: Neil Rhodes

537,016 already enrolled

Included with Coursera Plus

Gain insight into a topic and learn the fundamentals.
4.6

(12,483 reviews)

Intermediate level
Some related experience required
Flexible schedule
Approx. 40 hours
Learn at your own pace
91%
Most learners liked this course
Gain insight into a topic and learn the fundamentals.
4.6

(12,483 reviews)

Intermediate level
Some related experience required
Flexible schedule
Approx. 40 hours
Learn at your own pace
91%
Most learners liked this course

What you'll learn

  • Essential algorithmic techniques

  • Design efficient algorithms

  • Practice solving algorithmic interview problems

  • Implement efficient and reliable solutions

Details to know

Shareable certificate

Add to your LinkedIn profile

Assessments

25 assignments

Taught in English

See how employees at top companies are mastering in-demand skills

Placeholder

Build your subject-matter expertise

This course is part of the Data Structures and Algorithms Specialization
When you enroll in this course, you'll also be enrolled in this Specialization.
  • Learn new concepts from industry experts
  • Gain a foundational understanding of a subject or tool
  • Develop job-relevant skills with hands-on projects
  • Earn a shareable career certificate
Placeholder
Placeholder

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV

Share it on social media and in your performance review

Placeholder

There are 6 modules in this course

Welcome to the first module of Data Structures and Algorithms! Here we will provide an overview of where algorithms and data structures are used (hint: everywhere) and walk you through a few sample programming challenges. The programming challenges represent an important (and often the most difficult!) part of this specialization because the only way to fully understand an algorithm is to implement it. Writing correct and efficient programs is hard; please don’t be surprised if they don’t work as you planned—our first programs did not work either! We will help you on your journey through the specialization by showing how to implement your first programming challenges. We will also introduce testing techniques that will help increase your chances of passing assignments on your first attempt. In case your program does not work as intended, we will show how to fix it, even if you don’t yet know which test your implementation is failing on.

What's included

6 videos8 readings1 assignment2 programming assignments

In this module you will learn that programs based on efficient algorithms can solve the same problem billions of times faster than programs based on naïve algorithms. You will learn how to estimate the running time and memory of an algorithm without even implementing it. Armed with this knowledge, you will be able to compare various algorithms, select the most efficient ones, and finally implement them as our programming challenges!

What's included

12 videos4 readings3 assignments1 programming assignment1 ungraded lab

In this module you will learn about seemingly naïve yet powerful class of algorithms called greedy algorithms. After you will learn the key idea behind the greedy algorithms, you may feel that they represent the algorithmic Swiss army knife that can be applied to solve nearly all programming challenges in this course. But be warned: with a few exceptions that we will cover, this intuitive idea rarely works in practice! For this reason, it is important to prove that a greedy algorithm always produces an optimal solution before using this algorithm. In the end of this module, we will test your intuition and taste for greedy algorithms by offering several programming challenges.

What's included

10 videos9 readings5 assignments1 programming assignment

In this module you will learn about a powerful algorithmic technique called Divide and Conquer. Based on this technique, you will see how to search huge databases millions of times faster than using naïve linear search. You will even learn that the standard way to multiply numbers (that you learned in the grade school) is far from the being the fastest! We will then apply the divide-and-conquer technique to design two efficient algorithms (merge sort and quick sort) for sorting huge lists, a problem that finds many applications in practice. Finally, we will show that these two algorithms are optimal, that is, no algorithm can sort faster!

What's included

20 videos5 readings8 assignments1 programming assignment

In this final module of the course you will learn about the powerful algorithmic technique for solving many optimization problems called Dynamic Programming. It turned out that dynamic programming can solve many problems that evade all attempts to solve them using greedy or divide-and-conquer strategy. There are countless applications of dynamic programming in practice: from maximizing the advertisement revenue of a TV station, to search for similar Internet pages, to gene finding (the problem where biologists need to find the minimum number of mutations to transform one gene into another). You will learn how the same idea helps to automatically make spelling corrections and to show the differences between two versions of the same text.

What's included

4 videos2 readings6 assignments1 programming assignment

In this module, we continue practicing implementing dynamic programming solutions.

What's included

8 videos2 readings2 assignments1 programming assignment

Instructors

Instructor ratings
4.4 (2,204 ratings)
Neil Rhodes
University of California San Diego
7 Courses708,139 learners
Daniel M Kane
University of California San Diego
5 Courses690,489 learners
Michael Levin
University of California San Diego
7 Courses728,972 learners

Offered by

Recommended if you're interested in Algorithms

Why people choose Coursera for their career

Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

Learner reviews

4.6

12,483 reviews

  • 5 stars

    71.84%

  • 4 stars

    21.45%

  • 3 stars

    4.20%

  • 2 stars

    1.04%

  • 1 star

    1.44%

Showing 3 of 12483

HG
5

Reviewed on Jul 2, 2020

PS
5

Reviewed on Aug 14, 2020

GS
5

Reviewed on Oct 31, 2020

New to Algorithms? Start here.

Placeholder

Open new doors with Coursera Plus

Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription

Advance your career with an online degree

Earn a degree from world-class universities - 100% online

Join over 3,400 global companies that choose Coursera for Business

Upskill your employees to excel in the digital economy

Frequently asked questions