CIS 226 — Computer Science III (4) (4,0)
This course concentrates on algorithms, algorithm analysis, and advanced data structures. Algorithm approaches such as divide-and-conquer, dynamic, greedy, and back-tracking are considered. Complexity analysis is used to compare algorithm efficiency. Students will learn further use of object-oriented programming to implement ADTs such as graphs, sets, heaps, and hash tables. (1.1) Proficiency Credit Not Available Pass/No Credit Available.