Discrete Math for Data Science

DSCI 220, 2025 W1

September 3, 2025

🎭 Sages & Tricksters


How to Play

  • Each of you are secretly assigned a role:
    • Sage = always tell the truth (Black)
    • Trickster = always lie (Red)
  • Everyone sees the packet of 6 cards and the fact.
  • In rounds, each player may ask yes/no questions about the fact.
  • Work together: compare answers, spot contradictions.
  • Goal: Deduce each person’s role!

πŸ”„ Round Structure


1. Two Info Rounds

  • In each round, take turns asking one yes/no question about the fact

2. Debate Round

  • Compare answers
  • Look for contradictions

3. Conclusion

  • Agree on everyone’s roles
  • Reveal the cards & roles!

🧩 Logic in Action


  • Logic means starting from true facts
  • Asking the right questions
  • Spotting contradictions
  • And making valid inferences

In this course we’ll apply all of this to Data Science!

Syllabus Overview

Instructional Team:

  • Prof: Cinda Heeren
    πŸ“§ cheeren@cs.ubc.ca
    ⏰ Mon 2–4pm Β· 🏒 ICCS 233 Β· Zoom

  • TA: Joe Wonsil
    πŸ“§ jwonsil@cs.ubc.ca
    ⏰ Fri 11-12a · 🏒 FORW 317

Term Structure:

Week Sunday M T W F Tutorial Examlet
1 8/31/2025      πŸŽ‰ πŸŽ‰
2 9/7/2025 πŸŽ‰ πŸŽ‰ πŸŽ‰
3 9/14/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„ 🀩
4 9/21/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„
5 9/28/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„ 🀩
6 10/5/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„
7 10/12/2025      πŸ“Ί πŸ“Ί
8 10/19/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„ 🀩
9 10/26/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„
10 11/2/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„ 🀩
11 11/9/2025           πŸ“Ί
12 11/16/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„
13 11/23/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„ 🀩
14 11/30/2025 πŸŽ‰ πŸ“Ί πŸŽ‰      πŸͺ„

Grading:

Component Weight
πŸŽ‰ Class Meetings 0%
πŸͺ„ Tutorials 15%
🀩 Examlets 55%
🀩 Final Exam 30%

Communications

Name Time Location & Zoom
Cinda Mon 2–4pm 🏒 ICCS 233 Β· Zoom
Joe Fri 11-12a 🏒 FORW 317

Logic

Truth

Make at least 3 observations about the following table:

\(p\) \(q\) \(p \lor q\)
F F F
F T T
T F T
T T T



Summary

Key observations about the table:

\(p\) \(q\) \(p \lor q\)
F F F
F T T
T F T
T T T
  • The diagram is called a Truth Table
  • p and q are variables, each of which take on one of two Boolean values, True or False (T/F, 1/0)
  • ∨ is a binary operator that implements a function (creates output) from the 2 input variables to another Boolean value. It is characterized by its output values.
  • The operator ∨ corresponds to the English word or.
  • The expression p ∨ q is called a proposition.

Cool down

\(p\) \(q\) \(p \lor q\)
F F F
F T T
T F T
T T T
  • How many rows for a proposition on 3 variables? \(k\) variables?

  • Give a good name for an operator that takes 1 variable: __________

  • Give a good name for an operator that takes 3 variables: __________

  • How many different binary operators could there be?