Scribd
Upload
255 views

Discrete Structures Mid Exam SP 2024 Final Solution

Uploaded by

ahkhan056056
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
255 views

Discrete Structures Mid Exam SP 2024 Final Solution

Uploaded by

ahkhan056056
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

COMSATS University Islamabad, Attock Campus

Department of Computer Science

Degree Program(s): BCS I & BSE I

SPRING 2024 MidTerm Examination


Course: - Discrete Structures
Solution
Time Allowed:- 1.5Hrs (90 mins)
Dated:- 19/04/2024
Paper Timing:- 10:10am-11:40am
Marks:- 25
Name:- _______________________________________ Reg. No.:- _______________________________

Note:-Don’t write anything on Question Paper except your name & Reg. No.

All students are required to undertake the "Honor Pledge" and beware that they would be held accountable
in the court of Allah for their deeds and misconducts "In the name of Allah the most beneficent and merciful,
I affirm that I will not give or receive any unauthorized help on this exam, and that all work will be my own.”

Signature:-------------------

Question #1: [CLO 1]

a. What is the negation for “b ≤ 5”. Use De Morgan’s law and solve the inequality to justify
your choice. (03)

1. b is less then OR equal to 5


2. b is less then AND equal to 5
3. b is neither less then nor equal to 5
4. b is either less then or equal to 5
5. None of These

b. The contrapositive statement for ( ~p ∧ q) → ~q is: (03)

1. ~ ( ~p ∧ q) → q
2. ~q → ( ~p ∧ q)
3. ~q → ~ ( p v ~q)
4. q → ~ ( ~p ∧ q)
5. None of These

c. Fill in the Truth Table and prove the validity of the Argument. (05)

Statement Premise 1 Premise 2 Premise 3 Conclusion


Variables
p Q r ~p ~q p∨~q ~p v p ( ~q ∧ r) → c (p ∧ r) v r
F F F T T T T T F
F F T T T T T F T
F T F T F F T T F
F T T T F F T T T
T F F F T T T T F
T F T F T T T F T
T T F F F T T T F
T T T F F T T T T
INVALID ARGUMENT

Question #2: [CLO 2]

a. Which of the following expression(s) is true? Justify your choice by providing the solution.
(02)

1. pq≡t
2. (p  q)  p ≡ t
3. ( (p  q)  p)  p ≡ t
4. None of These

b. Complete the given simplification using the laws of logic. (04)

Logical Expression Laws of Logic


( ( ( (p ∧ q) v ~q ) ∧ ~r ) → r ) ↔ ( (p v ~r) ∧ ~r) Given
( ( ( (p v ~q) ∧ (q v ~q ) ) ∧ ~r ) → r ) ↔ ( (p v ~r) ∧ ~r ) Distributive Law
( ( ( (p v ~q) ∧ t ) ∧ ~r ) → r ) ↔ ( (p v ~r) ∧ ~r ) Negation Law
( ( (p v ~q) ∧ ~r ) → r ) ↔ ( (p v ~r) ∧ ~r ) Identity Law
( ~ ( (p v ~q) ∧ ~r ) v r ) ↔ ( (p v ~r) ∧ ~r ) Implication Law
( ( ( ~ p ∧ q ) v r ) v r ) ↔ ( ( p v ~r ) ∧ ~r ) De Morgans Law
( ( ~ p ∧ q ) v (r v r ) ) ↔ ( ( p v ~r ) ∧ ~r ) Associative Law
( ( ~ p ∧ q ) v r ) ↔ ( ( p v ~r ) ∧ ~r ) Idempotent Law
( ( ~ p ∧ q ) v r ) ↔ ~r Absorption Law
( ( ( ~ p ∧ q ) v r ) → ~r ) ∧ ( ~r → ( ( ~ p ∧ q ) v r ) ) Equivalence Law
( ( ( p v ~q ) ∧ ~r ) v ~r ) ∧ ( r v ( ( ~ p ∧ q ) v r ) ) Implication Law
~r ∧ ( r v ( ( ~ p ∧ q ) v r ) ) Absorption Law
~r ∧ ( r v ( ~ p ∧ q ) ) `Associative Law
(~r ∧ r) v ( ~r ∧ ( ~ p ∧ q ) ) Distributive Law
c v ( ~r ∧ ( ~ p ∧ q ) ) Negation Law
( ~r ∧ ( ~ p ∧ q ) ) Identity Law

c. Consider the following Circuit

1. Write Boolean expression for the given Circuit. (03)


[ ( ~x v y ) ∧ ~ ( y v ( x ∧ ~z ) ) ] v [ (x ∧ ~ (y ∧ z) ) ]

2. Simplify the Boolean expression using the laws. (03)


[ ( ~x v y ) ∧ ~ ( y v ( x ∧ ~z ) ) ] v [ (x ∧ ~ (y ∧ z) ) ]
[ ( ~x v y ) ∧ ( ~y ∧ ( ~x v z ) ) ] v [ (x ∧ (~y v ~z) ) ]

[ ( ( ~x v y ) ∧ ~y ) ∧ ( ~x v z ) ] v [ (x ∧ (~y v ~z) ) ]

[ ( ~x ∧ ~y ) ∧ ( ~x v z ) ] v [ (x ∧ (~y v ~z) ) ]

[ ( ~x ∧ ~y ) ∧ ( ~x v z ) ] v [ ( x ∧ ~y ) v (x ∧ ~z) ]

[ [ ( ~x ∧ ~y ) ∧ ( ~x v z ) ] v ~ ( ~x v z ) ] v ( x ∧ ~y )

( ~x ∧ ~y ) v ( x ∧ ~z ) v ( x ∧ ~y )

( ~y ∧ ( ~x v x ) ) v (x ∧ ~z)

( ~y v (x ∧ ~z) )

3. Build input/Output table for the given Circuit. (02)

X Y XvY
x y Z ~x ~y ~ ( ~x v ~ ( y v ( x ∧ ~z ) ) (x ∧ ~ (y ∧ z) ) ( ~x v y ) ∧ ~ ( y v ( x ∧ ~z ) FINAL
z y)
0 0 0 1 1 1 1 1 0 1 1
0 0 1 1 1 0 1 1 0 1 1
0 1 0 1 0 1 1 0 0 0 0
0 1 1 1 0 0 1 0 0 0 0
1 0 0 0 1 1 0 0 1 0 1
1 0 1 0 1 0 0 1 1 0 1
1 1 0 0 0 1 1 0 1 0 1
1 1 1 0 0 0 1 0 0 0 0

“Mistakes are proof that you are trying”

Good Luck

You might also like