Skip to main content

CS 512: Algorithms and Data Structures

This course is a graduate level look at algorithms and data structures, general topics necessary in computer science. This is largely archival as I’ve only taught this course once, but some of the notes may be useful or informative.

  • Divisibility and Modular Arithmetic ( Problems – Coming Soon )
  • Notes on Computing Modular Inverses ( Coming Soon )
  • Notes on Euclid’s Algorithm and Diophantine Equations ( Coming Soon )
  • Notes on Graph Search Algorithms ( Coming Soon )
  • Analyzing Structured Graphs ( Problems – Coming Soon )
  • Notes on Vertex Ordering for Graph Traversals ( Coming Soon )
  • Huffman Encoding and the Cost of Information ( Problems – Coming Soon )
  • Randomized Algorithms and Independent Sets ( Problems – Coming Soon )
  • Notes on Linear Programs and Duality ( Coming Soon )
  • Set Covers ( Problems – Coming Soon )
  • Review Notes for Midterm ( Coming Soon )
  • Review Notes for Final ( Coming Soon )