Chevron Left
返回到 Trees and Graphs: Basics

學生對 科罗拉多大学波德分校 提供的 Trees and Graphs: Basics 的評價和反饋

33 個評分
9 條評論


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




Great lecturer and course materials. Assignments were fun also



I have grade 100% My mail id-


1 - Trees and Graphs: Basics 的 9 個評論(共 9 個)

創建者 Catherine G


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!

創建者 Mathan K M


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.

創建者 Rusty M


This is probably the closest you can get to a univesity course in Data Structures and Algorithms.

The lectures are detailed yet concise. Not too mathy but also not the easiest.

The quizzes solidifies your understandings and corrects your misundertandings.

There seems to be inconcistencies in the quality in programming assignments but overall, for example the programming assignment in MST encourage the "bad" use of dictionaries, while in the Shortest Path programing assignment, it encourages more clever use of data structures (i.e. idx). Still, overall, the programming assignments are good and they make you appreciate more the lessons.

創建者 Krish K


I have grade 100% My mail id-

創建者 Brian C


very solid course - would love more programming assignments and tougher final

創建者 Ming-Hao C


To me many things taught in the course are not clear enough. I had to guess what the instructor wanted to say frequently.

創建者 Jeffrey C


Pretty thorough. Lectures are great, and quizzes help test your understanding. The assignments do the job, and, are at times, a bit of a puzzle to figure out. I enjoyed the lectures and felt like I learned and was challanged. One will need more practice and study to achieve mastery following the course, but you'll defintiely come out of it with a far greater understanding of the trees and graphs.

創建者 SeungGeon K


Great lecturer and course materials. Assignments were fun also

創建者 mk


Well made!