Aspire Faculty ID #18803 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

Consider the following in Boolean Algebra

$X:a\lor(b\land(a\lor c))=(a\lor b)\land(a\lor c)$

$Y:a\land(b\lor(a\land c))=(a\land b)\lor(a\land c)$

$a\lor(b\land c)=(a\lor b)\land c$ is satisfied if

Solution

Check $X$:

$X:a\lor(b\land(a\lor c))=(a\lor b)\land(a\lor c)$

This follows the distributive law:

$a\lor(b\land d)=(a\lor b)\land(a\lor d)$

Here,

$d=(a\lor c)$

So,

$a\lor(b\land(a\lor c))=(a\lor b)\land(a\lor(a\lor c))$

$=(a\lor b)\land(a\lor c)$

Therefore, $X$ is true.

Now check $Y$:

$Y:a\land(b\lor(a\land c))=(a\land b)\lor(a\land c)$

Using distributive law:

$a\land(b\lor d)=(a\land b)\lor(a\land d)$

Here,

$d=(a\land c)$

So,

$a\land(b\lor(a\land c))=(a\land b)\lor(a\land a\land c)$

$=(a\land b)\lor(a\land c)$

Therefore, $Y$ is true.

Hence, both $X$ and $Y$ are true.

Hence, the correct answer is $\boxed{(c)}$

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first
1
Consider the following statements about Context Free Language (CFL):Statement I: CFL is closed under homomorphism.State…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
Consider the following statements:Statement I: LALR parser is more powerful than canonical LR Parser.Statement II: SLR …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
A top down approach to programming calls for:Statement I: Working from the general to the specific.Statement II: Postpo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Consider the following statements:Statement I: Composite attributes cannot be divided into smaller subparts.Statement I…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider the following statements:Statement I: Conservative 2 PL is a deadlock-free protocol.Statement II: Thomas's wri…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the following statements of approximation algorithm:Statement I: Vertex-cover is a polynomial time 2-approxima…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
Consider the following:List IList II(A) Stack algorithm(I) Deadlock(B) Elevator algorithm(II) Disk scheduling(C) Priori…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Consider the following algorithms and their running times:List IList II(A) Breadth First Search(I) $\theta(V+E)$(B) Rab…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Match List I with List II:List IList II(A) Physical layer(I) Routing of the signals, divide the outgoing message into p…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Match List I with List II:List IList II(A) BIND(I) Block the caller until a connection attempt arrives(B) LISTEN(II) Gi…
Topic: UGC NET Computer Science Sep 2022 (Paper II)

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
Ask Your Question or Put Your Review.

loading...