DMGT Assignment 02

1234567891011121314151617181920
Across
  1. 2. A relation R is said to be ______ relation if aRb => bRa for a,b ∈ A.
  2. 5. An undirected graph that is connected and has no cycles.
  3. 6. A declarative or assertive sentence that is either true or false.
  4. 9. The set of all images of elements of a set A is called ______ of a function.
  5. 11. A relation R on a set A is both reflexive and symmetric.
  6. 14. A function which is both one-one and onto.
  7. 15. A compound statement that is always true.
  8. 16. A type of matrix representing an undirected graph with all diagonal entries zero.
  9. 17. A node not adjacent to another node.
  10. 19. If every element of a set A is also the element of set B.
  11. 20. Number of edges incoming or ending at the vertex/node.
Down
  1. 1. A group G containing a finite number of elements.
  2. 3. A relation R is reflexive, anti-symmetric and transitive.
  3. 4. A path in connected graph G=<V,E> which includes every edge exactly once.
  4. 7. A group (G, *) is said to be _____ if for every a,b ∈ G, a*b=b*a.
  5. 8. A closure denoted by R⁺/R*/R∞.
  6. 10. An algebraic structure (G, *) satisfying G1, G2, G3 properties.
  7. 12. A logical connective denoted by ^ (p^q read as p and q).
  8. 13. An unordered collection of well-defined objects.
  9. 18. The lines connecting one node to another node.