Instructor:
Minoo Hosseinzadeh
Minoo Hosseinzadeh
275
Credits:
4.0
401
Building:
F Paul Anderson Tower
F Paul Anderson Tower
Room:
Rm.257
Rm.263
Semester:
Fall 2023
Start Date:
End Date:
Name:
Discrete Mathematics
Requisites:
Prereq: MA 113 and either EGR 102 or CS 115.
Class Type:
LEC
LAB
6:00 pm
6:00 pm
7:15 pm
6:50 pm
Days:
TR
W
Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions. Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees.
Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions. Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees.
CS