Computer Sciences > Gate 2015 Set-3 > Set Theory
Suppose U is the power set of the set S = {1,2,3,4,5,6}. For any T ∈ U, let |T| denote the number of elements in T and T′ denote the complement of T. For any T, R ∈ U, let TR be the set of all elements in T which are not in R. Which one of the following is true?
A
∀X∈U(|X| = |XX′|)
B
∃X∈ U∃Y∈U(|X|=5,|Y|=5 and X∩Y= ∅)
C
∀X∈U∀Y∈U(|X|=2,|Y|=3 and X∖Y=∅)
D
∀X∈U∀Y∈U(X∖Y=Y′∖X′ )

Explanation

Correct : Set Theory

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