Generated on Tue Oct 25 10:19:18 2022

CS 278: Discrete Mathematics for Computer Science (JSON)

Catalog description: Discrete mathematics required for Computer Science, including the basics of logic, elementary number theory and methods of proof, sequences, mathematical induction, set theory, functions, and counting.

Prerequisites: At least C- in C S 172    (Catalog Link)

Credits: 4 (3+2P)

Coordinator: Inna Pivkina

Textbook: ZyBooks: Discrete Mathematics
    (also: )

BS degree role: required

Course Learning Objectives

  1. use logic to specify precise meaning of statements, demonstrate the equivalence of statements, and test the validity of arguments
  2. construct and recognize valid proofs using different techniques including the principle of mathematical induction
  3. use summations, formulas for the sum of arithmetic and geometric sequences
  4. explain and apply the concepts of sets and functions
  5. apply counting principles to determine the number of various combinatorial configurations

Course Practicum Requirements

  1. Use a programming language to implement some discrete math concepts

Course Topics

  1. Logic
  2. Elementary number theory and methods of proof
  3. Sets
  4. Functions
  5. Sequences, summations, and mathematical induction
  6. Counting (combinatorics)

Course Improvement Decisions

(Course improvement decisions or recommendations from past assessments)

  1. SP15: separate labs on recurrence and probability; introduce programming
  2. SP20: If I were to teach this course again, I would begin the semester with functions, tying in to their experience from algebra courses, then cover sets. I would place the chapter on logic later in the semester.

ABET Outcome Coverage

(Provide Mapping to ABET Student Outcomes)

  1. TBD

Other Notes

(Any important notes or issues to consider)

  1. none