課程信息
4.7
1,610 個評分
279 個審閱
專項課程

第 2 門課程(共 6 門),位於

100% 在線

100% 在線

立即開始,按照自己的計劃學習。
可靈活調整截止日期

可靈活調整截止日期

根據您的日程表重置截止日期。
中級

中級

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

完成時間(小時)

完成時間大約為30 小時

建議:4 weeks of study, 5-10 hours/week...
可選語言

英語(English)

字幕:英語(English)...

您將獲得的技能

Binary Search TreePriority QueueHash TableStack (Abstract Data Type)List
專項課程

第 2 門課程(共 6 門),位於

100% 在線

100% 在線

立即開始,按照自己的計劃學習。
可靈活調整截止日期

可靈活調整截止日期

根據您的日程表重置截止日期。
中級

中級

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

完成時間(小時)

完成時間大約為30 小時

建議:4 weeks of study, 5-10 hours/week...
可選語言

英語(English)

字幕:英語(English)...

教學大綱 - 您將從這門課程中學到什麼

1
完成時間(小時)
完成時間為 4 小時

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 個視頻(共 60 分鐘), 7 個閱讀材料, 2 個測驗
Video7 個視頻
Arrays7分鐘
Singly-Linked Lists9分鐘
Doubly-Linked Lists4分鐘
Stacks10分鐘
Queues7分鐘
Trees11分鐘
Tree Traversal10分鐘
Reading7 個閱讀材料
Welcome10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
Available Programming Languages10分鐘
FAQ on Programming Assignments10分鐘
Acknowledgements10分鐘
Quiz1 個練習
Basic Data Structures10分鐘
2
完成時間(小時)
完成時間為 1 小時

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 個視頻(共 31 分鐘), 1 個閱讀材料, 1 個測驗
Video5 個視頻
Amortized Analysis: Aggregate Method5分鐘
Amortized Analysis: Banker's Method6分鐘
Amortized Analysis: Physicist's Method7分鐘
Amortized Analysis: Summary2分鐘
Reading1 個閱讀材料
Slides and External References10分鐘
Quiz1 個練習
Dynamic Arrays and Amortized Analysis8分鐘
3
完成時間(小時)
完成時間為 6 小時

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 個視頻(共 129 分鐘), 6 個閱讀材料, 4 個測驗
Video15 個視頻
Naive Implementations of Priority Queues5分鐘
Binary Trees1分鐘
Basic Operations12分鐘
Complete Binary Trees9分鐘
Pseudocode8分鐘
Heap Sort10分鐘
Building a Heap10分鐘
Final Remarks4分鐘
Overview7分鐘
Naive Implementations10分鐘
Trees for Disjoint Sets7分鐘
Union by Rank9分鐘
Path Compression6分鐘
Analysis (Optional)18分鐘
Reading6 個閱讀材料
Slides10分鐘
Tree Height Remark10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
Quiz3 個練習
Priority Queues: Quiz12分鐘
Quiz: Disjoint Sets8分鐘
Priority Queues and Disjoint Sets6分鐘
4
完成時間(小時)
完成時間為 6 小時

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 個視頻(共 170 分鐘), 4 個閱讀材料, 3 個測驗
Video22 個視頻
Analysing Service Access Logs7分鐘
Direct Addressing7分鐘
List-based Mapping8分鐘
Hash Functions3分鐘
Chaining Scheme6分鐘
Chaining Implementation and Analysis5分鐘
Hash Tables6分鐘
Phone Book Problem4分鐘
Phone Book Problem - Continued6分鐘
Universal Family9分鐘
Hashing Integers9分鐘
Proof: Upper Bound for Chain Length (Optional)8分鐘
Proof: Universal Family for Integers (Optional)11分鐘
Hashing Strings9分鐘
Hashing Strings - Cardinality Fix7分鐘
Search Pattern in Text7分鐘
Rabin-Karp's Algorithm9分鐘
Optimization: Precomputation9分鐘
Optimization: Implementation and Analysis5分鐘
Instant Uploads and Storage Optimization in Dropbox10分鐘
Distributed Hash Tables12分鐘
Reading4 個閱讀材料
Slides and External References10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
Slides and External References10分鐘
Quiz2 個練習
Hash Tables and Hash Functions8分鐘
Hashing6分鐘
4.7
工作福利

83%

通過此課程獲得實實在在的工作福利
職業晉升

14%

加薪或升職

熱門審閱

創建者 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!

創建者 JKJan 28th 2017

Even though this course requires completion of tough assignments, I believe that this gave me a chance to understand and grasp core concepts about data structure and also about programming skills.

講師

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

關於 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....

關於 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...

關於 Data Structures and Algorithms 專項課程

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

常見問題

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您注册课程后,将有权访问专项课程中的所有课程,并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

還有其他問題嗎?請訪問 學生幫助中心