Question 95

Computer Awareness Boolean algebra Easy

(p → q v r, q → s, r → s}  is logically equivalent to

(A) q → r
(B) r → q
(C) p → s
(D) s → p
✓ Correct Answer: Option C Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

From \(p \to (q \lor r)\): whenever p is true, q or r is true.

If q is true, then s is true (from \(q \to s\)). If r is true, then s is true (from \(r \to s\)).

So in either case s is true, which gives \(p \to s\). (This is the rule of constructive dilemma.)

Answer: (C) p → s

Practice Similar Boolean algebra Questions

Reinforce your conceptual grasp with related questions from MAH MCA CET 2015:

Q21 The number of bit strings of length 10 that contain either five...
Solve →
Q93

Given f1 , f3 and f in canonical sum of products...

Solve →
Q94 Which of the following is equivalent to the expression
Solve →
Q98 The minimum number of NAND gates required to realize AB + AB'C + AB'C' is
Solve →
Q100 The number of Boolean functions possible with n binary variables is equal...
Solve →
Full-Length Test Series

Prepare for MAH MCA CET Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →