May be repeated for credit when topics vary. Alternate subtitles will appear on student's transcript.
This section is for Undergraduate students only.
Major software development project requiring integration and application of knowledge and skills acquired in algorithms, data structures, programming, and software design.
Basic techniques used in design and analysis of algorithms, including divide-and-conquer, greed methods, dynamic programming, search techniques, backtracking, brand-and-bound, and algebraic transformation. NP-Complete and NP-Hard problems, reductions among and approximations to such problems. Basis concepts surrounding the halting problem.
Write a concise and interesting paragraph here that explains what this course is about
Write a concise and interesting paragraph here that explains what this course is about