Computer Sciences > GATE 2021 SET-2 > Propositional Logic

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Choose the correct choice(s) regarding the following propositional logic assertion S:
S: ((P ∧ Q) → R) → ((P ∧ Q) → (Q → R))

A

S is neither a tautology nor a contradiction.

B

S is a tautology.

C

S is a contradiction.

D

The antecedent of S is logically equivalent to the consequent of S.

Check Answer

Explanation

Correct : b; d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science