Discrete Structures and Applications to Computer Science
Download as PDF
Overview
Subject area
CSC
Catalog Number
231
Course Title
Discrete Structures and Applications to Computer Science
Department(s)
Description
This course covers the computer science applications of fundamental mathematical structures. Topics include logic, set theory, function, relations, algorithm, recursion, recurrence relations, principle of counting, graph theory, trees, and Boolean algebra. Students will be expected to complete projects for each topic involving formal proof techniques, mathematical reasoning and/or programming.
Typically Offered
Fall, Spring, Summer
Academic Career
Undergraduate
Liberal Arts
No
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4
Requisites
028887