| p | q | p && q | q V (p && q) |
|---|---|---|---|
| T | T | T | T |
| T | F | F | F |
| F | T | F | T |
| F | F | F | F |
Inspiration
A few of our contributors are currently taking discrete mathematics and have made far too many mistakes creating truth tables for complex boolean statements. Thus, an idea was born: what if we made something to check our work?
What it does
The user can input a boolean statement, and our site returns a truth table representing the truth set of that statement, as well as the truth sets of its constituents.
How we built it
We used HTML, CSS, and JS along with the p5.js graphics library and the Sass scripting language to develop the website.
Challenges we ran into
The majority of our team had never worked with JS, HTML, or CSS before, and half of our team were first-time hackathon participants. Learning the tools on top of working out the complex logic to parse a statement and generate a truth table took quite a bit of time.
Accomplishments that we're proud of
Despite all of the challenges learning new stuff, we managed to get a decent amount of our code functioning.
What we learned
We learned a significant amount about how to use JS, HTML, and CSS, as well as how to work together as a team on a GitHub repository, which most of our team did not have much experience with.
Log in or sign up for Devpost to join the conversation.