CSC 226
Discrete Mathematics for Computer Scientists
Section: 003

Course Description

Emphasis on counting (combinatorics), formal proofs, and applications of discrete mathematics. Topics will include (but are not limited to): permutations, combinations, probability, propositional logic, predicate calculus, proof approaches, induction, modular arithmetic, recurrence relations, asymptotic growth of functions, and introduction to graph theory. This course assumes knowledge of topics covered in high-school Algebra I and II.

Spring 2024

Instructors

Meeting Patterns

Classes Start:
January 8, 2024
Classes End:
April 23, 2024
Location:
01021 Engineering Building 2
Class Days:
T H
Class Start Time:
11:45am
Class End Time:
1:00pm

Class Type:
Lecture
Credits:
3.00
Restrictions:
Restricted to the following plans (majors): 14CSCBS, 14CSU,14EEBS, 14EEU,14CPEBS, 14CPEU (Computer Science, Computer Engineering, Electrical Engineering), 14CPM, 13MTHEDBS

Tools