Credits: (3)Techniques of algorithm design including greedy, divide and conquer, dynamic programming, backtracking and branch-and-bound. Covers algorithmic solutions to problems from a variety of application areas including games, graphs and encryption. Emphasis is on programming assignments that enable students to develop their problem solving and algorithm design skills.
Requisites Prerequisite: CMST 370 and level 2 programming language elective.
