About this Course
158,838 recent views

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. 27 hours to complete

Suggested: 4 weeks of study, 5-10 hours/week...

English

Subtitles: English

Skills you will gain

Binary Search TreePriority QueueHash TableStack (Abstract Data Type)List

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. 27 hours to complete

Suggested: 4 weeks of study, 5-10 hours/week...

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
5 hours to complete

Basic Data Structures

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 Structures10m
Week
2
1 hour to complete

Dynamic Arrays and Amortized Analysis

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 Analysis8m
Week
3
6 hours to complete

Priority Queues and Disjoint Sets

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: Quiz12m
Quiz: Disjoint Sets8m
Priority Queues and Disjoint Sets6m
Week
4
6 hours to complete

Hash Tables

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 Functions8m
Hashing6m
4.7
374 ReviewsChevron Right

37%

started a new career after completing these courses

40%

got a tangible career benefit from this course

13%

got a pay increase or promotion

Top reviews from Data Structures

By TTApr 6th 2018

Data Structures was really interesting over all, also assignments are quite challenging. It's important to consult the external references & discussion forums if you want to get the best of it.

By SGOct 28th 2019

I found the course a little tough, but it's worth the effort. It takes more time than mentioned. Apart from that, it is actually good and covers most of the topics required for interviews.

Instructors

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

About University of California San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

About National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

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

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

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

More questions? Visit the Learner Help Center.