Saint Louis University Menu Search

MATH 1660
Discrete Mathematics

Course Description

Concepts of discrete mathematics used in computer science; sets, sequences, strings, symbolic logic, proofs, mathematical induction, sums and products, number systems, algorithms, complexity, graph theory, finite state machines.


A grade of C- or better in MATH 1200 or equivalent.


Show all
Fall 2020Ashish K. SrivastavaOnline
Fall 2020Benjamin HutzMWF 12:00pm-12:50pm
Spring 2020Ashish K. SrivastavaMWF 8:00am-8:50am
Spring 2020Salman ParsaMWF 1:10pm-2:00pm
Fall 2019Ashish K. SrivastavaMWF 8:00am-8:50am
Fall 2019Benjamin HutzMWF 12:00pm-12:50pm
Spring 2019Ashish K. SrivastavaMWF 8:00am-8:50am
Spring 2019Charles BurnetteMWF 1:10pm-2:00pm
Fall 2018Benjamin HutzMWF 12:00pm-12:50pm
Fall 2018Ashish K. SrivastavaMWF 8:00am-8:50am
Spring 2018James HebdaMWF 8:00am-8:50am
Spring 2018Benjamin HutzMWF 1:10pm-2:00pm
Fall 2017Benjamin HutzMWF 12:00pm-12:50pm
Fall 2017Greg MarksMWF 3:10pm-4:00pm