CSC 440 - Design & Analysis of Algorithm

Description
Prerequisite: CSC 236 AND one of the following: MAT 105 or MAT 125 or higher-numbered MAT course A study of algorithmic approaches to problem-solving, and techniques for designing, analyzing, and comparing algorithms. Approaches such as divide-and-conquer, dynamic programming, and backtracking will be studied. Topics in computational complexity include asymptotic complexity measures, intractability, and NP-complete problems.
Credits
1
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Spring 2019
Offered
TuTh
Avg. Class Size
12
Avg. Sections
1