About this Course
30,974

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Beginner Level

Approx. 24 hours to complete

Suggested: 10 weeks of study, 10-20 hours/week...

English

Subtitles: English

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Beginner Level

Approx. 24 hours to complete

Suggested: 10 weeks of study, 10-20 hours/week...

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
7 hours to complete

BASIC PROGRAMMING CONCEPTS

Why program? This lecture addresses that basic question. Then it describes the anatomy of your first program and the process of developing a program in Java using either virtual terminals or a program development environment, with some historical context. Most of the lecture is devoted to a thorough coverage of Java's built-in data types, with example programs for each....
4 videos (Total 75 min), 2 readings, 2 quizzes
4 videos
Program development16m
Built-in data types32m
Type conversion10m
2 readings
Supplements for Lecture 110m
Optional Enrichment on Basic Programming Concepts10m
1 practice exercise
Basic Programming Concepts
Week
2
6 hours to complete

CONDITIONALS AND LOOPS

The if, while, and for statements are Java's fundamental control structures. This lecture is built around short programs that use these constructs to address important computational tasks. Examples include sorting, computing the square root, factoring, and simulating a random process. The lecture concludes with a detailed example illustrating the process of debugging a program....
5 videos (Total 56 min), 2 readings, 2 quizzes
5 videos
Loops: the while statement11m
An alternative: the for loop6m
Nesting11m
Debugging20m
2 readings
Supplements for Lecture 210m
Optional Enrichment on Conditionals and Loops10m
1 practice exercise
Conditionals and Loops
Week
3
6 hours to complete

ARRAYS

Computing with a large sequence of values of the same type is extremely common. This lecture describes Java's built-in array data structure that supports such applications, with several examples, including shuffling a deck of cards, the coupon collector test for randomness, and random walks in a grid....
3 videos (Total 57 min), 2 readings, 2 quizzes
3 videos
Typical array-processing code23m
Two-dimensional arrays16m
2 readings
Supplements for Lecture 310m
Optional Enrichment on Arrays10m
1 practice exercise
Arrays
Week
4
6 hours to complete

INPUT AND OUTPUT

To interact with our programs, we need mechanisms for taking information from the outside world and for presenting information to the outside world. This lecture describes several such mechanisms: for text, drawings, and animation. Detailed examples covered include fractal drawings that model natural phenomena and an animation of a ball bouncing around in the display window....
4 videos (Total 49 min), 2 readings, 2 quizzes
4 videos
Standard drawing9m
Fractal drawings10m
Animation6m
2 readings
Supplements for Lecture 410m
Optional Enrichment on Input and Output10m
1 practice exercise
Input and Output
Week
5
6 hours to complete

FUNCTIONS AND LIBRARIES

Modular programming is the art and science of breaking a program into pieces that can be individually developed. This lecture introduces functions (Java methods), a fundamental mechanism that enables modular programming. Motivating examples include functions for the classic Gaussian distribution and an application that creates digital music....
4 videos (Total 60 min), 2 readings, 2 quizzes
4 videos
Case study: Digital audio17m
Application: Gaussian distribution12m
Modular programming and libraries14m
2 readings
Supplements for Lecture 510m
Optional Enrichment on Functions and Libraries10m
1 practice exercise
Functions and Libraries
Week
6
6 hours to complete

RECURSION

A recursive function is one that calls itself. This lecture introduces the concept by treating in detail the ruler function and (related) classic examples, including the Towers of Hanoi puzzle, the H-tree, and simple models of the real world based on recursion. We show a common pitfall in the use of recursion, and a simple way to avoid it, which introduces a different (related) programming paradigm known as dynamic programming....
5 videos (Total 58 min), 2 readings, 2 quizzes
5 videos
A classic example11m
Recursive graphics11m
Avoiding exponential waste9m
Dynamic programming14m
2 readings
Supplements for Lecture 610m
Optional Enrichment on Recursion10m
1 practice exercise
Recursion
Week
7
6 hours to complete

PERFORMANCE

When you develop a program, you need to be aware of its resource requirements. In this lecture, we describe a scientific approach to understanding performance, where we develop mathematical models describing the running time our programs and then run empirical tests to validate them. Eventually we come to a simple and effective approach that you can use to predict the running time of your own programs that involve significant amounts of computation....
5 videos (Total 66 min), 2 readings, 2 quizzes
5 videos
Empirical analysis11m
Mathematical models12m
Doubling method16m
Familiar examples9m
2 readings
Supplements for Lecture 710m
Optional Enrichment on Performance10m
1 practice exercise
Performance
Week
8
1 hour to complete

ABSTRACT DATA TYPES

In Java, you can create your own data types and use them in your programs. In this and the next lecture, we show how this ability allows us to view our programs as abstract representations of real-world concepts. First we show the mechanics of writing client programs that use data types. Our examples involve abstractions such as color, images, and genes. This style of programming is known as object-oriented programming because our programs manipulate objects, which hold data type values....
4 videos (Total 53 min), 2 readings, 1 quiz
4 videos
Color17m
Image processing12m
String processing15m
2 readings
Supplements for Lecture 810m
Optional Enrichment on Abstract Data Types10m
1 practice exercise
Abstract Data Types
Week
9
6 hours to complete

CREATING DATA TYPES

Creating your own data types is the central activity in modern Java programming. This lecture covers the mechanics (instance variables, constructors, instance methods, and test clients) and then develops several examples, culminating in a program that uses a quintessential mathematical abstraction (complex numbers) to create visual representations of the famous Mandelbrot set....
4 videos (Total 59 min), 2 readings, 2 quizzes
4 videos
Point charges20m
Turtle graphics10m
Complex numbers22m
2 readings
Supplements for Lecture 910m
Optional Enrichment on Creating Data Types10m
1 practice exercise
Creating Data Types
Week
10
1 hour to complete

PROGRAMMING LANGUAGES

We conclude the course with an overview of important issues surrounding programming languages. To convince you that your knowledge of Java will enable you to learn other programming languages, we show implementations of a typical program in C, C++, Python, and Matlab. We describe important differences among these languages and address fundamental issues, such as garbage collection, type checking, object oriented programming, and functional programming with some brief historical context....
5 videos (Total 67 min), 1 reading, 1 quiz
5 videos
Java in context8m
Object-oriented programming8m
Type checking8m
Functional programming12m
1 reading
Supplements for Lecture 1010m
1 practice exercise
Languages
4.9
5 ReviewsChevron Right

Top Reviews

By VSMay 14th 2019

Beautiful course. I am a software developer with 10+ years of experience in programming and have never realized depth of actual MATH behind all that I do. Thank you Robert Sedgewick, you are the BEST.

By BBMar 13th 2019

Excellent course, inface the best I found on any MOOC platform for a complete beginner to Java. Loved it. Would appreciate more coding assignments though. Only week 1 & 2 have those.

Instructors

Avatar

Robert Sedgewick

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

Kevin Wayne

Phillip Y. Goldman '86 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.

More questions? Visit the Learner Help Center.