July 31, 2010, Saturday, 211

CS 2102

From Rodman Scholars Program

Jump to: navigation, search
Discrete Math I
Credits: 3
Semesters Offered: Both
Cross-Listed As: None
Prerequisites: CS 1110 or CS 1120
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

Computer Science Courses
CS 1010 - CS 1110 - CS 1111 - CS 1112 - CS 1120 - CS 2102 - CS 2110 - CS 2150 - CS 2190 - CS 2220 - CS 2330 - CS 3102 - CS 3205 - CS 3240 - CS 3330 - CS 4102 - CS 4240 - CS 4330 - CS 4414 - CS 4444 - CS 4457 - CS 4458 - CS 4610 - CS 4620 - CS 4630 - CS 4710 - CS 4750 - CS 4753 - CS 4810
Retrieved from "http://www.rodmanscholars.org/index.php/CS_2102"