Data Structures

开始时间: 06/27/2020 持续时间: Unknown

所在平台: Coursera

课程类别: 计算机科学

大学或机构: CourseraNew

   

课程主页: https://www.coursera.org/learn/data-structures

Explore 1600+ online courses from top universities. Join Coursera today to learn data science, programming, business strategy, and more.

课程评论:没有评论

第一个写评论        关注课程

课程详情

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures. A few examples of questions that we are going to cover in this class are the following: 1. What is a good strategy of resizing a dynamic array? 2. How priority queues are implemented in C++, Java, and Python? 3. How to implement a hash table so that the amortized running time of all operations is O(1) on average? 4. What are good strategies to keep a binary tree balanced? You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space! Do you have technical problems? Write to us: coursera@hse.ru

数据结构:好的算法通常会与一组好的数据结构结合在一起,从而使算法能够有效地处理数据。在本课程中,我们将考虑在各种计算问题中使用的通用数据结构。您将学习如何以不同的编程语言实现这些数据结构,并在我们的编程任务中练习实现它们。这将帮助您了解数据结构的特定内置实现中正在发生的情况以及对数据结构的期望。您还将学习这些数据结构的典型用例。 以下是我们将在本课程中讨论的一些问题示例: 1.调整动态数组大小的好策略是什么? 2.如何在C ++,Java和Python中实现优先级队列? 3.如何实现哈希表,以使所有操作的摊销运行时间平均为O(1)? 4.有什么好的策略可以使二叉树保持平衡? 您还将学习Dropbox之类的服务如何立即上传一些大文件并节省大量存储空间! 你有技术上的问题吗?写信给我们:coursera@hse.ru

课程大纲

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.

课程评论(0条)

欢迎关注我们的公众号

NLPJob

课程简介

A good algorithm usually comes together with a set of good data structures that allow the algorithm

课程标签

数据结构 算法 数据结构与算法 数据结构与算法专项课程

0人关注该课程

主题相关的课程