Scribd
Upload
146 views

Assignment 1

This document is an assignment for a discrete mathematics course. It provides 10 problems on topics like propositional logic, truth tables, and logical equivalences. Students are instructed to only submit problems 4b, 5, 8, 9a,d and 10a,c for grading but are responsible for all problems for quizzes and exams. Copying assignments will result in a grade of zero.

Uploaded by

КанарейкаАрейка
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
146 views

Assignment 1

This document is an assignment for a discrete mathematics course. It provides 10 problems on topics like propositional logic, truth tables, and logical equivalences. Students are instructed to only submit problems 4b, 5, 8, 9a,d and 10a,c for grading but are responsible for all problems for quizzes and exams. Copying assignments will result in a grade of zero.

Uploaded by

КанарейкаАрейка
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Kuwait University Fall 2022/2023

College of Engineering and Petroleum CpE-203: Discrete Mathematics


Department of Computer Engineering Assignment1

Note: Submit only problems #4(b), #5, #8, #9 (a,d) and #10 (a,c) for grading. However, you are
responsible for all the problems for quiz and midterms. Copied assignment will be graded ZERO.

Problem #1
Show that each of these conditional statements is a tautology by using truth tables.

a) [¬p ∧ (p ∨ q)] → q
b) [(p → q) ∧ (q → r)] → (p → r)

Problem #2
Let p, q, and r be the propositions
p :You have the flu. q :You miss the final examination. r :You pass the course.
Express each of these propositions as an English sentence.
a) p → q b) ￢q ↔ r
c) q →￢r d) p ∨ q ∨ r
e) (p →￢r) ∨ (q →￢r)

Problem #3
Express these system specifications using the propositions p “The message is scanned for viruses” and q “The
message was sent from an unknown system” together with logical connectives (including negations).

a) “The message is scanned for viruses whenever the message was sent from an unknown system.”
b) “The message was sent from an unknown system but it was not scanned for viruses.”
c) “It is necessary to scan the message for viruses when-ever it was sent from an unknown system.”
d) “When a message is not sent from an unknown system it is not scanned for viruses.”

Problem #4
Find the output of each of these combinatorial circuits (show details on the circuit not only final answer).

Problem #5
Construct a combinatorial circuit using inverters, OR gates, and AND gates that produces the output
((¬p ∨¬r)∧¬q) ∨ (¬p ∧ (q ∨ r)) from input bits p, q, and r.

CpE-203: Discrete Structures Assignment 1 Page 1 of 2


Kuwait University Fall 2022/2023
College of Engineering and Petroleum CpE-203: Discrete Mathematics
Department of Computer Engineering Assignment1

Problem #6
Are these system specifications consistent? “Whenever the system software is being upgraded, users cannot access
the file system. If users can access the file system, then they can save new files. If users cannot save new files,
then the system software is not being upgraded.”

Problem #7
Re-write the statements in “if-then” form.
a) If it snows today, I will ski tomorrow.
b) I come to class whenever there is going to be a quiz.
c) The apple trees will bloom if it stays warm for a week.

Problem #8
Let p and q be the propositions
p :You drive over 65 miles per hour. q :You get a speeding ticket.
Write these propositions using p and q and logical connectives (including negations).
a) You drive over 65 miles per hour, but you do not get a speeding ticket.
b) You will get a speeding ticket if you drive over 65 miles per hour.
c) If you do not drive over 65 miles per hour, then you will not get a speeding ticket.
d) Driving over 65 miles per hour is sufficient for getting a speeding ticket.
e) Whenever you get a speeding ticket, you are driving over 65 miles per hour.

Problem #9
Construct a truth table for each of these compound propositions to determine their truth value.
a) (p ∨ q) → (p ⊕ q) b) (p ↔ q) ⊕ (￢p ↔ q)
c) (p → q) ∧ (￢p → q) d) (p ∨ q) → r and (p → r) ∧ (q → r)
e) (p → q) → r and p → (q → r) f) ∼(p ⊕ q) and p ↔ q

Problem #10
Using the laws for logical equivalences on Logic, prove the following identities. In each step mention the logical
equivalences you are using:
a) [￢p ∧ (p ∨ q)] → q  True b) [p ∧ (p → q)] → q  True
c) [(p ∨ q) ∧ (q ∨ ~q)] ∨ q  (p ∨ q) d) ∼ [∼[(p ∨ q) ∧ r] ∨ ~q]  (q ∧ r)
e) (p → r) ∨ (q → r)  (p ∧ q) → r f) [∼ p ∧ (p ∨ q)] → q  True

CpE-203: Discrete Structures Assignment 1 Page 2 of 2

You might also like