CS 208/MA 208: Discrete Math
Course Description:
This course introduces the student to selected finite systems pertinent to the study of
computer science. Course topics will include combinatorial problem solving, logic, Boolean algebra,
combinatorial circuits, sets, relations, functions, proofs, mathematical induction, recurrence
relations, graphs, trees, and counting techniques. 3:0:3
Prerequisite: MA 131 or higher-level
Learning Outcomes:
Upon completion of this course, the student should be able to:
- Solve problems involving:
- set operations
- equivalence and partial ordering relations
- mathematical induction
- Analyze graphs, paths, circuits, graph coloring, direct graphs.
- Apply shortest path algorithms to graphs.
- Explain tree properties, spanning trees, rooted trees, binary trees.
- Apply tree search and tree traversal algorithms to trees.
- Use counting techniques.
- Solve problems involving permutations, combinations, and probability.
- Solve problems involving recurrence relations and generating functions.
Assessment Measures:
| Assessment Tool |
Linkage to Learning Outcome #: |
| |
|
| Homework Assignments: |
|
| Assign a sufficient amount of homework such that all of the
above objectives are covered. |
all |
| For each homework assignment, include short answer
questions that require the student to apply the above objectives. |
all |
| For certain homework assignments, the student will be
asked to solve a problem(s) by using appropriate math calculations. |
1, 7 |
| For certain homework assignments, the student will be
asked to analyze or trace a discrete mathematics algorithm. |
3, 5 |
| For certain homework assignments, the student will be
asked to solve a problem(s) by applying an appropriate discrete mathematics algorithm. |
3, 5 |
| For certain homework assignments, the student will be
asked to provide a proof for a given statement. |
1, 8 |
| |
|
| Exams: |
|
Include one or more of:
short answer, multiple choice, algorithm trace. |
all |
| Given a problem description, solve the problem using an
appropriate math calculation. |
1, 7 |
| Analyze or trace a discrete mathematics algorithm. |
3, 5 |
| Given a problem description, solve the problem by
applying an appropriate discrete mathematics algorithm. |
3, 5 |
| Given a statement, prove that the statement is true. |
1, 8 |
Textbooks
To view the approved textbook list, click
here.
