About this Course
4.8
66 ratings
12 reviews
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Intermediate Level

Intermediate Level

Hours to complete

Approx. 27 hours to complete

Suggested: 10 weeks of study, 2-5 hours/week...
Available languages

English

Subtitles: English
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Intermediate Level

Intermediate Level

Hours to complete

Approx. 27 hours to complete

Suggested: 10 weeks of study, 2-5 hours/week...
Available languages

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
Hours to complete
10 minutes to complete

INFORMATION ABOUT LECTURES 1-10

This lesson provides information about the course Computer Science: Programming with a Purpose, which is the precursor to Computer Science: Algorithms, Theory, and Machines....
Reading
1 reading
Reading1 reading
Information about Lectures 1-1010m
Hours to complete
2 hours to complete

SORTING AND SEARCHING

We introduce and study classic algorithms for two fundamental problems, in the context of realistic applications. Our message is that efficient algorithms (binary search and mergesort, in this case) are a key ingredient in addressing computational problems with scalable solutions that can handle huge instances, and that the scientific method is essential in evaluating the effectiveness of such solutions....
Reading
5 videos (Total 71 min), 3 readings, 1 quiz
Video5 videos
Binary search10m
Insertion sort11m
Mergesort12m
Longest repeated substring19m
Reading3 readings
Getting Started10m
Supplements for Lecture 1110m
Optional Enrichment on Sorting and Searching10m
Quiz1 practice exercise
Sorting and Searching8m
Week
2
Hours to complete
2 hours to complete

STACKS AND QUEUES

Our introduction to data structures is a careful look at the fundamental stack and queue abstractions, including performance specifications. Then we introduce the concept of linked structures and focus on their utility in developing simple, safe, clear, and efficient implementations of stacks and queues....
Reading
5 videos (Total 69 min), 2 readings, 1 quiz
Video5 videos
APIs13m
Clients22m
Strawman implementations9m
Linked lists15m
Implementations8m
Reading2 readings
Supplements for Lecture 1210m
Optional Enrichment on Stacks and Queues10m
Quiz1 practice exercise
Stacks and Queues8m
Week
3
Hours to complete
1 hour to complete

SYMBOL TABLES

The symbol table abstraction is one of the most important and useful programmer's tools, s we illustrate with several examples in this lecture. Extending the scientific approach of the previous two lectures, we introduce and study binary search trees, a classic data structure that supports efficient implementations of this abstraction....
Reading
5 videos (Total 57 min), 2 readings, 1 quiz
Video5 videos
A design challenge6m
Binary search trees13m
Implementation4m
Analysis8m
Reading2 readings
Supplements for Lecture 1310m
Optional Enrichment on Symbol Tables10m
Quiz1 practice exercise
Symbol Tables8m
Week
4
Hours to complete
2 hours to complete

INTRODUCTION TO THE THEORY OF COMPUTING

The theory of computing helps us address fundamental questions about the nature of computation while at the same time helping us better understand the ways in which we interact with the computer. In this lecture, we introduce formal languages and abstract machines, focusing on simple models that are actually widely useful in practical applications....
Reading
5 videos (Total 63 min), 2 readings, 1 quiz
Video5 videos
Regular Expressions20m
DFAs14m
Applications12m
Limitations9m
Reading2 readings
Supplements for Lecture 1410m
Optional Enrichment on Theory of Computing10m
Quiz1 practice exercise
Theory of Computing8m

Instructors

Avatar

Robert Sedgewick

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

Kevin Wayne

Senior Lecturer
Computer Science

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

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

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

More questions? Visit the Learner Help Center.