 
			 
			MCQOPTIONS
 Saved Bookmarks
				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. | A free semilattice has the _______ property. | 
| A. | intersection | 
| B. | commutative and associative | 
| C. | identity | 
| D. | universal | 
| Answer» E. | |
| 2. | Every poset that is a complete semilattice must always be a _______ | 
| A. | sublattice | 
| B. | complete lattice | 
| C. | free lattice | 
| D. | partial lattice | 
| Answer» C. free lattice | |
| 3. | The graph is the smallest non-modular lattice N5. A lattice is _______ if and only if it does not have a _______ isomorphic to N5. | 
| A. | non-modular, complete lattice | 
| B. | moduler, semilattice | 
| C. | non-modular, sublattice | 
| D. | modular, sublattice | 
| Answer» E. | |
| 4. | A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if _________ | 
| A. | x>=z, where x in S implies z in S, for every element x, y in L | 
| B. | x=y and y<=z, where x, y in S implies z in S, for every element x, y, z in L | 
| C. | x<=y<=z, where x, y in S implies z in S, for every element x, y, z in L | 
| D. | x=y and y>=z, where x, y in S implies z in S, for every element x, y, z in L | 
| Answer» D. x=y and y>=z, where x, y in S implies z in S, for every element x, y, z in L | |
| 5. | The graph given below is an example of _________ | 
| A. | non-lattice poset | 
| B. | semilattice | 
| C. | partial lattice | 
| D. | bounded lattice | 
| Answer» B. semilattice | |
| 6. | A ________ has a greatest element and a least element which satisfy 0 | 
| A. | semilattice | 
| B. | join semilattice | 
| C. | meet semilattice | 
| D. | bounded lattice | 
| Answer» E. | |
| 7. | ______ and _______ are the two binary operations defined for lattices. | 
| A. | Join, meet | 
| B. | Addition, subtraction | 
| C. | Union, intersection | 
| D. | Multiplication, modulo division | 
| Answer» B. Addition, subtraction | |
| 8. | If every two elements of a poset are comparable then the poset is called ________ | 
| A. | sub ordered poset | 
| B. | totally ordered poset | 
| C. | sub lattice | 
| D. | semigroup | 
| Answer» C. sub lattice | |
| 9. | In the poset (Z+, |) (where Z+ is the set of all positive integers and | is the divides relation) are the integers 9 and 351 comparable? | 
| A. | (where Z+ is the set of all positive integers and | is the divides relation) are the integers 9 and 351 comparable?a) comparable | 
| B. | not comparable | 
| C. | comparable but not determined | 
| D. | determined but not comparable | 
| Answer» B. not comparable | |
| 10. | A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as _______ | 
| A. | sublattice | 
| B. | lattice | 
| C. | trail | 
| D. | walk | 
| Answer» C. trail | |