Computer Information Science American River College
Courses

CISP 440: Discrete Structures for Computer Science

Units: 3.00
Prerequisite: CISP 360 (Introduction to Structured Programming) and MATH 370 (Pre-Calculus Mathematics) with grades of "C" or better
Corequisite: CISP 430 (Data Structures)
Hours: 54 hours lecture
Description: This course is an introduction to the discrete structures used in computer science with an emphasis on their applications. Topics include functions, relations, and sets; basic logic; proof techniques; basics of counting; graphs and trees; and discrete probability.

Section 3: Learning Outcomes and Objectives

Upon completion of this course, the student will be able to:

  • analyze how formal tools of symbolic logic are used to model real-life situations, including those arising in computing contexts such as program correctness, database queries, and algorithms.
  • compare the ideas of mathematical induction to recursion and recursively defined structures.
  • analyze a problem to create relevant recurrence equations.
  • design different traversal methods for trees and graphs.
  • choose between the binomial theorem for independent events and Bayes’ theorem for dependent events.