College of Engineering and Computer Science 3 credit(s) At least 1x fall or springMathematical 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