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).
Dieser Kurs ist Teil der Spezialisierung Spezialisierung Algorithmen
von
Über diesen Kurs
Kompetenzen, die Sie erwerben
- Graphs
- Data Structure
- Algorithms
- Hash Table
von

Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Lehrplan - Was Sie in diesem Kurs lernen werden
Week 1
Breadth-first and depth-first search; computing strong components; applications.
Week 2
Dijkstra's shortest-path algorithm.
Week 3
Heaps; balanced binary search trees.
Week 4
Hashing; bloom filters.
Bewertungen
- 5 stars86,18Â %
- 4 stars11,55Â %
- 3 stars1,68Â %
- 2 stars0,21Â %
- 1 star0,36Â %
Top-Bewertungen von GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
Good course, but instructor does start to move fast and a few walk-throughs in certain spots would be beneficial . However the lack of it makes you do your own research, which is also beneficial.
Very useful information for thorough programmers. Especially liked analysis of hash tables implementation and handling collisions in real applications.
There is very little hand-holding in this course and no code provided. This really challenges you to implement the ideas taught in the most efficient and appropriate manner possible.
Excellent video lectures. Great forums that discuss the problems and programming assignments. Challenging material, with satisfying rewards on finding solutions.
Über den Spezialisierung Algorithmen
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

Häufig gestellte Fragen
Wann erhalte ich Zugang zu den Vorträgen und Aufgaben?
Was bekomme ich, wenn ich diese Spezialisierung abonniere?
Ist finanzielle Unterstützung möglich?
Haben Sie weitere Fragen? Besuchen Sie das Learner Help Center.