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:

1. Solve problems involving:
   • set operations
   • equivalence and partial ordering relations
   • mathematical induction
2. Analyze graphs, paths, circuits, graph coloring, direct graphs.
3. Apply shortest path algorithms to graphs.
4. Explain tree properties, spanning trees, rooted trees, binary trees.
5. Apply tree search and tree traversal algorithms to trees.
6. Use counting techniques.
7. Solve problems involving permutations, combinations, and probability.
8. Solve problems involving recurrence relations and generating functions.

Teaching Directives:	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 problem-solving 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 applying an appropriate discrete mathematics algorithm.	All
For certain homework assignments, the student will be asked to prove or disprove a given statement.	All
Exams:
Include one or more of: short answer, multiple choice, multiple answer, true false, calculation.	All
Given a problem description, solve the problem using an appropriate math calculation.	All
Given a problem description, solve the problem by applying an appropriate discrete mathematics algorithm.	All
Given a statement, prove or disprove the statement.	All

Textbooks

To view the approved textbook list, click here.