Select the desired Level or Schedule Type to find available classes for the course. |
CMPS 2433 - Discrete Structures & Analysis |
Prerequisites: Minimum grade of C in CMPS 1063 and MATH 1233 or 1534. Introduction to the fundamental techniques of algorithm analysis. Also, Boolean logic, combinatorics, functions, graphs, algebraic structures, recursion, recurrence relations, finite state machines, and computability. 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: COSME Instructnal Enhance Fee Prerequisites: PREQ for CMPS 2433: General Requirements: ( Course or Test: CMPS 1063 Minimum Grade of C May not be taken concurrently. ) or ( Course or Test: CMPS 1053 Minimum Grade of C May not be taken concurrently. ) and ( Course or Test: MATH 1233 Minimum Grade of D May not be taken concurrently. ) or ( Course or Test: MATH 1534 Minimum Grade of D May not be taken concurrently. ) or ( Course or Test: MATH 1533 Minimum Grade of D May not be taken concurrently. ) or ( Course or Test: MATH 1634 Minimum Grade of D May not be taken concurrently. ) |
Return to Previous | New Search |