Queen's University CISC 102: Discrete Mathematics for Computing I​​

Course Weight: Half-Year · 3.0 Units 

Course Overview

If you're majoring in Computer Science, CISC 102 is a core requirement that builds the logical foundation essential for advanced topics like algorithms and data structures. While it’s often considered a “bird course” by those comfortable with math, be warned: it’s a math course in CS clothing—focused entirely on abstract reasoning and proof-writing.

​​What You’ll Learn​​

1. Sets, functions, sequences, and mathematical relations

2. Propositional logic and proof techniques (including induction)

3. Basic number theory and combinatorics

4. Graph theory fundamentals

   
   

​​Grading Breakdown​​

1. Four Term Quizzes (spaced through the semester) 18% Each

2. One Final Project (research-based, submitted in LaTeX via Overleaf) 18%

3. Weekly Check-Ins (low-stakes participation, with lowest grades dropped) 10%

   
   

​​Key Things to Know​​

1. ​​No exams, but consistent effort required​​: The three quizzes replace a midterm/final, but you can’t cram—each builds on the last.

2. ​​LaTeX is mandatory​​: The final project must be typeset in Overleaf. Start practicing early if you’re new to it.

3. ​​Bonus opportunities​​: You can earn back partial credit on quizzes by submitting error analyses—a great grade booster!

​​Who Should Take It?​​

Great for students who enjoy puzzles, formal logic, or abstract math. If proofs don’t come naturally, be prepared to spend extra time in office hours or study groups. A solid grasp of CISC 102 will pay off hugely in upper-year CS courses.