CSCI 5620

Covers basic techniques for analyzing algorithmic complexity. It describes the design and analysis of selected algorithms for solving important problems that arise often in applications of computer science, including sorting, selection, graph theory problems (e.g., shortest path, graph traversals), string matching, dynamic programming problems, NP-complete problems. When Offered: Fall, alternate years.

None

No syllabi uploaded yet.