MATH 2511 - Discrete Structures

Covers the fundamentals of discrete mathematics, including: logic, sets, functions, growth of functions, algorithms, matrices, mathematical reasoning, proofs, induction, relations, graphs, trees and combinatorics. There is an emphasis on how discrete mathematics applies to computer science in general, and algorithm analysis in particular. Prereq: CSCI 2421. Cross-listed with CSCI 2511. Semester Hours: 3 to 3