January 7, 2009, Wednesday, 6

CS 202

From Rodman Scholars Program

Jump to: navigation, search
Discrete Math I
Credits: 3
Semesters Offered: Both
Cross-Listed As: APMA 202
Prerequisites: CS 101 or CS 150
Corequisites: None

This teaches the mathematical basis for computer science.

[edit] Description

From the Undergraduate Record:

Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include sets (finite and infinite), elementary combinatorial problems, and finite state automata. Development of tools and mechanisms for reasoning about discrete problems.


[edit] See Also

[edit] External Links

Applied Mathematics Courses
APMA 109 - APMA 111 - APMA 202 - APMA 212 - APMA 213 - APMA 302 - APMA 308 - APMA 310 - APMA 311 - APMA 312 - APMA 314 - APMA 334 - APMA 507



Computer Science Courses
CS 101 - CS 101E - CS 101X - CS 110 - CS 150 - CS 201 - CS 202 - CS 205 - CS 209 - CS 216 - CS 230 - CS 290 - CS 302 - CS 305 - CS 333 - CS 340 - CS 414 - CS 415 - CS 416 - CS 425 - CS 432 - CS 433 - CS 441 - CS 444 - CS 445 - CS 453 - CS 457 - CS 458 - CS 462 - CS 471
Retrieved from "http://rodmanscholars.org/index.php/CS_202"