1.
Which of the following is NOT
an example of a discrete
structure?
A. Graphs
B. Logical statements
C. Real numbers
D. Combinations
1. Which of the following is NOT
an example of a discrete
structure?
A. Graphs
B. Logical statements
C. Real numbers
D. Combinations
2. What is the cardinality of the
set A={2,4,6,8,10}
A. 3
B. 5
C. Infinite
D. 10
4. Which discrete mathematics
concept is most useful in
designing network layouts?
A. Power sets
B. Graph theory
C. Set difference
D. Cartesian product
Identification
6. This set contains no elements and is represented as
{} or ∅.
7. The process of combining all unique elements from
two or more sets into a single set.
8. A subset of a set that includes all possible subsets,
including the empty set and the set itself.
9. The discrete structure used in computer science to
model relationships between objects.
10. The operation used to find elements in A but not in
B.
11. The union of two disjoint sets results in a null set.
12. Finite sets have a limited number of elements,
while infinite sets have uncountable elements.
13. In set theory, A∩B includes elements that are
common to both sets.
14. Graph theory is unrelated to the field of
telecommunications.
15. The Cartesian product of two sets pairs every
element from the first set with every element of the
second set.
