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.
Algorithmes, Partie IUniversité de Princeton
À propos de ce cours
Compétences que vous acquerrez
- 5 stars90,12 %
- 4 stars8,13 %
- 3 stars0,96 %
- 2 stars0,24 %
- 1 star0,52 %
Meilleurs avis pour ALGORITHMES, PARTIE I
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.
The material and the teaching method are absolutely amazing. Not just a course for algorithms, but a course on "how to teach a course right" .. very thankful to the instructors and facilitators.
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.
An amazing course which enables one to appreciate and analyze various algorithms used in various applications. Must take for anyone who wants to build a career in computer science or related fields.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
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?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.