Skip to main content

Discrete Mathematics

Instructor:
Dakshnamoorthy Manivannan
Afsaneh Mahanipour
Nathan Robert Arnold
275
Credits:
4.0
001
Building:
Whitehall Classroom Bldg
F Paul Anderson Tower
Room:
Rm.102
Rm.255
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
2:00 pm
9:00 am
3:15 pm
9:50 am
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