Match List I with List II
| List I | List II |
|---|---|
| A. A △ B | I. (A − B) ∪ (A − C) |
| B. A − (B ∪ C) | II. (A − B) ∩ (A − C) |
| C. A − (B ∩ C) | III. (A − B) ∪ (B − A) |
| D. A ∩ (B − C) | IV. (A ∩ B) − (A ∩ C) |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. A-III, B-II, C-I, D-IV
Explanation
A △ B = (A − B) ∪ (B − A) (III). A − (B ∪ C) = (A − B) ∩ (A − C) (II). A − (B ∩ C) = (A − B) ∪ (A − C) (I). A ∩ (B − C) = (A ∩ B) − (A ∩ C) (IV).More Discrete Structures and Optimization questions
- Consider the following statements: A. The identity is unique in any monoid. B. A monoid is a group if every element of the monoid has an in…
- If A = {4n + 2 | n is a natural number} and B = {3n | n is a natural number}, which of the following is correct for A ∩ B?
- If f(n) = 5f(n/2) + 3 and f(1) = 7 is a recurrence relation, where k is a positive integer, then f(2ᵏ) =
- Which of the following are TRUE if the universe of discourse consists of all integers? A. ∀n ∃m (n² < m) B. ∃n ∀m (n < m²) C. ∃n ∃m (n² + m…
- Which of the following sequences aₙ is a solution of the recurrence relation aₙ = 8aₙ₋₁ − 16aₙ₋₂? A. aₙ = 1 B. aₙ = 2ⁿ C. aₙ = 4ⁿ D. aₙ = n…
- Arrange the following simple graphs by the number of spanning trees they have (increasing): A. K₃ (complete graph on 3 nodes) B. K₄ (comple…