Description
This course will continue from BCIS 3301 and apply concept of algorithms design. This includes greedy, divide-and-conquer, random and backtracking algorithms and dynamic programming, and specific algorithms including, for example, resizing arrays, balancing search trees, shortest path, and spanning trees.
Prerequisite(s): BCIS 2305 Computer Programming II (Lab) or Transfer credits