CSC 156 Fall 2024 - Homework 4 (100 pts. total)
Assigned Mon Sep 23, due Mon Sep 30
BEFORE STARTING THIS ASSIGNMENT:
Before starting the exercises given below for each section, please make sure to read each section and check your understanding (by doing the participation exercises and those additional exercises with answers provided).
FOR ALL QUESTIONS IN THIS ASSIGNMENT:
Answer each question. *Make sure to justify your answer for all questions. Do NOT just state the answer.*
THE ASSIGNMENT:
I. Section 2.3 Additional Exercises
[ 6 pts. ] #1a,1d
[ 8 pts. ] #2b
[ 8 pts. ] #2c
[ 8 pts. ] #3b
II. Section 2.4 Additional Exercises
[12 pts.] #2abc (Ignore CNF part. Just state if is in DNF or not, and justify your answer.)
[ 8 pts. ] #3a (Use DeMorgan's law twice to convert the given expression to its DNF.)
III. Section 2.5 Exercise
[20 pts.] Is it true that (P ⊼ P) ⊼ P ≡ (P ⊽ P) ⊽ P?
Explain (using logical equivalences and/or truth tables).
IV. Section 2.5 Additional Exercises
[12 pts.] #1a
[10 pts.] #4b
[ 8 pts. ] #5a (Hint: Consider the logical equivalence proven on slide 15 in the "Sections 1.3 & 1.4: Propositional Logic (Part 2)" PowerPoint on Moodle, and adapt that rule to be a Boolean algebra rule. Remember that "or" in logic becomes "+" in Boolean algebra. Then, since the non-conditional expression has + in it, use the fact that {addition, complement} is functionally complete as your starting point to show what the question is asking.)
Last Modified: 9/26/24