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).
Breadth-first and depth-first search; computing strong components; applications.
Dijkstra's shortest-path algorithm.
Heaps; balanced binary search trees.
Hashing; bloom filters.
Some points apply to every course of this kind; see how we rank.
Stanford University is in Tier 1: world-leading universities and India's top institutes of our institution ranking (97/100).
Instructor(s): Tom Leighton, Marten van Dijk This course covers elementary discrete mathematics. Mathematical definitions and proofs are emphasized. Topics include formal logic, induction, graph theory, asymptotic notation and growth of functions, counting principles, and discrete probability.
Harvard University · edX
Contracts are a part of our everyday life, arising in collaboration, trust, promise and credit. How are contracts formed? What makes a contract enforceable? What happens when one party breaks a promise?
Our economic institutions, organizations, and skills have not kept up with rapid advances in AI. In this growing gap lie many of society’s greatest challenges and opportunities. This course will explore how AI can and will transform our economy and society in the coming years. Each week, we will le…
Harvard University · edX
This introduction to moral and political philosophy is one of the most popular courses taught at Harvard College.
Harvard University · edX
Learn about successful collaborations between families and educators and why they lead to improved outcomes for students and schools.
Harvard University · edX
Learn how to protect children from violence, exploitation, and neglect through law, policy, and practice in a human rights framework.
