MAT 1348 Discrete Mathematics for Computing
3 crédits
Mathematiques
Faculte des sciences
Introduction to discrete structures as a foundation to computing. Propositional logic. Fundamental structures: functions, relations, sets. The basics of counting: counting arguments, the pigeonhole principle, permutations and combinations. Introduction to proofs: direct, by contradiction, by cases, induction. Topics in graph theory: isomorphism, cycles, trees, directed graphs. Whenever possible applications from computing and information technology will be included.
Volet:
Groupe de discussion
Cours magistral
Exigences:
Terme proposées précédemment:
Hiver
Été
Équivalent Français:
Tous Les Professeurs
Moyenne B (5.681)
Le plus fréquent: A+ (18%)
3018 étudiants
F
D
C
B
A-
A+