- Due: 1:30pm, Tuesday, 8 September
- Submission: turn in a paper copy in class (unusual)
- Relevant Reading: SCO 3.1
- Collaboration: This assignment follows the standard collaboration policy.
Visit Ben within one week of our first class meeting to introduce yourself and chat for a couple minutes about:
- your preferred name and pronouns;
- CS courses you have taken, are taking, or hope to take in the future;
- excitement, concerns, or questions about this course;
- anything else you deem conversation-worthy, including one fact about yourself that is not about CS.
Complete the scheduling poll (link coming soon) to help us schedule the best times for office hours with Ben and the tutors.
Gateway to Logic
A logician walks into a coffee shop and says, “I want a large double shot chai french press americano or a small soy mocha earl grey espresso and a blueberry scone.” Unfortunately, the baristas did not take CS240, nor do they really care whether “and” has precedence over “or.” As far as they’re concerned, one interpretation is as good as the other. Which of the following cases are valid interpretations of the order? (Note that English “or” means “exclusive or.”)
- Just a large double shot chai french press americano
- Just a small soy mocha earl grey espresso.
- Just a blueberry scone.
- Both a large double shot chai french press americano and a blueberry scone.
- Both a small soy mocha earl grey espresso and a blueberry scone.
- Both a large double shot chai french press americano and a small soy mocha earl grey espresso.
- All three.
- Nothing. The baristas snub the logician for being clueless about hot drinks.
Our assumption in this course is that logical “and” does take precedence over logical “or” and logical “or” is always “inclusive or” unless stated explicitly to the contrary. Which of the choices given in the previous question are valid interpretations of the order under these assumptions?
Write truth tables and boolean expressions for each of the output signals F1 and F2 in the following circuit.
Use a truth table to show that P = (P AND Q) OR (P AND NOT Q). Show columns for the intermediate expressions and the final expression.
Using elementary rules of boolean algebra, write the simplest equivalents of the following expressions as boolean expressions and draw [UPDATE 9/6:
themthe simplified versions] as digital logic circuits. We use the apostrophe’ notation as an alternative to the overbar to indicate logical negation of the preceding term.
- AB + AB’
- (A + B)(A + B’)
- ABC + A’B + ABC’