Consider the following statements: I. If A is a subset of U and U is the Universal set, then the complement of the set A is also a subset of U. II. The complement of a Universal set is a singleton set. Which of the statements given above is/are correct?
I only
Statement I is correct because the complement of \(A\), defined as \(A'=U-A\), always consists of elements of \(U\) and so is a subset of \(U\). Statement II is incorrect because the complement of the Universal set is \(U-U=\varnothing\), the empty set, not a singleton set. Hence only statement I is correct.
Let X = {x | x = 2 + 4k, where k = 0, 1, 2, 3,...24}. Let S be a subset of X such that the sum of no two elements of S is 100. What is the maximum possible number of elements in S ?
Match List I with List II
Let R 1= {(1, 1), (2, 2), (3, 3)} and R 2 = {(1, 1), (1, 2), (1, 3), (1, 4)}
List I | List II |
(A) R 1∪ R 2 | (I) {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (3, 3)} |
(B) R 1- R 2 | (II) {1, 1} |
(C) R 1∩ R 2 | (III) {(1, 2), (1, 3), (1, 4)} |
(D) R 2- R 1 | (IV) {(2, 2), (3, 3)} |
Choose the correct answer from the options given below:
Let R be a relation on a set A such that R = R-1, then R is
In a beauty contest, half the number of experts voted for Mr. A and two third voted for Mr. B. 10 voted for both and 6 did not for either. How many experts were there in all?
In a survey where 100 students reported which subjects they like, 32 students in total liked Mathematics, 38 students liked Business and 30 students liked Literature. Moreover 7 students liked both Mathematics and Literature, 10 students liked both Mathematics and Business, 8 students liked both Business and Literature, 5 students liked all three subjects.
Then the number of people who liked exactly one subject is
A professor has 24 text books on computer science and is concerned about their coverage of the topics (P) compilers, (Q) data structures and (R) Operating systems. The following data gives the number of books that contain material on these topics: n(P) = 8, n(Q) = 13, n(R) = 13, n(P ∩ R) = 3, n(P ∩ R) = 3, n(Q ∩ R) = 3, n(Q ∩ R) = 6, n(P ∩ Q ∩ R) = 2, where n(x) is the cardinality of the set x. Then the number of text books that have no material on compilers is