Chevron Left
Retour à Algorithmes, Partie II

Avis et commentaires pour d'étudiants pour Algorithmes, Partie II par Université de Princeton

4.9
étoiles
1,729 évaluations

À propos du cours

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

Meilleurs avis

IO

20 janv. 2018

Pretty challenging course, but very good. Having a book is a must (at least it was for me), video lectures complement book nicely, and some topics are explained better in the Algorithms, 4th ed. book.

MS

27 févr. 2021

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.

Filtrer par :

26 - 50 sur 309 Avis pour Algorithmes, Partie II

par Mohit S

28 févr. 2021

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.

par Yu C

12 mai 2022

This covers the most algorithm in the interview.

par DP

22 oct. 2020

The course was excellent and surprisingly was easier than the Part 1 course. This was mainly due to me just picking up Java in part 1. In the second part you will learn more complex and some ingenious algorithm that uses some of the data structure in Part 1. The assignments were moderately difficult but you will end up spending some time in order to get 100%. To sum up the course was great and I wish there was Part 3.

par Yusuf S C

2 déc. 2017

Great course. Very informative, very challenging. If you think Mr. Sedgewick is talking a bit boring I recommend to watch the videos 1.25x. He have very funny stories.

I should thank all of the people who supported/build this course.

Only 1 little tiny downside is sometimes for programming exercises you struggle with technical (non-algorithmic) details which is boring.

The only course that I'm planning to take again

par S.M. T U H

28 déc. 2020

It was a really great and challenging course, had a lot of fun going through the lectures and getting the challenges completed and along the way learned about important and efficient algorithms. The evaluation system and the IDE are awesome and give important feedback for troubleshooting. Thanks to Robert Sedgewick, Kevin Wayne and Princeton University for creating such a wonderful and informative course.

par WAN , Y

20 août 2018

One of the parts I like for this course is the assignment. The assignment is to implement the algorithm which is useful in practice. Thinking how to implement each and running each after implementation are entertaining and make me think about the algorithm deeply. An introduction to the various algorithms for different type of problems broaden my horizons.

Thanks for providing this wonderful course.

par Danijel T

26 mars 2019

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.

par Nguyen D L

14 oct. 2021

I love Algorithm II class. Years ago, I read the Algorithm books from Professor Sedgewick and found very interesting solution for my ASIC debug of a scan chain hold time issue where I was able to convert the search from a linear search to a binary search. This class gives me great opportunities to practice on many challenging projects.

Thank you so much Professor Wayne and Sedgewick

par Deleted A

25 nov. 2017

The great and professionally conducted course. Step-by-step examples of the execution of the described algorithms, weekly tasks and the real-life applications of the algorithms are one of the things that make this course so valuable.

Moreover, the quick response of Dr Kevin Wayne and the fix of an issue with the grader output in one of the assignments was a nice surprise.

par KINER B S

17 févr. 2019

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.

par Fabio C F

28 avr. 2018

Challenging, but rewarding. This is the state of the art when it comes to online courses. It doesn't get much better than this. Topics can be a bit hard to crack at a first glance, but explanations are done in such a way that complexity is built up appropriately and incrementally. With the right amount of diligence, you are able to wrap your head around eventually.

par Алексей Х

16 juin 2020

Great thanks to everyone who developed this wonderful course!

Good balanced theory and practice. Very much appreciated the ability to check correctness and effectiveness of performed programming assignments via autograder. Also thanks to everyone who discussed issues at forum. This course inspired me for further studying of other sections of computer science.

par Alex G

2 avr. 2022

This class is really amazing. The lectures really do a good job of breaking down the mechanics of data structures and algorithms so they are easy to understand. Homework is just hard enough to be challenging and satisfying, while the clear instructions and auto-grader feedback keep everything approachable. I really enjoyed this class and learned a ton.

par Jakub C

1 juil. 2018

Professor Sedgewick is a terrific instructor and this course teaches you to implement famous algorithms to solve very interesting homework problems. Wonderful combination of more theory (Stanford algo course) with more practice (Princeton algo course). This course is rigorous too but if you take both you will see the different areas of focus.

par hardy

7 nov. 2017

Although I have not finished this course, I feel that this course is useful for that I have learned a lot in this course, including but not limited to, basic data structure, sort algorithm, graph etc. In fact, it's better to choose Algorithms, Part One before taking this course. To sum up, this course is very very nice.

par 陈学海

2 mars 2018

This is a very fantastic course, it is very luck for me to have this course. I've learned a lot of things from the part1 to part2. Prof. Sedgewick and his team's work on the videos and homework design is beyond my expectation, I'm very respect for that, thanks a lot. Hope I can take more courses like this one.

par Anton H

22 févr. 2019

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!

par Edward J

8 sept. 2021

E​xcellent course covering fundamentals in graph theory, string sorting, substring searching, data compression and miscellaneous computer science topics. Definitely a challenging course so be prepared to invest a significant amount of time to really learn the concepts and apply them in the assignments.

par Cherubim

24 déc. 2020

Yet another amazing course. I enjoyed both the parts of the course. The assignments are the highlight of this course, they were crafted very well and give the student great insight and a sense of excitement and accomplishment on completing them. My only wish is that there were more parts to this course

par Maximilian V

30 août 2020

This is an absolutely fascinating course. More challenging than part I, it introduces less standard algorithms. The problem sets are a lot of fun and the teacher is as always amazing. Overall, a brilliantly executed course that is immensely interesting and helpful! Would recommend to get the book!

par Boris K

29 juin 2020

Putting aside from the sense of achievement in completing all the assignments, I learned a lot. Some of the assignments required coding string compression techniques, graph processing, solving games like Boggle and 8 puzzle for large problem sets, geometric problems and more.

Thanks to all of you.

par Guru K

5 janv. 2018

Excellent course for those who are interested in improving their algorithmic thinking and programming skills. The topics covered in this course and the programming assignments not only challenged my programming skills, but renewed my confidence level to face any complex programming challenges.

par Esa H

22 juin 2020

Although I'm an experienced programmers, I benefit a lot from this course. the way that each algorithm and problem described is very straight forward. I have completed Algorithm 1 and this course and now I understand a vast amount of underlying algorithms that power today software and tools.

par Jae N

7 juil. 2020

The instructor, Professor Sedgewick is excellent. Despite his low key approach, he nevertheless manages to exude enthusiasm for the dry subject matter. In addition, the assignments were excellent and challenging. I learned a lot from this course and I had fun doing the assignments.

par Kevin J

21 juil. 2020

Great Course which teaches you the fundamentals of many graph, string-processing, and other algorithms. I would recommend you take part I first. I found the material interesting, and this course definitely gets me interested in studying more algorithmic theory and design.