Discrete Mathematical Structures in Computer Science

This course serves as an introduction to the essential mathematical tools used in computer science. The curriculum includes a study of sets, relations, and basic counting techniques. Students will delve into algebra and algorithms, explore graphs, and learn about monoids and machines. The course also covers lattices and Boolean algebras, groups and combinatorics, and provides an introduction to logic and languages.

Grade Basis: L
Credit hours: 3.0
Lecture hours: 3.0