Endeavoring to stay ahead of the curve, I've released the next batch of projects
nbm0 has us exploring numeric bases
yol0 has us intentionally using logic and exploring different approaches to a problem
Week 4
a follow-on project to ewn0 is now available: ewn1, which tasks you with identifying some additional classifications of numbers within the abundant, perfect, and deficient genre.
Week 3
A new project has been introduced: ewn0, along with the next tier of weekly puzzle fun projects (wpf4).
In addition to the logic grid, there will now also be a WORD MATH problem to solve.
Week 2
I've released the next two week's worth of projects… following the initial pnc2 project (of which I'm planning to revisit the constraint calculation theme inherent in primes), there is a 3-project sequence called dcf (data compression).
these projects deal with encoding and decoding data according to various constraints.
the concepts and algorithms related to encoding and decoding are very applicable in many areas of Computer Science, and Discrete in particular (especially in taking an algorithm and wrangling it deeper down various rabbit holes).
There are also corresponding “weekly puzzle fun” projects for each week, generally increasing in detail/complexity/fun.
Week 1
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).