CS 2103 Algorithm Design & Analysis

The theory of programming, reinforced with practical activities. Students will: analyze algorithms for asymptotic required memory and time; implement stacks, queues, dictionaries, priority queues using arrays and linked lists; apply recursion, backtracking, and dynamic programming; use classic strategies like greedy search and branch-and-bound; use trees and graphs to solve problems; explain theory of computation (automata and Turing machines); explain complexity classes like P and NP. Prerequisite: CS 1123

Credits

3

Lab Hours

0

Lecture Hours

3

Prerequisite

CS 1123