Discrete Mathematics

MET CS 248

Fundamentals of logic (the laws of logic, rules of inferences, quantifiers, proofs of theorems), Fundamental principles of counting (permutations, combinations), set theory, relations and functions, graphs, trees and sorting, shortest path and minimal spanning trees algorithms. Monoids and Groups.

FALL 2013 Schedule

Section Instructor Location Schedule Notes
A1 Naidjate SMG 306 M 6:00 pm-9:00 pm

SPRG 2014 Schedule

Section Instructor Location Schedule Notes
D1 Naidjate SMG 302 R 6:00 pm-9:00 pm

Note: this course was also offered during Summer Term

Note that this information may change at any time. Please visit the Student Link for the most up-to-date course information.