MATH2510: Discrete Math for Computer Science
Credit Hours: 3.0
Terms Offered: Spring
An introduction to mathematical foundations of computer science, including propisitional and predicate calculus, methods of proof, sets and relations, recurrences, graphs and trees, and program correctness and proofs
The student will be able to:
1: Relate practical examples to the appropriate set, function, relation model or graph model; and know the associated operations and terminology in context.
2: Manipulate abstract structures such as sets, graphs, trees, relations, and functions.
3: Demonstrate mathematical reasoning, including formal logic, inductive proofs, relative time and memory efficiency of algorithms, and formal correctness of algorithms.
4: Create relevant recurrence equations for specific counting and algorithm applications.
5: Model problems in computer science using discrete mathematical concepts of logic, sets, functions, relations, recurrence, counting, graphs, and trees.