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의 최상위 리뷰
Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.
Learning algorithms is a must for all computer scientists. This course propels you on the path and kindles the spirit of inquiry and knack for finding better solutions.
assignments didn't seem as interesting or complex as class 1, besides week 1 of class 2. Lecture material was high quality however, and the advanced optional material is appreciated
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
알고리즘 특화 과정 정보
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.