DISCRETE MATHEMATICS FOR ENGINEERS

Catalog description

Three hours of lecture per week. This is an introductory course in discrete mathematics. It covers fundamentals of logic, proofs, set theory, number theory, finite state machines, computational complexity, recurrence relations, discrete probability, and graph theory with an emphasis on engineering applications. This course will help students to develop critical thinking and quantitative reasoning skills to understand the logical underpinnings and complexity of modern computer science with respect to real life situations.