Skip to content
Exercise 12.1 · Q8

Q.Let A=(101001011001)A=\begin{pmatrix}1&0&1&0\\0&1&0&1\\1&0&0&1\end{pmatrix}, B=(010110101001)B=\begin{pmatrix}0&1&0&1\\1&0&1&0\\1&0&0&1\end{pmatrix}, C=(110101101111)C=\begin{pmatrix}1&1&0&1\\0&1&1&0\\1&1&1&1\end{pmatrix} be any three boolean matrices of the same type. Find

(i) A∨BA\vee B
(ii) A∧BA\wedge B
(iii) (A∨B)∧C(A\vee B)\wedge C
(iv) (A∧B)∨C(A\wedge B)\vee C.
Puducherry TnboardTextbookSubjectiveImportance★★★★★
10% · 8/84 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Join takes the entrywise maximum (a 11 if either matrix has a 11 there) and meet takes the entrywise minimum (a 11 only if both matrices have a 11 there); we compute A∨BA\vee B and A∧BA\wedge B first, then use them to build the last two answers.

Step 1. Compute A∨BA\vee B (entrywise max) with A=(101001011001)A=\begin{pmatrix}1&0&1&0\\0&1&0&1\\1&0&0&1\end{pmatrix}, B=(010110101001)B=\begin{pmatrix}0&1&0&1\\1&0&1&0\\1&0&0&1\end{pmatrix}.

Row 1: max⁡(1,0),max⁡(0,1),max⁡(1,0),max⁡(0,1)=1,1,1,1\max(1,0),\max(0,1),\max(1,0),\max(0,1)=1,1,1,1.

Row 2: max⁡(0,1),max⁡(1,0),max⁡(0,1),max⁡(1,0)=1,1,1,1\max(0,1),\max(1,0),\max(0,1),\max(1,0)=1,1,1,1.

Row 3: max⁡(1,1),max⁡(0,0),max⁡(0,0),max⁡(1,1)=1,0,0,1\max(1,1),\max(0,0),\max(0,0),\max(1,1)=1,0,0,1.

A∨B=(111111111001).A\vee B=\begin{pmatrix}1&1&1&1\\1&1&1&1\\1&0&0&1\end{pmatrix}.

Step 2. Compute A∧BA\wedge B (entrywise min).

Row 1: min⁡(1,0),min⁡(0,1),min⁡(1,0),min⁡(0,1)=0,0,0,0\min(1,0),\min(0,1),\min(1,0),\min(0,1)=0,0,0,0.

Row 2: min⁡(0,1),min⁡(1,0),min⁡(0,1),min⁡(1,0)=0,0,0,0\min(0,1),\min(1,0),\min(0,1),\min(1,0)=0,0,0,0.

Row 3: min⁡(1,1),min⁡(0,0),min⁡(0,0),min⁡(1,1)=1,0,0,1\min(1,1),\min(0,0),\min(0,0),\min(1,1)=1,0,0,1.

A∧B=(000000001001).A\wedge B=\begin{pmatrix}0&0&0&0\\0&0&0&0\\1&0&0&1\end{pmatrix}.

Step 3. Compute (A∨B)∧C(A\vee B)\wedge C using C=(110101101111)C=\begin{pmatrix}1&1&0&1\\0&1&1&0\\1&1&1&1\end{pmatrix} (entrywise min of A∨BA\vee B and CC).

Row 1: min⁡(1,1),min⁡(1,1),min⁡(1,0),min⁡(1,1)=1,1,0,1\min(1,1),\min(1,1),\min(1,0),\min(1,1)=1,1,0,1.

Row 2: min⁡(1,0),min⁡(1,1),min⁡(1,1),min⁡(1,0)=0,1,1,0\min(1,0),\min(1,1),\min(1,1),\min(1,0)=0,1,1,0.

Row 3: min⁡(1,1),min⁡(0,1),min⁡(0,1),min⁡(1,1)=1,0,0,1\min(1,1),\min(0,1),\min(0,1),\min(1,1)=1,0,0,1.

(A∨B)∧C=(110101101001).(A\vee B)\wedge C=\begin{pmatrix}1&1&0&1\\0&1&1&0\\1&0&0&1\end{pmatrix}. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.