|
|
Nov 30, 2024
|
|
CSDP 601 Analysis and design of algorithms Credit 3 Topics include (not limited to); NP completeness and approximation algorithms, design techniques for efficient algorithms such as amortized analysis, dynamic programming and greedy algorithms. Computational geometry, graph algorithms, primality and other number-theoretic algorithms, specialized data structure techniques such as augmenting data structures, combinational graph reduction and functional repetition
Add to Portfolio (opens a new window)
|
|
|