Zurück zu Trees and Graphs: Basics
Bewertung und Feedback des Lernenden für Trees and Graphs: Basics von University of Colorado Boulder
16 Bewertungen
Über den Kurs
Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data.
Trees and Graphs: Basics can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.
Filtern nach:
1 - 5 von 5 Bewertungen für Trees and Graphs: Basics
von Catherine G
•13. Juni 2021
This course is excellent. The instructor gives detailed, helpful lectures complete with clear examples that help solidify the concepts. The readings supplement the lectures nicely. The assignments are of appropriate difficulty and reinforce what we learn in the course material. I look forward to taking more courses with Sriram!
von Brian C
•3. Juli 2021
very solid course - would love more programming assignments and tougher final
von Mathan K M
•28. Mai 2021
Detailed lectures and thoroughly taught!
Interesting programming assignments.
But the operations on tree/graph could have been better explained using animated videos rather than whiteboard scribblings.
von SeungGeon K
•29. Aug. 2021
Great lecturer and course materials. Assignments were fun also
von Martin
•3. Juni 2021
Well made!
Coursera Footer
© 2021 Coursera Inc. Alle Rechte vorbehalten.
