EC > Gate 2021 > Reasoning
Given below are two statements and two conclusions.
Statement 1: All purple are green.
Statement 2: All black are green.
Conclusion I: Some black are purple.
Conclusion II: No black is purple.
Based on the above statements and conclusions, which one of the following options is logically CORRECT?
A
Only conclusion I is correct.
B
Only conclusion II is correct.
C
Either conclusion I or II is correct.
D
Both conclusion I and II are correct.

Explanation

Correct : c

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