github twitter email rss
Course: Design and Analysis of Algorithms by Tim Roughgarden @ Coursera
0001 Jun 1
One minute read

Course: Design and Analysis of Algorithms by Tim Roughgarden @ Coursera

  • Routing and communication networks piggybacks on classical shortest path algorithms public key
    cryptography relies on that of number-theoretic algorithms.
  • Computer graphics needs the computational primitives supplied by geometric algorithms.
  • Database indices rely on balanced search tree data structures.
  • Computational biology uses dynamic programming algorithms to measure genome similarity.


Input
Output

the design analysis of greedy
algorithms with applications to minimum
spanning trees, scheduling, and
information theoretic coding. And
secondly, the design analysis of dynamic
programming algorithms with example
applications being in genome sequence
alignment and the shortest path protocols
in communication networks

Math

  • proofs by induction and proofs by contradiction.
  • the standard quantifier and summation symbols
  • discrete probability
  • calculus
  • Mathematics for Computer Science


Merge Sort

Divide & Conquer


Back to posts


comments powered by Disqus