MAT1348
Discrete Mathematics for Computing
Introduction to discrete structures as a foundation to computing. Propositional logic. Fundamental structures: functions, relations, sets. The basics of counting: counting arguments, the pigeonhole principle, permutations and combinations. Introduction to proofs: direct, by contradiction, by cases, induction. Topics in graph theory: isomorphism, cycles, trees, directed graphs.
Available Tutors
Emily is passionate about applying engineering principles to healthcare challenges. She excels at explaining complex scientific concepts and enjoys working through design problems collaboratively. Her sessions focus on practical application and critical thinking.
Earliest availability: 2026/02/11 13:00HMichael is proficient in structural analysis and design. He prefers to explain concepts through practical problems and encourages students to develop their own analytical skills. His sessions are geared towards hands-on learning.
Earliest availability: 2026/02/10 13:00HKevin finds joy in demystifying economic theories and models. He employs real-world news and policy examples to make abstract concepts concrete. His sessions encourage critical analysis and application of economic principles.
Earliest availability: 2026/02/10 11:00HEthan is adept at simplifying complex mathematical concepts and building strong foundational understanding. He emphasizes problem-solving strategies and encourages a deep comprehension of theory. His sessions are analytical and methodical.
Earliest availability: 2026/02/10 14:00H




