Discrete Mathematics

Catalog description

This course is a non-calculus-based course designed for students interested in computer science. No previous experience is required. The course will provide the mathematical foundations necessary for other computer science courses. Topics covered include introduction to formal logic, techniques of proofs, recursion and recurrence relations, elementary analysis of algorithms, counting principles, relations and functions, graphs and trees, and graph algorithms.