Discrete Mathematics MCQs with answers Page - 41

Here, you will find a collection of MCQ questions on Discrete Mathematics. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 828.03K Points
Coach

Q. The set of all divisors of 24 are ___________.

  • (A) {1, 2, 3, 4, 6, 8, 12, 24}
  • (B) {2, 3, 4, 6, 8, 12}
  • (C) {1, 3, 6, 12,}
  • (D) {2, 4, 6, 8}

A

Admin • 828.03K Points
Coach

Q. Which of the following is Absorption Law?

  • (A) a*a <=>a
  • (B) a+(a*b)<=> a
  • (C) a*b <=>a*a
  • (D) (a*b)*c <=>a*(b*c)

A

Admin • 828.03K Points
Coach

Q. In a bounded lattice, an element b belongs to L is called a complement of an element a belongs to L if ______.

  • (A) a*b=0
  • (B) a+b=1
  • (C) both a and b
  • (D) none

A

Admin • 828.03K Points
Coach

Q. If each non-empty subset of a lattice has a least upper bound and greatest lower bound then the lattice is called ________.

  • (A) complete
  • (B) associative
  • (C) absorption
  • (D) commutative

A

Admin • 828.03K Points
Coach

Q. A __________ is a complemented distributive lattice.

  • (A) boolean homomorphism
  • (B) boolean algebra
  • (C) boolean isomorphism
  • (D) boolean function

A

Admin • 828.03K Points
Coach

Q. Edges intersect only at their ends are called ________.

  • (A) planar
  • (B) loop
  • (C) link
  • (D) non plannar

A

Admin • 828.03K Points
Coach

Q. Two vertices which are incident with the common edge are called ______________vertices.

  • (A) distinct
  • (B) directed
  • (C) adjacent
  • (D) loops

A

Admin • 828.03K Points
Coach

Q. An edge with identical ends is called _________.

  • (A) complete graph
  • (B) bipartite graph
  • (C) loops
  • (D) link

A

Admin • 828.03K Points
Coach

Q. An edge with same ends is called ___________.

  • (A) complete graph
  • (B) bipartite graph
  • (C) loops
  • (D) link

A

Admin • 828.03K Points
Coach

Q. In a graph if few edges have directions and few do not have directions then the graph is called _________.

  • (A) multi graph
  • (B) directed graph
  • (C) undirected graph
  • (D) mixed graph

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.