Mathematical modeling of computational problems; searching and sorting algorithms; search trees, heaps, and hash tables; divide-and-conquer, dynamic programming, and greedy choice design techniques; graph algorithms; NP-completeness; and selected topics.
Prereq: CIS 375 and CIS 351
Department: Computer and Information Science
Location: London
Semester: Fall
Credits: 3