About this Course

1,079,667 recent views

Learner Career Outcomes

32%

started a new career after completing these courses

34%

got a tangible career benefit from this course

17%

got a pay increase or promotion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 53 hours to complete
English
Subtitles: English, Korean, Russian

Skills you will gain

Data StructureAlgorithmsJava Programming

Learner Career Outcomes

32%

started a new career after completing these courses

34%

got a tangible career benefit from this course

17%

got a pay increase or promotion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 53 hours to complete
English
Subtitles: English, Korean, Russian

Offered by

Princeton University logo

Princeton University

Syllabus - What you will learn from this course

Content RatingThumbs Up98%(51,749 ratings)Info
Week
1

Week 1

10 minutes to complete

Course Introduction

10 minutes to complete
1 video (Total 9 min), 2 readings
1 video
2 readings
Welcome to Algorithms, Part I1m
Lecture Slides
9 hours to complete

Union−Find

9 hours to complete
5 videos (Total 51 min), 2 readings, 2 quizzes
5 videos
Quick Find10m
Quick Union7m
Quick-Union Improvements13m
Union−Find Applications9m
2 readings
Overview1m
Lecture Slides
1 practice exercise
Interview Questions: Union–Find (ungraded)
1 hour to complete

Analysis of Algorithms

1 hour to complete
6 videos (Total 66 min), 1 reading, 1 quiz
6 videos
Observations10m
Mathematical Models12m
Order-of-Growth Classifications14m
Theory of Algorithms11m
Memory8m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Analysis of Algorithms (ungraded)
Week
2

Week 2

9 hours to complete

Stacks and Queues

9 hours to complete
6 videos (Total 61 min), 2 readings, 2 quizzes
6 videos
Resizing Arrays9m
Queues4m
Generics9m
Iterators7m
Stack and Queue Applications (optional)13m
2 readings
Overview1m
Lecture Slides
1 practice exercise
Interview Questions: Stacks and Queues (ungraded)
1 hour to complete

Elementary Sorts

1 hour to complete
6 videos (Total 63 min), 1 reading, 1 quiz
6 videos
Selection Sort6m
Insertion Sort9m
Shellsort10m
Shuffling7m
Convex Hull13m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Elementary Sorts (ungraded)
Week
3

Week 3

9 hours to complete

Mergesort

9 hours to complete
5 videos (Total 49 min), 2 readings, 2 quizzes
5 videos
Bottom-up Mergesort3m
Sorting Complexity9m
Comparators6m
Stability5m
2 readings
Overview
Lecture Slides
1 practice exercise
Interview Questions: Mergesort (ungraded)
1 hour to complete

Quicksort

1 hour to complete
4 videos (Total 50 min), 1 reading, 1 quiz
4 videos
Selection7m
Duplicate Keys11m
System Sorts11m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Quicksort (ungraded)
Week
4

Week 4

9 hours to complete

Priority Queues

9 hours to complete
4 videos (Total 74 min), 2 readings, 2 quizzes
4 videos
Binary Heaps23m
Heapsort14m
Event-Driven Simulation (optional)22m
2 readings
Overview10m
Lecture Slides
1 practice exercise
Interview Questions: Priority Queues (ungraded)
1 hour to complete

Elementary Symbol Tables

1 hour to complete
6 videos (Total 77 min), 1 reading, 1 quiz
6 videos
Elementary Implementations9m
Ordered Operations6m
Binary Search Trees19m
Ordered Operations in BSTs10m
Deletion in BSTs9m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Elementary Symbol Tables (ungraded)8m

Reviews

TOP REVIEWS FROM ALGORITHMS, PART I

View all reviews

Frequently Asked Questions

  • Once you enroll, you’ll have access to all videos and programming assignments.

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

  • No. As per Princeton University policy, no certificates, credentials, or reports are awarded in connection with 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.

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

  • This Course doesn't carry university credit, but some universities may choose to accept Course Certificates for credit. Check with your institution to learn more. Online Degrees and Mastertrack™ Certificates on Coursera provide the opportunity to earn university credit.

More questions? Visit the Learner Help Center.