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

Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R):

Assertion (A): $\bar{p}$

Reason (R): $(r\to \bar{q},\ r\lor s,\ s\to \bar{q},\ p\to q)$

In the light of the above statements, choose the correct answer from the options given below:

Solution


Given Reason statements are:

$r\to \bar{q}$

$r\lor s$

$s\to \bar{q}$

$p\to q$

From $r\lor s$, either $r$ is true or $s$ is true.

Case 1:

If $r$ is true, then using $r\to \bar{q}$, we get:

$\bar{q}$

Case 2:

If $s$ is true, then using $s\to \bar{q}$, we get:

$\bar{q}$

So, in both cases:

$\bar{q}$ is true.

Now we also have:

$p\to q$

Using modus tollens:

$p\to q$ and $\bar{q}$ imply $\bar{p}$.

Therefore, Assertion (A), that is $\bar{p}$, is true.

Also, Reason (R) correctly explains how $\bar{p}$ is obtained.

Hence, both (A) and (R) are true and (R) is the correct explanation of (A).

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

Nearest first
1
A good software requirement specification does NOT have the characteristic
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
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))=(…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
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)
4
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)
5
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)
6
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)
7
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)
8
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)
9
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)
10
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)

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

Ascending by ID
Ask Your Question or Put Your Review.

loading...