CSIT 143 Discrete Mathematics

This course provides an introduction to fundamental concepts in discrete mathematics, essential for computer science and related fields. Topics include number systems, basic number theory, and modular arithmetic, followed by an exploration of sets, relations, and functions. Students will study sequences, series, and partial sums, as well as key proof techniques such as induction and contradiction. The course also covers recurrence relations, counting principles, and basic combinatorics, culminating in an introduction to graph theory. Through theoretical discussions and problem-solving exercises, students will develop a strong foundation in discrete structures and mathematical reasoning.

Credits

3

Offered

Every year