Robert Sedgewick
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. All the features of this course are available for free. It does not offer a certificate upon completion. 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.
Instructor Details
Courses : 4
Specification: Algorithms, Part II
|
47 reviews for Algorithms, Part II
Add a review
| Provider | |
|---|---|
| Duration | 36 hours |
| Year | 2017 |
| Level | Intermediate |
| Language | English ... |
| Certificate | Yes |
| Quizzes | No |
KINER B S –
This was a wonderful course which covers very interesting topics. I liked the assignments; all were based on interesting and challenging practical problems. The lectures gave a very simple and straightforward explanation to concepts. Thanks to the professors for the amazing resources and also to the mentors who helped throughout the course with assignments and doubts.
Anton H –
Very interesting and useful course. It gave you background in the most algorithms and data structure. It had changed my mind. One notice here… The assignment some times quite challenging and some of them had taken from me about 5 days, however some of them could be really resolved during 3 5 hours. Thanks!
yichen z –
nice!
Li X –
Good lessen for algorithm knowledge learning.
Jiaoxuan L –
Rich content. Liked the teaching style as well. But wish that it had an as strong supporting system as Part I’s and mentors/fellow students could answer more questions.
Wangyu H –
Really illuminating though difficult. Time and effort will pay sooner or later. 😀
Tatiana D –
Complex concepts in plain language. Challenging and interesting practice exercises. Without them it’s impossible to fully understand theoretical part.
Danijel T –
This is really wonderful course with amazing instructors, supportive community and top notch material. I would recommend this course to anyone, it will change the way you think and approach problems. I have been apple to apply some of the things thought in the course to a couple of very hard problems in the company i work at. Until that point nobody had an idea how to solve these problems.
Li F –
great course. Thanks very much for providing this course!
Anil K –
Amazing course! Loved the theory and exercises! Just a note for others: Its part 1 had almost no dependency on book, but this part 2 has some dependency (e.g. chapter on Graph) on book as well.
Renlin Z –
Wonderful Class!
Ilyas B –
Best course i ve seen by far
Madhav P –
More than the course content, I liked the problems that were being discussed and the assignment problems.
Batchema –
Challenging and extremely useful!
Ch –
so good, but the quality of the voice is decreased, comparing with the part I !
Hermawan M –
This is an excellent course as an introduction to algorithms. Together with part 1, the Princeton Algorithms series is the best MOOC course I’ve ever done.
Mohit V –
I am very excited to learn from this course.
Vadim –
Awesome course. Even if you are an experienced software developer it can give you many valuable insights!
Maria L V –
Learned a lot though I still have long path in front of me befofe I master it all 🙂
Yachendra R –
Extensive coverage of algorithms, great material and very clear explanation..
shant c –
So finally I got a chance to finish this course. And no surprise the experience was very fulfilling and awesome. The explanation by Dr. Robert and the assignment designed for each week are of very high quality. As usual the assignments have practical applications. The available libraries will save you time from implementing the basic API and focus at algorithm level and reinforce the learning. I would like to thank Dr. Robert, Dr. Kevin, and the mentors for creating this awesome course. I would highly recommend this course.
Mallasamudram P A –
Dr. Sedgewick is simply amazing. I enjoy how he motivates the need for efficient algorithms and applications. I only wish he would offer more courses!
Hanbo S –
Amazing!!!
Michael C –
Excellent course in the very same concise, rigorous style as Part I, highly recommended. Thank you Prof Sedgewick!
Zongwei F –
harder than part1, but the topics are especially important for algorithms learners and future programmers!
Ronald A –
adadad
Amit N –
Awesome! Really liked overall coverage of the course. Good Work.
Lingya H –
Thanks a lot. I will keep going and getting over.
Guibao W –
The ideas are clear and inspiring, the courseware well designed, the programming assignments educational. There are technical interview questions in each section, so definitely needed for fresh job candidates: )
Wassim a –
Amazing course !
Michaelbear –
This is a wonderful class which walks you through the every basic and crucial concepts of the algorithms and data structure. Really helpful! I’d recommend this course to anyone who wants to have a profound understanding of computer science.
Potter –
After learning this course, I found I was never learnt to write a meaningful program before. You let me to think in different way with a more broaden horizon. Thank you all !
Vladimir V –
Great course, makes you smarter.
wsx –
awesome !!!
Oliver Z –
Fantastic course! learned a lot
Jack –
Great course, a little fast paced, and more advanced than the first. But you’ll get high quality animations of the graph and string algorithms and fun assignments that will make you better at Java. Maybe the best explanation of radix sorting I’ve ever seen. The optional last week of the course introduces linear programming, reductions, and intractability which serve as motivational primers for further study. My only gripe is wanting more assignments, maybe one for each lecture, but 5 are likely enough for most people.
Salman A M –
Pretty good material, although exercises could be more interactive.
Sam T –
Excellent and challenging course. The assignments were tough but enriching. Worth every bit of time.
Shining S T –
WOAH! WHADUP
Sapozhnikov K –
Awesome series. It was not easy, but really helpful.
Edwins L P –
Excellent course and materials about algorithms and data structures. Very challenging exercises that make you think hard to achieve the passing score.
Andrew H –
Sometimes the homework assignments made me want to give up on the course and move on, but I have realized that I have become a better programmer than before and the homework really stretched my problem solving skills
Rajneesh v –
one of the best described course, content and presentation is way way better than other similar courses.
Timur S –
Excellent, as expected.
Petro V –
Very good and deep course.
Breeze L –
obviously huge efforts paid to design this wonderful online course
Anton M –
Fabulous course! A bit harder than first part, but still great and engaging.