Difference between revisions of "Boolean expression word problems"
From WLCS
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
'''Resources:''' | '''Resources:''' | ||
| + | * [[Media:BooleanLogic.ppt]] | ||
| + | * [[Media:SimplifyingBooleanExpressions.ppt]] | ||
| + | * [[Media:LogicGates.ppt]] | ||
* [[Media:DLD.ppt]] | * [[Media:DLD.ppt]] | ||
* [http://www.facstaff.bucknell.edu/mastascu/elessonshtml/Logic/Logic2.html Digital Logic] | * [http://www.facstaff.bucknell.edu/mastascu/elessonshtml/Logic/Logic2.html Digital Logic] | ||
'''Directions:''' | '''Directions:''' | ||
| − | For each of the following | + | For each of the following word problems, do the following in order: |
| − | # Determine what your Boolean variables are and what they represent | + | # Determine what your Boolean variables are and what they represent. Write what they are in a key/legend |
| − | # Write out the truth table that represents the word problem | + | # Write out the truth table that represents the word problem. Fill out the truth table according to the scenario's constraints |
| − | # Write out the complete Boolean expression (unsimplified!) using the minterms from the truth table | + | <!--# Write out the complete Boolean expression (unsimplified!) using the minterms from the truth table--> |
| − | # Simplify the Boolean expression | + | # Simplify the Boolean expression. You can verify your simplified expression with another truth table |
# Draw the digital circuit for the simplified Boolean expression | # Draw the digital circuit for the simplified Boolean expression | ||
Latest revision as of 12:32, 5 February 2016
Resources:
- Media:BooleanLogic.ppt
- Media:SimplifyingBooleanExpressions.ppt
- Media:LogicGates.ppt
- Media:DLD.ppt
- Digital Logic
Directions: For each of the following word problems, do the following in order:
- Determine what your Boolean variables are and what they represent. Write what they are in a key/legend
- Write out the truth table that represents the word problem. Fill out the truth table according to the scenario's constraints
- Simplify the Boolean expression. You can verify your simplified expression with another truth table
- Draw the digital circuit for the simplified Boolean expression
Exercises:
- Three sensors are attached to a printing device, with three alarms attached to the sensors. The first sensor, "A," detects if the device needs ink. The second sensor, "B," detects if the device needs repair. The third sensor, "C," detects if the device should jam. An alarm sounds if 2 or more problems occur.
- Schools are given snow days given specific circumstances. If there is ice on the roads, but no salt, then a snow day is given. If there is salt however, then a snow day is not given. Regardless of whether or not there is salt, whenever there is >2 inches of snow, then a snow day is given.
- A computer chip controls whether or not children are allowed to watch a specific TV show. If the time is before 5PM, then the TV always works. However, if it's after 5PM, then the shows rating is used. If the rating is for General Audiences, then the TV will work; however, if the rating is for Mature Audiences, then the TV does not turn on.
