CS 131 - Discrete Structures for Computer Science
- Recent Professors
- Not yet assigned
- Recent Semesters
- No scheduled sections on record
- Class Size
- Not published
- Difficulty
- 6.6Demandingout of 10
- Credits
- 3
- Prerequisite
- Computer Science 116 or Computer Science 113.
- Transfers To
- CSU
- Description
- This course is an introduction to the discrete structures used in Computer Science with an emphasis on their applications. Topics covered include: Functions, Relations and Sets, Basic Logic, Proof Techniques, Basics of Counting, Graphs and Trees, and Discrete Probability.