Discrete Structures in Computing

Catalog description

Three hours lecture per week This course provides a foundational understanding of discrete structures and their applications in computer science and related disciplines. Students will explore topics such as logic, sets, relations, functions, combinatorics, graph theory, number theory, and discrete probability as applied in the computing fields. Emphasis is placed on developing formal reasoning skills and applying mathematical techniques to problems in algorithms, data structures, databases, cryptography, networking, and software engineering. Students will practice critical thinking by constructing, analyzing, and evaluating logical arguments and proofs, and by examining the broader impacts of discrete structures on computing practices (e.g. intellectual property, data privacy, and algorithmic bias). Through written assignments and structured problem explanations, students will strengthen their ability to compose clear, logical, and well-reasoned arguments, demonstrating how discrete structures supports computational problem solving and ethical decision-making.