Computer Sciences > Gate 2015 Set-2 > Propositional Logic
Consider the following two statements.

S1: If a candidate is known to be corrupt, then he will not be elected.
S2: If a candidate is kind, he will be elected.

Which one of the following statements follows from S1 and S2 as per sound inference rules of logic?
A
If a person is known to be corrupt, he is kind
B
If a person is not known to be corrupt, he is not kind
C
If a person is kind, he is not known to be corrupt
D
If a person is not kind, he is not known to be corrupt

Explanation

Correct : Propositional Logic

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