Select the desired Level or Schedule Type to find available classes for the course. |
CS 303 - Algorithms/ Data Structures |
Techniques for design and analysis of algorithms; efficient algorithms for sorting, searching, graphs, and string matching; and design techniques such as divide-and-conquer, recursive backtracking, dynamic programming, and greedy algorithms.
4.000 Credit hours Levels: Undergraduate Schedule Types: Lecture/Lab Computer and Information Sci Department Course Attributes: CAS Lab Fee Tier 3, NOT ACTIVATED - USE C3LF, SW Computer Science/Tech, Tuition Arts and Sciences Restrictions: May not be enrolled in one of the following Levels: Undergraduate Certificate Non-credit Corequisites: CS 303L Prerequisites: Undergraduate level CS 250 Minimum Grade of C and Undergraduate level CS 302 Minimum Grade of C |
Return to Previous | New Search |