Park.edu Home > Skip Navigation LinksICS Home > Majors and Courses > Courses >

CS 208 : Discrete Mathematics

Course Description

CS208 Discrete Mathematics: 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. Prerequisite: A grade of C or better in any math course >= MA125, or an ACT math score >= 23, or an SAT math score >= 510, or a COMPASS score >= 66 in the Algebra placement domain, or a COMPASS score 0-45 in the College Algebra placement domain. 3:0:3

Learning Outcomes

  1. Explain and solve problems involving logics, Boolean algebra, combinatorial circuits, sets, relations, and functions, proofs, mathematical induction, and recurrence relations.
  2. Explain and solve problems involving graphs, paths, circuits, graph coloring, directed graphs, shortest path algorithms
  3. Explain and solve problems involving trees, spanning trees, rooted trees, binary trees, and tree traversal algorithms.
  4. Explain and solve problems involving counting techniques such as permutations, combinations, binomial theorem, and probability.

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

View the approved textbook list.

^ Back to the Top

---------------------------------

University Resources


This page was last modified on Monday, September 12, 2011