Search & Filtering
Given three sets A, B, and C. Suppose the the union of the three sets has cardnality 280. Suppose also that |A| = 100, |B| = 200, and |C| = 150. And suppose we also know |A∩B| = 50, |A∩C| = 80, and |B∩C| = 90. Find the cardinality of the intersection of the three sets.
Given three sets A, B, and C. Suppose we know that the union of the three sets has cardinality 182.
Further, |A| = 92, |B| = 41, |C| = 118. Also, |A ∩ B| = 15, |A ∩ C| = 42, and |A ∩ B ∩ C| = 10. Find
|B ∩ C|.
Given three sets A, B, and C. Suppose we know that the union of the three sets has cardinality 182.
Further, |A| = 92, |B| = 41, |C| = 118. Also, |A ∩ B| = 15, |A ∩ C| = 42, and |A ∩ B ∩ C| = 10. Find
|B ∩ C|.
Determine the truth value of each of these statements if the domain for all variables consists of all integers. a) ∀n(n2 ≥ 0) b) ∃n(n2 = 2) c) ∀n(n2 ≥ n) d) ∃n(n2 < 0)
Identify whether the given path in the graph is (a) A simple path (b) A cycle (c) A simple cycle (i) (b, b) (ii) (a, d, c, d, e) (iii) (e, d, c, b) (iv) (d, c, b, e, d) (v) (a, d, c, b, e)
20. Give an example of a function from N to N that is
a) one-to-one but not onto.
b) onto but not one-to-one.
c) both onto and one-to-one (but different from the iden-
tity function).
d) neither one-to-one nor onto.
Suppose T(n) and f(n) and two functions. Write asymptotic notations (Ο, Ω, Θ) using these two functions and explain the growth rate of these functions in each notation.
Which is the most suitable graph representation scheme for a dense graph? Draw its
representation with the help of an example. What is the space complexity of a such
graph representation scheme?
Show the following operations on set(s)-
- Complement of a set
- Symmetric difference of two sets
Define the following terms using mathematical notations. Also provide example for each
term-
Subset
Universal set
Power set
