Computer Sciences > Gate 2017 Set-1 > Pridicate Calculas

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Let p, q, and r be the propositions and the expression (p -> q) -> r be a contradiction. Then, the expression (r -> p)-> q is

A

a tautology

B

a contradiction

C

always TRUE when p is FALSE

D

always TRUE when q is TRUE

Check Answer

Explanation

Correct : 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