About this Course

587,452 recent views

Learner Career Outcomes

37%

started a new career after completing these courses

39%

got a tangible career benefit from this course

12%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.

Approx. 25 hours to complete
English
Subtitles: English

Skills you will gain

Binary Search TreePriority QueueHash TableStack (Abstract Data Type)List

Learner Career Outcomes

37%

started a new career after completing these courses

39%

got a tangible career benefit from this course

12%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.

Approx. 25 hours to complete
English
Subtitles: English

Offered by

University of California San Diego logo

University of California San Diego

National Research University Higher School of Economics logo

National Research University Higher School of Economics

Syllabus - What you will learn from this course

Content RatingThumbs Up92%(30,704 ratings)Info
Week
1

Week 1

5 hours to complete

Basic Data Structures

5 hours to complete
7 videos (Total 60 min), 7 readings, 2 quizzes
7 videos
Singly-Linked Lists9m
Doubly-Linked Lists4m
Stacks10m
Queues7m
Trees11m
Tree Traversal10m
7 readings
Welcome10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Available Programming Languages10m
FAQ on Programming Assignments10m
Acknowledgements10m
1 practice exercise
Basic Data Structures30m
Week
2

Week 2

1 hour to complete

Dynamic Arrays and Amortized Analysis

1 hour to complete
5 videos (Total 31 min), 1 reading, 1 quiz
5 videos
Amortized Analysis: Aggregate Method5m
Amortized Analysis: Banker's Method6m
Amortized Analysis: Physicist's Method7m
Amortized Analysis: Summary2m
1 reading
Slides and External References10m
1 practice exercise
Dynamic Arrays and Amortized Analysis30m
Week
3

Week 3

7 hours to complete

Priority Queues and Disjoint Sets

7 hours to complete
15 videos (Total 129 min), 6 readings, 4 quizzes
15 videos
Naive Implementations of Priority Queues5m
Binary Trees1m
Basic Operations12m
Complete Binary Trees9m
Pseudocode8m
Heap Sort10m
Building a Heap10m
Final Remarks4m
Overview7m
Naive Implementations10m
Trees for Disjoint Sets7m
Union by Rank9m
Path Compression6m
Analysis (Optional)18m
6 readings
Slides10m
Tree Height Remark10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
3 practice exercises
Priority Queues: Quiz30m
Quiz: Disjoint Sets30m
Priority Queues and Disjoint Sets30m
Week
4

Week 4

6 hours to complete

Hash Tables

6 hours to complete
22 videos (Total 170 min), 4 readings, 3 quizzes
22 videos
Analysing Service Access Logs7m
Direct Addressing7m
List-based Mapping8m
Hash Functions3m
Chaining Scheme6m
Chaining Implementation and Analysis5m
Hash Tables6m
Phone Book Problem4m
Phone Book Problem - Continued6m
Universal Family9m
Hashing Integers9m
Proof: Upper Bound for Chain Length (Optional)8m
Proof: Universal Family for Integers (Optional)11m
Hashing Strings9m
Hashing Strings - Cardinality Fix7m
Search Pattern in Text7m
Rabin-Karp's Algorithm9m
Optimization: Precomputation9m
Optimization: Implementation and Analysis5m
Instant Uploads and Storage Optimization in Dropbox10m
Distributed Hash Tables12m
4 readings
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
2 practice exercises
Hash Tables and Hash Functions30m
Hashing30m

Reviews

TOP REVIEWS FROM DATA STRUCTURES

View all reviews

About the Data Structures and Algorithms Specialization

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
Data Structures and Algorithms

Frequently Asked Questions

  • Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:

    • The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
    • The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

  • If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.

  • Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. Learn more.

  • This Course doesn't carry university credit, but some universities may choose to accept Course Certificates for credit. Check with your institution to learn more. Online Degrees and Mastertrack™ Certificates on Coursera provide the opportunity to earn university credit.

More questions? Visit the Learner Help Center.