Catalog Entries |
Fall 2022
May 03, 2024 |
|
 |
||
 | The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes. Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
| CS 2051 - Honors Discrete Math CS |
|
Proof methods, strategy, correctness of algorithms over discrete structures. Induction and recursion. Complexity and order of growth. Number theoretic principles and algorithms. Counting and computability. Credit not allowed for both CS 2051 and CS 2050.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP Dept/Computer Science Department Course Attributes: STEM USG |
|