The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
- 5 stars86.19%
- 4 stars11.46%
- 3 stars1.71%
- 2 stars0.26%
- 1 star0.36%
來自GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES的熱門評論
Excellent video lectures. Great forums that discuss the problems and programming assignments. Challenging material, with satisfying rewards on finding solutions.
Very well put together course. Problem sets are tricky; however, by the end of the course, you feel quite accomplished and comfortable dealing with graphs and basic data structures.
Tim really did an awesome job preparing the lectures for this course. Material was presented quickly, efficiently, and engagingly. I highly recommend this class.
This is an excellent course. Though the assignments are quite challenging, it is rewarding to complete them. Professor Roughgarden's explanations are wonderful.