Description
Study of algorithms, data structures, and complexity analysis beyond the introductory treatment from CS 2420. Balanced trees, heaps, hash tables, string matching, graph algorithms, external sorting and searching. Dynamic programming, exhaustive search. Space and time complexity, derivation and solution of recurrence relations, complexity hierarchies, reducibility, NP completeness. Laboratory practice.
Minimum Credits
3
Maximum Credits
3
Repeat for Credit
No
Required Requisite(s):
Prerequisites: 'C-' or better in (CS 2100 OR MATH 2200) AND CS 3500 AND Foundational Courses complete ((‘C-‘ or better in (CS1400 AND CS1410) OR CS1420) AND (‘B-‘ or better in CS2420) AND (‘C’ or better in MATH1210)) AND Major or Minor in KSoC or ECE
Course Designation/Attribute
BD - QI (Quantitative Intensive BS)
Semesters Typically Offered
Fall and Spring