Northeastern University
Data Structures & Algos: Software Development Skills
Northeastern University

Data Structures & Algos: Software Development Skills

Nicholas Brown

Instructor: Nicholas Brown

Included with Coursera Plus

Gain insight into a topic and learn the fundamentals.
18 hours to complete
3 weeks at 6 hours a week
Flexible schedule
Learn at your own pace
Gain insight into a topic and learn the fundamentals.
18 hours to complete
3 weeks at 6 hours a week
Flexible schedule
Learn at your own pace

Details to know

Shareable certificate

Add to your LinkedIn profile

Recently updated!

December 2024

Assessments

18 assignments

Taught in English

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

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 4 modules in this course

In this module, you will be introduced to the foundational concept of algorithms, including their characteristics and how they are integral to solving computational problems. You’ll explore the basics of algorithmic complexity and efficiency, providing a strong foundation for the advanced topics in subsequent modules.

What's included

1 video9 readings2 assignments1 discussion prompt

In this module, you will explore the powerful and elegant Gale-Shapley algorithm, originally developed to solve the stable marriage problem. This algorithm, widely used in real-world applications such as college admissions and job matching, ensures that individuals are paired in a way that avoids instability—where two participants could form a better match with someone else. By understanding the principles behind stable matching and the mechanics of this algorithm, you'll gain insight into one of the most influential solutions in game theory, optimization, and computer science.

What's included

1 video12 readings5 assignments

What's included

1 video13 readings5 assignments

In this module, you'll begin by summarizing key concepts like computational tractability, asymptotic growth, and the notations used to evaluate algorithm efficiency. You'll then dive into time complexity, learning how to optimize algorithms for different scenarios and classify them into appropriate complexity classes. By the end, you'll be able to apply these analysis techniques to real-world problems, optimizing solutions while considering the implications and limitations of algorithm analysis.

What's included

1 video14 readings6 assignments

Instructor

Nicholas Brown
Northeastern University
0 Courses0 learners

Offered by

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."

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