|
CS/SE
Course Assessment |
 |
| |
Search: |
|
 |
| |
|
|
Course
Numbers |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
CS 4336 |
| |
| |
| |
| |
| |
| |
CS 4386 |
| |
| |
| |
| |
| |
| |
|
Class learning objectives
CS 2305 (MATH 2305) Discrete Mathematics for Computing
I
Ability to understand mathematical facts in order to read,
comprehend and construct mathematical arguments
Ability to use and apply basic definitons and properties
of sets and logic
Ability to specify precise meaning of mathematical statements,
using quantifiers and predicates as needed
Ability to recognize and construct valid proofs
Ability to understand and use various types of functions
Ability to understand and construct a proof by induction
Ability to use modular arithmetic as it relates to computer
science problems such as hashing and encryption
Ability to recognize and use Boolean algebra applied sets
and logic
Ability to understand what an algorithm is and to use algorithms
Ability to use basic counting techniques such as permutations,
combinations
Ability to write recursive definitions and functions
|
|
|
|
|
|