Skip main navigation

CSIS26:  DISCRETE STRUCTURES


Course Description

Topics covered include set theory, logic, relations and functions, mathematical induction and recursion, combinatorics, discrete probability, trees and graphs, analysis of algorithms, algebraic structures. Emphasis on topics of interest to computer science majors. This course has the option of a letter grade or pass/no pass. (C-ID: COMP 152) PREREQUISITE: CSIS 5 or CSIS 45 or CSIS 46 with a grade of 'C' or better.


Learning Outcomes

  • Student uses logically valid forms of argument and avoids common logical errors
  • Student can provide examples of recurrence relations that give rise to formulas that are verified by induction.
  • Student can describe different traversals of trees and graphs.
  • Student can apply the binomial theorem and Bayes’ theorem as appropriate.


Last modified: November 25, 2014
Gavilan College Red Diamond 5055 Santa Teresa Boulevard Red Diamond Gilroy, CA 95020 Red Diamond (408) 848-4800