Об этом курсе: This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
Автор: Принстонский университет
Преподаватели: Kevin Wayne, Senior Lecturer
Computer Science
Преподаватели: Robert Sedgewick, William O. Baker *39 Professor of Computer Science
Computer Science
| Уровень | Intermediate |
| Выполнение | 6 weeks of study, 6–10 hours per week. |
| Язык | English |
| Как пройти курс | Чтобы пройти курс, выполните все оцениваемые задания. |
| Оценки пользователей |
Программа курса
НЕДЕЛЯ 1
Course Introduction
Welcome to Algorithms, Part I.
1 видео, 2 материалов для самостоятельного изучения
- Leyendo: Welcome to Algorithms, Part I
- Leyendo: Lecture Slides
- Видео: Course Introduction
Union−Find
We illustrate our basic approach to developing and analyzing algorithms by considering the dynamic connectivity problem. We introduce the union−find data type and consider several implementations (quick find, quick union, weighted quick union, and weighted quick union with path compression). Finally, we apply the union−find data type to the percolation problem from physical chemistry.
5 видео, 2 материалов для самостоятельного изучения, 1 practice quiz
- Leyendo: Overview
- Leyendo: Lecture Slides
- Видео: Dynamic Connectivity
- Видео: Quick Find
- Видео: Quick Union
- Видео: Quick-Union Improvements
- Видео: Union−Find Applications
- Cuestionario de práctica: Interview Questions: Union–Find (ungraded)
Оцениваемый: Percolation
Analysis of Algorithms
The basis of our approach for analyzing the performance of algorithms is the scientific method. We begin by performing computational experiments to measure the running times of our programs. We use these measurements to develop hypotheses about performance. Next, we create mathematical models to explain their behavior. Finally, we consider analyzing the memory usage of our Java programs.
6 видео, 1 материал для самостоятельного изучения, 1 practice quiz
- Leyendo: Lecture Slides
- Видео: Analysis of Algorithms Introduction
- Видео: Observations
- Видео: Mathematical Models
- Видео: Order-of-Growth Classifications
- Видео: Theory of Algorithms
- Видео: Memory
- Cuestionario de práctica: Interview Questions: Analysis of Algorithms (ungraded)
НЕДЕЛЯ 2
Stacks and Queues
We consider two fundamental data types for storing collections of objects: the stack and the queue. We implement each using either a singly-linked list or a resizing array. We introduce two advanced Java features—generics and iterators—that simplify client code. Finally, we consider various applications of stacks and queues ranging from parsing arithmetic expressions to simulating queueing systems.
6 видео, 2 материалов для самостоятельного изучения, 1 practice quiz
- Leyendo: Overview
- Leyendo: Lecture Slides
- Видео: Stacks
- Видео: Resizing Arrays
- Видео: Queues
- Видео: Generics
- Видео: Iterators
- Видео: Stack and Queue Applications (optional)
- Cuestionario de práctica: Interview Questions: Stacks and Queues (ungraded)
Оцениваемый: Deques and Randomized Queues
Elementary Sorts
We introduce the sorting problem and Java's Comparable interface. We study two elementary sorting methods (selection sort and insertion sort) and a variation of one of them (shellsort). We also consider two algorithms for uniformly shuffling an array. We conclude with an application of sorting to computing the convex hull via the Graham scan algorithm.
6 видео, 1 материал для самостоятельного изучения, 1 practice quiz
- Leyendo: Lecture Slides
- Видео: Sorting Introduction
- Видео: Selection Sort
- Видео: Insertion Sort
- Видео: Shellsort
- Видео: Shuffling
- Видео: Convex Hull
- Cuestionario de práctica: Interview Questions: Elementary Sorts (ungraded)
НЕДЕЛЯ 3
Mergesort
We study the mergesort algorithm and show that it guarantees to sort any array of n items with at most n lg n compares. We also consider a nonrecursive, bottom-up version. We prove that any compare-based sorting algorithm must make at least n lg n compares in the worst case. We discuss using different orderings for the objects that we are sorting and the related concept of stability.
5 видео, 2 материалов для самостоятельного изучения, 1 practice quiz
- Leyendo: Overview
- Leyendo: Lecture Slides
- Видео: Mergesort
- Видео: Bottom-up Mergesort
- Видео: Sorting Complexity
- Видео: Comparators
- Видео: Stability
- Cuestionario de práctica: Interview Questions: Mergesort (ungraded)
Оцениваемый: Collinear Points
Quicksort
We introduce and implement the randomized quicksort algorithm and analyze its performance. We also consider randomized quickselect, a quicksort variant which finds the kth smallest item in linear time. Finally, we consider 3-way quicksort, a variant of quicksort that works especially well in the presence of duplicate keys.
4 видео, 1 материал для самостоятельного изучения, 1 practice quiz
- Leyendo: Lecture Slides
- Видео: Quicksort
- Видео: Selection
- Видео: Duplicate Keys
- Видео: System Sorts
- Cuestionario de práctica: Interview Questions: Quicksort (ungraded)
НЕДЕЛЯ 4
Priority Queues
We introduce the priority queue data type and an efficient implementation using the binary heap data structure. This implementation also leads to an efficient sorting algorithm known as heapsort. We conclude with an applications of priority queues where we simulate the motion of n particles subject to the laws of elastic collision.
4 видео, 2 материалов для самостоятельного изучения, 1 practice quiz
- Leyendo: Overview
- Leyendo: Lecture Slides
- Видео: APIs and Elementary Implementations
- Видео: Binary Heaps
- Видео: Heapsort
- Видео: Event-Driven Simulation (optional)
- Cuestionario de práctica: Interview Questions: Priority Queues (ungraded)
Оцениваемый: 8 Puzzle
Elementary Symbol Tables
We define an API for symbol tables (also known as associative arrays, maps, or dictionaries) and describe two elementary implementations using a sorted array (binary search) and an unordered list (sequential search). When the keys are Comparable, we define an extended API that includes the additional methods min, max floor, ceiling, rank, and select. To develop an efficient implementation of this API, we study the binary search tree data structure and analyze its performance.
6 видео, 1 материал для самостоятельного изучения, 1 practice quiz
- Leyendo: Lecture Slides
- Видео: Symbol Table API
- Видео: Elementary Implementations
- Видео: Ordered Operations
- Видео: Binary Search Trees
- Видео: Ordered Operations in BSTs
- Видео: Deletion in BSTs
- Cuestionario de práctica: Interview Questions: Elementary Symbol Tables (ungraded)
НЕДЕЛЯ 5
Balanced Search Trees
In this lecture, our goal is to develop a symbol table with guaranteed logarithmic performance for search and insert (and many other operations). We begin with 2−3 trees, which are easy to analyze but hard to implement. Next, we consider red−black binary search trees, which we view as a novel way to implement 2−3 trees as binary search trees. Finally, we introduce B-trees, a generalization of 2−3 trees that are widely used to implement file systems.
3 видео, 2 материалов для самостоятельного изучения, 1 practice quiz
- Leyendo: Overview
- Leyendo: Lecture Slides
- Видео: 2−3 Search Trees
- Видео: Red-Black BSTs
- Видео: B-Trees (optional)
- Cuestionario de práctica: Interview Questions: Balanced Search Trees (ungraded)
Geometric Applications of BSTs
We start with 1d and 2d range searching, where the goal is to find all points in a given 1d or 2d interval. To accomplish this, we consider kd-trees, a natural generalization of BSTs when the keys are points in the plane (or higher dimensions). We also consider intersection problems, where the goal is to find all intersections among a set of line segments or rectangles.
5 видео, 1 материал для самостоятельного изучения
- Leyendo: Lecture Slides
- Видео: 1d Range Search
- Видео: Line Segment Intersection
- Видео: Kd-Trees
- Видео: Interval Search Trees
- Видео: Rectangle Intersection
Оцениваемый: Kd-Trees
НЕДЕЛЯ 6
Hash Tables
We begin by describing the desirable properties of hash function and how to implement them in Java, including a fundamental tenet known as the uniform hashing assumption that underlies the potential success of a hashing application. Then, we consider two strategies for implementing hash tables—separate chaining and linear probing. Both strategies yield constant-time performance for search and insert under the uniform hashing assumption.
4 видео, 2 материалов для самостоятельного изучения, 1 practice quiz
- Leyendo: Overview
- Leyendo: Lecture Slides
- Видео: Hash Tables
- Видео: Separate Chaining
- Видео: Linear Probing
- Видео: Hash Table Context
- Cuestionario de práctica: Interview Questions: Hash Tables (ungraded)
Symbol Table Applications
We consider various applications of symbol tables including sets, dictionary clients, indexing clients, and sparse vectors.
4 видео, 1 материал для самостоятельного изучения
- Leyendo: Lecture Slides
- Видео: Symbol Table Applications: Sets (optional)
- Видео: Symbol Table Applications: Dictionary Clients (optional)
- Видео: Symbol Table Applications: Indexing Clients (optional)
- Видео: Symbol Table Applications: Sparse Vectors (optional)
Часто задаваемые вопросы
Как это работает
Trabajo del curso
Cada curso es como un libro de texto interactivo, con videos pregrabados, cuestionarios y proyectos.
Ayuda de tus compañeros
Conéctate con miles de estudiantes y debate ideas y materiales del curso, y obtén ayuda para dominar los conceptos.
Авторы
Принстонский университет
Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
Рейтинги и отзывы
I work outside of this field. No prior education, interest, foundation. So far so good. Will surely be stumped by parts of this, but along for the ride. I am best educated via imagery at times, especially in discussing concrete subjects. I stopped at calculus I. I didn't do so well.... I tried.... we'll see how this goes. I"m glad this is here.
Thank you so much Professor Sedgewick. This is one of the greatest computer science course I've ever taken!
Nice course, interesting topics. Material was presented in a way that I found very clear.
Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.
© Coursera Inc., 2018 Все права защищены.
IS
Very good.