Skip to main content

Discrete Mathematics

Instructor:
Miroslaw Truszczynski
Afsaneh Mahanipour
275
Credits:
4.0
001
Building:
Whitehall Classroom Bldg
Robotics & Manufacturing Building
Room:
Rm.110
Rm.323
Semester:
Spring 2023
Start Date:
End Date:
Name:
Discrete Mathematics
Requisites:

Prereq: MA 113 and either EGR 102 or CS 115.

Class Type:
LEC
LAB
11:00 am
1:00 pm
12:15 pm
1: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