提供方

普林斯顿大学

課程信息

484,218 次近期查看

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.
All the features of this course are available for free. It does not offer a certificate upon completion.

立即開始，按照自己的計劃學習。

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

建議：6 weeks of study, 6–10 hours per week....

字幕：英語（English）, 韓語

Data StructurePriority QueueAlgorithmsJava Programming

立即開始，按照自己的計劃學習。

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

建議：6 weeks of study, 6–10 hours per week....

字幕：英語（English）, 韓語

週

1Welcome to Algorithms, Part I....

1 個視頻 （總計 9 分鐘）, 2 個閱讀材料

Welcome to Algorithms, Part I1分鐘

Lecture Slides

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 個視頻 （總計 51 分鐘）, 2 個閱讀材料, 2 個測驗

Quick Find10分鐘

Quick Union7分鐘

Quick-Union Improvements13分鐘

Union−Find Applications9分鐘

Overview1分鐘

Lecture Slides

Interview Questions: Union–Find (ungraded)

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 個視頻 （總計 66 分鐘）, 1 個閱讀材料, 1 個測驗

Observations10分鐘

Mathematical Models12分鐘

Order-of-Growth Classifications14分鐘

Theory of Algorithms11分鐘

Memory8分鐘

Lecture Slides

Interview Questions: Analysis of Algorithms (ungraded)

週

2We 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 個視頻 （總計 61 分鐘）, 2 個閱讀材料, 2 個測驗

Stacks16分鐘

Resizing Arrays9分鐘

Queues4分鐘

Generics9分鐘

Iterators7分鐘

Stack and Queue Applications (optional)13分鐘

Overview1分鐘

Lecture Slides

Interview Questions: Stacks and Queues (ungraded)

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 個視頻 （總計 63 分鐘）, 1 個閱讀材料, 1 個測驗

Selection Sort6分鐘

Insertion Sort9分鐘

Shellsort10分鐘

Shuffling7分鐘

Convex Hull13分鐘

Lecture Slides

Interview Questions: Elementary Sorts (ungraded)

週

3We 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 個視頻 （總計 49 分鐘）, 2 個閱讀材料, 2 個測驗

Overview

Lecture Slides

Interview Questions: Mergesort (ungraded)

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 個視頻 （總計 50 分鐘）, 1 個閱讀材料, 1 個測驗

Lecture Slides

Interview Questions: Quicksort (ungraded)

週

4We 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 個視頻 （總計 74 分鐘）, 2 個閱讀材料, 2 個測驗

Binary Heaps23分鐘

Heapsort14分鐘

Event-Driven Simulation (optional)22分鐘

Overview10分鐘

Lecture Slides

Interview Questions: Priority Queues (ungraded)

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 個視頻 （總計 77 分鐘）, 1 個閱讀材料, 1 個測驗

Symbol Table API21分鐘

Elementary Implementations9分鐘

Ordered Operations6分鐘

Binary Search Trees19分鐘

Ordered Operations in BSTs10分鐘

Deletion in BSTs9分鐘

Lecture Slides

Interview Questions: Elementary Symbol Tables (ungraded)8分鐘

週

5In 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 個視頻 （總計 63 分鐘）, 2 個閱讀材料, 1 個測驗

Overview10分鐘

Lecture Slides

Interview Questions: Balanced Search Trees (ungraded)6分鐘

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 個視頻 （總計 66 分鐘）, 1 個閱讀材料, 1 個測驗

Line Segment Intersection5分鐘

Kd-Trees29分鐘

Interval Search Trees13分鐘

Rectangle Intersection8分鐘

Lecture Slides

週

6We 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 個視頻 （總計 50 分鐘）, 2 個閱讀材料, 1 個測驗

Overview10分鐘

Lecture Slides

Interview Questions: Hash Tables (ungraded)

We consider various applications of symbol tables including sets, dictionary clients, indexing clients, and sparse vectors....

4 個視頻 （總計 26 分鐘）, 1 個閱讀材料

Symbol Table Applications: Dictionary Clients (optional)5分鐘

Symbol Table Applications: Indexing Clients (optional)7分鐘

Symbol Table Applications: Sparse Vectors (optional)7分鐘

Lecture Slides

4.9

1,034 個審閱完成這些課程後已開始新的職業生涯

通過此課程獲得實實在在的工作福利

加薪或升職

創建者 RM•Jun 1st 2017

This is a great class. I learned / re-learned a ton. The assignments were challenge and left a definite feel of accomplishment. The programming environment and automated grading system were excellent.

創建者 BJ•Jun 3rd 2018

Good contents and the logic of the whole course structure is very clear for a novice like me. The weekly homework is also awesome. Would recommend to anyone who wants to learn about computer science.

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

我什么时候能够访问课程视频和作业？

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

Do I need to pay for this course?

No. All features of this course are available for free.

Can I earn a certificate in this course?

No. As per Princeton University policy, no certificates, credentials, or reports are awarded in connection with this course.

I have no familiarity with Java programming. Can I still take this course?

Our central thesis is that algorithms are best understood by implementing and testing them. Our use of Java is essentially expository, and we shy away from exotic language features, so we expect you would be able to adapt our code to your favorite language. However, we require that you submit the programming assignments in Java.

Which algorithms and data structures are covered in this course?

Part I focuses on elementary data structures, sorting, and searching. Topics include union-find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, red−black trees, separate-chaining and linear-probing hash tables, Graham scan, and kd-trees.

Part II focuses on graph and string-processing algorithms. Topics include depth-first search, breadth-first search, topological sort, Kosaraju−Sharir, Kruskal, Prim, Dijkistra, Bellman−Ford, Ford−Fulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, multiway tries, ternary search tries, Knuth−Morris−Pratt, Boyer−Moore, Rabin−Karp, regular expression matching, run-length coding, Huffman coding, LZW compression, and the Burrows−Wheeler transform.

What kinds of assessments are available in this course?

Weekly exercises, weekly programming assignments, weekly interview questions, and a final exam.

The exercises are primarily composed of short drill questions (such as tracing the execution of an algorithm or data structure), designed to help you master the material.

The programming assignments involve either implementing algorithms and data structures (deques, randomized queues, and kd-trees) or applying algorithms and data structures to an interesting domain (computational chemistry, computational geometry, and mathematical recreation). The assignments are evaluated using a sophisticated autograder that provides detailed feedback about style, correctness, and efficiency.

The interview questions are similar to those that you might find at a technical job interview. They are optional and not graded.

I am/was not a Computer Science major. Is this course for me?

This course is for anyone using a computer to address large problems (and therefore needing efficient algorithms). At Princeton, over 25% of all students take the course, including people majoring in engineering, biology, physics, chemistry, economics, and many other fields, not just computer science.

How does this course differ from Design and Analysis of Algorithms?

The two courses are complementary. This one is essentially a programming course that concentrates on developing code; that one is essentially a math course that concentrates on understanding proofs. This course is about learning algorithms in the context of implementing and testing them in practical applications; that one is about learning algorithms in the context of developing mathematical models that help explain why they are efficient. In typical computer science curriculums, a course like this one is taken by first- and second-year students and a course like that one is taken by juniors and seniors.

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