Chevron Left
Voltar para Trees and Graphs: Basics

Comentários e feedback de alunos de Trees and Graphs: Basics da instituição Universidade do Colorado em Boulder

4.8
estrelas
16 classificações
5 avaliações

Sobre o curso

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....
Filtrar por:

1 — 5 de 5 Avaliações para o Trees and Graphs: Basics

por Catherine G

13 de Jun de 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!

por Brian C

3 de Jul de 2021

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

por Mathan K M

28 de Mai de 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.

por SeungGeon K

29 de Ago de 2021

Great lecturer and course materials. Assignments were fun also

por Martin

3 de Jun de 2021

Well made!