Scribd
Upload
6 views

Assignment 1

This document contains an assignment from the Discrete Mathematics course at Bahria University's Karachi campus. The assignment contains 6 questions testing comprehension of logical expressions and quantifiers. Students are asked to translate between logical statements and English, construct truth tables, use De Morgan's laws, and express specifications using predicates and quantifiers. The assignment is due on October 11th, 2019 and is worth a maximum of 5 marks.

Uploaded by

lisam50779
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Assignment 1

This document contains an assignment from the Discrete Mathematics course at Bahria University's Karachi campus. The assignment contains 6 questions testing comprehension of logical expressions and quantifiers. Students are asked to translate between logical statements and English, construct truth tables, use De Morgan's laws, and express specifications using predicates and quantifiers. The assignment is due on October 11th, 2019 and is worth a maximum of 5 marks.

Uploaded by

lisam50779
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BAHRIA UNIVERSITY,

(Karachi Campus)
Department of Computer Engineering
ASSIGNMENT#01 – Fall 2019

COURSE TITLE: Discrete Mathematics COURSE CODE: GSC-221


Class: BCE-3(A) Shift: Morning
CLO#: 2 (Comprehension) PLO#: 2 (Engg.Prob.Anls.)
Course Instructor: ENGR. HUMA TABASSUM Date: 03-Oct-2019
Due Date: 11-Oct-2019 Max. Marks: 05 Marks

Question Number: 1 (0.5 Mark)

Consider the following propositions.


p: You have the flu.
q: You miss the examination.
r: You pass the course.

a. Express the following English statements as propositions using logical connectives.


i. You have the flu and you miss the examination, or you pass the course.
ii. If you do not miss the examination, then you will pass the course.

b. Express the following propositions as English statements.


i. (p → ￢r) ˅ (q → ￢r)
ii. (p ˄ q) ˅ (￢q ˄ r)

Question Number: 2 (1 Mark)

a. State the converse, contrapositive, and inverse of the following conditional statements.
i. When I stay up late, it is necessary that I sleep until noon.
ii. A positive integer is a prime only if it has no divisors other than 1 and itself.

b. Construct a truth table for each of the following compound propositions.


i. (p ↔ q) ⊕ (¬p ↔¬r)
ii. (q ∨ p ∨ ¬s) ∧ (¬r ∨ ¬t)

Question Number: 3 (1 Mark)

a. Express these system specifications using the propositions p “The user enters a valid
password,” q “Access is granted,” and r “The user has paid the subscription fee” and logical
connectives (including negations).
i. “Access is denied if the user has not paid the subscription fee.”
ii. “If the user has not entered a valid password but has paid the subscription fee, then
access is granted.”
b. 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.

Question Number: 4 (1 Mark)

a. Use De Morgan’s laws to find the negation of each of the following statements.
i. Ibrahim will take a job in industry or go to graduate school.
ii. Sadia knows Java and calculus.

b. Show that (p → r) ∨ (q → r) and (p ∧ q) → r are logically equivalent.

Question Number: 5 (0.5 Mark)

a. Use quantifiers and predicates with more than one variable to express these statements.
i. All students in this class have learned at least one programming language.
ii. There is a student in this class who can play hockey.

b. Let C(x, y) be the statement “Student x is enrolled in class y,” where the domain for x
consists of all students in your class and domain for y consists of all computer engineering
courses at your university. Express each of these quantifications in English.
i. ∀x∃yC(x, y)
ii. ∃y∀xC(x, y)

Question Number: 6 (1 Mark)

a. Express each of these statements using quantifiers. Then form the negation of the statement
so that no negation is to the left of a quantifier. Next, express the negation in simple
English.
i. No one has climbed every mountain in the Himalayas.
ii. There is a student in this class who has taken every mathematics course offered at
this school.

b. Translate these specifications into English where F(p) is “Printer p is out of service,” B(p)
is “Printer p is busy,” L(j) is “Print job j is lost,” and Q(j) is “Print job j is queued.”
i. ∃j (Q(j) ∧ L(j)) → ∃pF(p)
ii. (∀pB(p) ∧ ∀jQ(j)) → ∃jL(j)

**********************************

You might also like