Projects

pct0 (bonus; due 20190821)

mtf0 (bonus; due 20190821)

dsi0 (due 20190821)

wcp1 (due 20190821)

pct1 (due 20190828)

wcp2 (due 20190828)

bdt0 (due 20190904)

pct2 (due 20190904)

wcp3 (due 20190904)

dcf0 (due 20190911)

pct3 (due 20190911)

wcp4 (due 20190911)

nbm0 (due 20190918)

pct4 (due 20190918)

wcp5 (due 20190918)

bdt1 (due 20190925)

pct5 (due 20190925)

wcp6 (due 20190925)

mtf1 (due 20191002)

pct6 (due 20191002)

wcp7 (due 20191002)

dcf1 (due 20191009)

pct7 (due 20191009)

wcp8 (due 20191009)

yol0 (due 20191023)

pct8 (bonus; due 20191023)

pct9 (due 20191023)

wcp9 (due 20191023)

ewn0 (due 20191030)

pctA (due 20191030)

wcpA (due 20191030)

dcf2 (due 20191106)

pctB (due 20191106)

wcpB (due 20191106)

cnv0 (due 20191113)

pctC (due 20191113)

wcpC (due 20191113)

EoCE (due 20191211)

Class Stats

Welcome to Discrete Structures! (aka Computer Science math! NOT to be confused with Math for Computer Scientists).
- This is a class that focuses on the patterns, mathematics (combinatorics), logic, and algorithms that are inherent to computing.
- We'll endeavor to do this by working on progressively more involved projects, so you'll get to appreciate the concepts we learn through their application in programs, hopefully in combinations with many others we've learned (not just one-shot isolated programs).