Unit 1 Discrete Mathematics

12345678910111213141516
Across
  1. 1. Set of all elements in a problem.
  2. 4. Simplest type of proof.
  3. 8. Logical equivalent of converse.
  4. 13. When sets have no intersection.
  5. 14. Method in which set is written using a formula.
  6. 15. Graphical representation of set problem.
  7. 16. A set which is a part of another set
Down
  1. 2. Collection of unordered, distinct and we'll defined objects.
  2. 3. Set of only common elements of operand sets.
  3. 5. Method in which elements of a set are directly listed.
  4. 6. Set of all elements not in given set.
  5. 7. Set of all elements of operand sets.
  6. 9. Set that contains elements belonging to operand sets but not their intersection.
  7. 10. Sets that have 2^n elements.
  8. 11. Number of elements in a set.
  9. 12. Logical equivalent of implication.