CSC (0145) 344 - Algorithms and Complexity

Credits: 3

Learn to analyze iterative and recursive algorithms for use of resources (time, memory, parallelism, bandwidth, randomness, etc.). Develop fluency with big-O notation, and learn to choose and implement efficient algorithms for numeric, combinatorial, and geometric problems. Learn basic concepts and terminology in computability and computational complexity.

When Offered: Spring

Prerequisite 1: CSC 156 Prerequisite 2: MTH 141 Prerequisite 3: CSC 171
Free Note: Grade of C- or better in MTH 131 or MTH 141, CSC 156 and CSC 171