CSC 226
Discrete Mathematics for Computer Scientists
Section: 051

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.

SUM1 10W 2020

Instructors

Classes Start:
May 13, 2020
Classes End:
July 24, 2020
Location:
Online Delivery
Class Days:
TWH
Class Start Time:
5:30pm
Class End Time:
6:45pm
Class Type:
Lecture
Credits:
3.00
Delivery Method:
Internet Interactive
Restrictions:
Restricted to the following plans (majors): 14CSCBS, 14CSU,14EEBS, 14EEU,14CPEBS, 14CPEU (Computer Science, Computer Engineering, Electrical Engineering), 14CPM, 13MTHEDBS

Tools