Top 350+ Solved Discrete Mathematics MCQ Questions Answer

From 46 to 60 of 338

Q. A                  has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L).

a. semilattice

b. join semilattice

c. meet semilattice

d. bounded lattice

  • d. bounded lattice

Q. The graph given below is an example of

a. non-lattice poset

b. semilattice

c. partial lattice

d. bounded lattice

  • a. non-lattice poset

Q. 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

  • c. x<=y<=z, where x, y in s implies z in s, for every element x, y, z in l

Q. 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

  • d. modular, sublattice

Q. Every poset that is a complete semilattice must always be a                

a. sublattice

b. complete lattice

c. free lattice

d. partial lattice

  • b. complete lattice

Q. A free semilattice has the                property.

a. intersection

b. commutative and associative

c. identity

d. universal

  • d. universal

Q. Algebra of logic is termed as

a. numerical logic

b. boolean algebra

c. arithmetic logic

d. boolean number

  • c. arithmetic logic

Q. What is the definition of Boolean functions?

a. an arithmetic function with k degrees such that f:y–>yk

b. a special mathematical function with n degrees such that f:yn–>y

c. an algebraic function with n degrees such that f:xn–>x

d. a polynomial function with k degrees such that f:x2–>xn

  • b. a special mathematical function with n degrees such that f:yn–>y

Q. Which of the following is a Simplification law?

a. m.(~m+n) = m.n

b. m+(n.o) = (m+n)(m+o) c) ~(m+n) = ~m.~n

c. d) m.(n.o) = (m.n

d. .o

  • a. m.(~m+n) = m.n

Q. What are the canonical forms of Boolean Expressions?

a. or and xor

b. nor and xnor

c. max and min

d. som and pom

  • d. som and pom

Q. Which of the following is/are the universal logic gates?

a. or and nor

b. and

c. nand and nor

d. not

  • c. nand and nor

Q. What is the use of Boolean identities?

a. minimizing the boolean expression

b. maximizing the boolean expression

c. to evaluate a logical identity

d. searching of an algebraic expression

  • a. minimizing the boolean expression
Subscribe Now

Get All Updates & News