About this Course
4.9
4,300개의 평가
932개의 리뷰
100% 온라인

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
유연한 마감

유연한 마감

일정에 따라 마감일을 재설정합니다.
중급 단계

중급 단계

Hours to complete

완료하는 데 약 31시간 필요

권장: 6 weeks of study, 6–10 hours per week....
사용 가능한 언어

영어

자막: 영어, 한국어

귀하가 습득할 기술

Data StructurePriority QueueAlgorithmsJava Programming
100% 온라인

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
유연한 마감

유연한 마감

일정에 따라 마감일을 재설정합니다.
중급 단계

중급 단계

Hours to complete

완료하는 데 약 31시간 필요

권장: 6 weeks of study, 6–10 hours per week....
사용 가능한 언어

영어

자막: 영어, 한국어

강의 계획 - 이 강좌에서 배울 내용

1
Hours to complete
완료하는 데 10분 필요

Course Introduction

Welcome to Algorithms, Part I....
Reading
1 video (Total 9 min), 2 readings
Video1개의 동영상
Reading2개의 읽기 자료
Welcome to Algorithms, Part I1m
Lecture Slides0
Hours to complete
완료하는 데 6시간 필요

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....
Reading
5 videos (Total 51 min), 2 readings, 2 quizzes
Video5개의 동영상
Quick Find10m
Quick Union7m
Quick-Union Improvements13m
Union−Find Applications9m
Reading2개의 읽기 자료
Overview1m
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Union–Find (ungraded)0
Hours to complete
완료하는 데 1시간 필요

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....
Reading
6 videos (Total 66 min), 1 reading, 1 quiz
Video6개의 동영상
Observations10m
Mathematical Models12m
Order-of-Growth Classifications14m
Theory of Algorithms11m
Memory8m
Reading1개의 읽기 자료
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Analysis of Algorithms (ungraded)0
2
Hours to complete
완료하는 데 6시간 필요

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....
Reading
6 videos (Total 61 min), 2 readings, 2 quizzes
Video6개의 동영상
Resizing Arrays9m
Queues4m
Generics9m
Iterators7m
Stack and Queue Applications (optional)13m
Reading2개의 읽기 자료
Overview1m
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Stacks and Queues (ungraded)0
Hours to complete
완료하는 데 1시간 필요

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....
Reading
6 videos (Total 63 min), 1 reading, 1 quiz
Video6개의 동영상
Selection Sort6m
Insertion Sort9m
Shellsort10m
Shuffling7m
Convex Hull13m
Reading1개의 읽기 자료
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Elementary Sorts (ungraded)0
3
Hours to complete
완료하는 데 6시간 필요

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....
Reading
5 videos (Total 49 min), 2 readings, 2 quizzes
Video5개의 동영상
Bottom-up Mergesort3m
Sorting Complexity9m
Comparators6m
Stability5m
Reading2개의 읽기 자료
Overview0
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Mergesort (ungraded)0
Hours to complete
완료하는 데 1시간 필요

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....
Reading
4 videos (Total 50 min), 1 reading, 1 quiz
Video4개의 동영상
Selection7m
Duplicate Keys11m
System Sorts11m
Reading1개의 읽기 자료
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Quicksort (ungraded)0
4
Hours to complete
완료하는 데 6시간 필요

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. ...
Reading
4 videos (Total 74 min), 2 readings, 2 quizzes
Video4개의 동영상
Binary Heaps23m
Heapsort14m
Event-Driven Simulation (optional)22m
Reading2개의 읽기 자료
Overview10m
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Priority Queues (ungraded)0
Hours to complete
완료하는 데 1시간 필요

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....
Reading
6 videos (Total 77 min), 1 reading, 1 quiz
Video6개의 동영상
Elementary Implementations9m
Ordered Operations6m
Binary Search Trees19m
Ordered Operations in BSTs10m
Deletion in BSTs9m
Reading1개의 읽기 자료
Lecture Slides0
Quiz1개 연습문제
Interview Questions: Elementary Symbol Tables (ungraded)8m

강사

Avatar

Kevin Wayne

Senior Lecturer
Computer Science
Avatar

Robert Sedgewick

William O. Baker *39 Professor of Computer Science
Computer Science

Princeton University 정보

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

자주 묻는 질문

  • 강좌에 등록하면 바로 모든 비디오, 테스트 및 프로그래밍 과제(해당하는 경우)에 접근할 수 있습니다. 상호 첨삭 과제는 이 세션이 시작된 경우에만 제출하고 검토할 수 있습니다. 강좌를 구매하지 않고 살펴보기만 하면 특정 과제에 접근하지 못할 수 있습니다.

  • 수료증을 구매하면 성적 평가 과제를 포함한 모든 강좌 자료에 접근할 수 있습니다. 강좌를 완료하면 전자 수료증이 성취도 페이지에 추가되며, 해당 페이지에서 수료증을 인쇄하거나 LinkedIn 프로필에 수료증을 추가할 수 있습니다. 강좌 콘텐츠만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.

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

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

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

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

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

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.