CSCI 2511 - Discrete Structures

Covers the fundamentals of discrete mathematics, including: logic, sets, functions, asymptotics, mathematical reasoning, induction, combinatorics, discrete probability, relations and graphs. Emphasis on how discrete mathematics applies to computer science in general and algorithm analysis in particular. Prereq: MATH 1401 with a C- or higher (Calculus I). Max hours: 3 Credits. Semester Hours: 3 to 3