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.38%
- 4 stars7.92%
- 3 stars0.94%
- 2 stars0.23%
- 1 star0.50%
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 course lost a lot without tests. Theory is great. Assignments are pain in the azz - too much is assumed here and there. You must resubmit like a dozen of times to figure out what is wrong.
fantastic intro course to start exploring the world of 'real' programming, with a focus on memory and clever processing, this gives you the first steps on the way to more powerful programming
Extremely well designed course. The assignments touch all the concepts taught in the class. Lot of concepts get clarified when you try to reach 100% on each assignment. Highly recommend this course.
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.