About this Course
4.7
1,646 ratings
285 reviews
Specialization
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Intermediate Level

Intermediate Level

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

Hours to complete

Approx. 29 hours to complete

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

English

Subtitles: English

Skills you will gain

Binary Search TreePriority QueueHash TableStack (Abstract Data Type)List
Specialization
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Intermediate Level

Intermediate Level

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

Hours to complete

Approx. 29 hours to complete

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

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
Hours to complete
4 hours to complete

Basic Data Structures

In this module, you will learn about the basic data structures used throughout the rest of this course. We start this module by looking in detail at the fundamental building blocks: arrays and linked lists. From there, we build up two important data structures: stacks and queues. Next, we look at trees: examples of how they’re used in Computer Science, how they’re implemented, and the various ways they can be traversed. Once you’ve completed this module, you will be able to implement any of these data structures, as well as have a solid understanding of the costs of the operations, as well as the tradeoffs involved in using each data structure....
Reading
7 videos (Total 60 min), 7 readings, 2 quizzes
Video7 videos
Singly-Linked Lists9m
Doubly-Linked Lists4m
Stacks10m
Queues7m
Trees11m
Tree Traversal10m
Reading7 readings
Welcome10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Available Programming Languages10m
FAQ on Programming Assignments10m
Acknowledgements10m
Quiz1 practice exercise
Basic Data Structures10m
Week
2
Hours to complete
1 hour to complete

Dynamic Arrays and Amortized Analysis

In this module, we discuss Dynamic Arrays: a way of using arrays when it is unknown ahead-of-time how many elements will be needed. Here, we also discuss amortized analysis: a method of determining the amortized cost of an operation over a sequence of operations. Amortized analysis is very often used to analyse performance of algorithms when the straightforward analysis produces unsatisfactory results, but amortized analysis helps to show that the algorithm is actually efficient. It is used both for Dynamic Arrays analysis and will also be used in the end of this course to analyze Splay trees....
Reading
5 videos (Total 31 min), 1 reading, 1 quiz
Video5 videos
Amortized Analysis: Aggregate Method5m
Amortized Analysis: Banker's Method6m
Amortized Analysis: Physicist's Method7m
Amortized Analysis: Summary2m
Reading1 reading
Slides and External References10m
Quiz1 practice exercise
Dynamic Arrays and Amortized Analysis8m
Week
3
Hours to complete
6 hours to complete

Priority Queues and Disjoint Sets

We start this module by considering priority queues which are used to efficiently schedule jobs, either in the context of a computer operating system or in real life, to sort huge files, which is the most important building block for any Big Data processing algorithm, and to efficiently compute shortest paths in graphs, which is a topic we will cover in our next course. For this reason, priority queues have built-in implementations in many programming languages, including C++, Java, and Python. We will see that these implementations are based on a beautiful idea of storing a complete binary tree in an array that allows to implement all priority queue methods in just few lines of code. We will then switch to disjoint sets data structure that is used, for example, in dynamic graph connectivity and image processing. We will see again how simple and natural ideas lead to an implementation that is both easy to code and very efficient. By completing this module, you will be able to implement both these data structures efficiently from scratch....
Reading
15 videos (Total 129 min), 6 readings, 4 quizzes
Video15 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
Reading6 readings
Slides10m
Tree Height Remark10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Quiz3 practice exercises
Priority Queues: Quiz12m
Quiz: Disjoint Sets8m
Priority Queues and Disjoint Sets6m
Week
4
Hours to complete
6 hours to complete

Hash Tables

In this module you will learn about very powerful and widely used technique called hashing. Its applications include implementation of programming languages, file systems, pattern search, distributed key-value storage and many more. You will learn how to implement data structures to store and modify sets of objects and mappings from one type of objects to another one. You will see that naive implementations either consume huge amount of memory or are slow, and then you will learn to implement hash tables that use linear memory and work in O(1) on average! In the end, you will learn how hash functions are used in modern disrtibuted systems and how they are used to optimize storage of services like Dropbox, Google Drive and Yandex Disk!...
Reading
22 videos (Total 170 min), 4 readings, 3 quizzes
Video22 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
Reading4 readings
Slides and External References10m
Slides and External References10m
Slides and External References10m
Slides and External References10m
Quiz2 practice exercises
Hash Tables and Hash Functions8m
Hashing6m
4.7
285 ReviewsChevron Right
Career Benefit

20%

got a tangible career benefit from this course
Career promotion

14%

got a pay increase or promotion

Top Reviews

By DGMay 24th 2016

I like this course very much! Rope is the cleverest task I have ever done! Of course, I hope in future I will work on even more difficult problems, but this is pretty good already for me as a student!

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.

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 communications, IT, mathematics, 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.