MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Let G be the graph defined as the Hasse diagram for the ⊆ relation on the set S{1, 2,…, 18}. How many edges are there in G? |
| A. | 43722 |
| B. | 2359296 |
| C. | 6487535 |
| D. | 131963 |
| Answer» C. 6487535 | |
| 2. |
Suppose P1 is a partially ordered class and a cut of P1 is pair (D, T) of nonempty subclasses of P1 satisfies which of the following properties? |
| A. | D∩T=Ø |
| B. | D∪T=P1 |
| C. | xyz∈T |
| D. | z∈T and zx∈D |
| Answer» B. D∪T=P1 | |
| 3. |
In a poset P({v, x, y, z}, ⊆) which of the following is the greatest element? |
| A. | {v, x, y, z} |
| B. | 1 |
| C. | ∅ |
| D. | {vx, xy, yz} |
| Answer» B. 1 | |
| 4. |
In a poset (S, ⪯), if there is no element n∈S with m |
| A. | an element n exists for which m=n |
| B. | An element m is maximal in the poset |
| C. | A set with the same subset of the poset |
| D. | An element m is minimal in the poset |
| Answer» C. A set with the same subset of the poset | |
| 5. |
In which of the following relations every pair of elements is comparable? |
| A. | ≤ |
| B. | != |
| C. | >= |
| D. | == |
| Answer» B. != | |
| 6. |
The relation ≤ is a partial order if it is ___________ |
| A. | reflexive, antisymmetric and transitive |
| B. | reflexive, symmetric |
| C. | asymmetric, transitive |
| D. | irreflexive and transitive |
| Answer» B. reflexive, symmetric | |
| 7. |
Which of the following relation is a partial order as well as an equivalence relation? |
| A. | equal to(=) |
| B. | less than(<) |
| C. | greater than(>) |
| D. | not equal to(!=) |
| Answer» B. less than(<) | |
| 8. |
If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________ |
| A. | NP-complete |
| B. | O(n2) |
| C. | O(n+2) |
| D. | O(n3) |
| Answer» B. O(n2) | |
| 9. |
If a partial order is drawn as a Hasse diagram in which no two edges cross, its covering graph is called ______ |
| A. | upward planar |
| B. | downward planar |
| C. | lattice |
| D. | biconnected components |
| Answer» B. downward planar | |
| 10. |
Hasse diagrams are first made by ______ |
| A. | A.R. Hasse |
| B. | Helmut Hasse |
| C. | Dennis Hasse |
| D. | T.P. Hasse |
| Answer» C. Dennis Hasse | |