Fundamental paradigms of algorithm and data structure design. Divide-and-conquer, dynamic programming, greedy method, graph algorithms, amortization, priority queues and variants, search structures, disjoint-set structures. Theoretical underpinnings. Examples from various problem domains.prereq: CSCI 4041 or Grad Standing
Gopher Grades is maintained by Social Coding with data from Summer 2017 to Spring 2025 provided by the University in response to a public records request