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.
Algorithms, Part IPrinceton University
About this Course
Skills you will gain
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.
- 5 stars90.24%
- 4 stars8.03%
- 3 stars0.96%
- 2 stars0.23%
- 1 star0.51%
TOP REVIEWS FROM ALGORITHMS, PART I
Excellent course, great material and the structure of the class allowed me to learn in depth and practice independently. I also appreciated the complexity of the automated assignment evaluation.
The best online course I've taken so far. The autograder really does its job! The tests are so thorough that it always takes me several attempts to finish an assignment, but it is always worth it!
Incredible learning experience. Every programmer in industry should take this course if only to dispel the idea that with the advent of cloud computing exponential algorithms can still ruin your day!
Excelent lessons, occasionally references lessons not included in the course but overall great lessons. The assignments are rather challenging but you are given all the tools to complete them.
Frequently Asked Questions
When will I have access to the lectures and assignments?
Do I need to pay for this course?
Can I earn a certificate in this course?
I have no familiarity with Java programming. Can I still take this course?
Which algorithms and data structures are covered in this course?
Which kinds of assessments are available in this course?
I am/was not a Computer Science major. Is this course for me?
How does this course differ from Design and Analysis of Algorithms?
More questions? Visit the Learner Help Center.