Discrete Structure (DS) MCQs with answers Page - 11

Here, you will find a collection of MCQ questions on Discrete Structure (DS). 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 • 833.24K Points
Coach

Q. Types of function Mappings are-----

  • (A) One to one
  • (B) Many to one
  • (C) Into, Onto
  • (D) All

A

Admin • 833.24K Points
Coach

Q. The Transitive Closure of a relation R is denoted by----

  • (A) R*
  • (B) R
  • (C) R+
  • (D) RR

A

Admin • 833.24K Points
Coach

Q. The alternative method to find transitive closure of R* is-------.

  • (A) R*
  • (B) RR
  • (C) Warshall’s Algorithm
  • (D) R

A

Admin • 833.24K Points
Coach

Q. Poset is a------

  • (A) Positive set
  • (B) p-set
  • (C) P*
  • (D) Partially Ordered set

A

Admin • 833.24K Points
Coach

Q. If A is any non-empty set and R is a partial ordered relation on set A, then the ordered pair (A,R) is called -------

  • (A) Poset
  • (B) p-set
  • (C) Positive set
  • (D) None

A

Admin • 833.24K Points
Coach

Q. Let (A, ≤) be a poset. A subset of A is known as ------if every pair of elements in the subset are related.

  • (A) Chain
  • (B) Antichains
  • (C) Group
  • (D) Lattice.

A

Admin • 833.24K Points
Coach

Q. The number of elements in the chain is called as------

  • (A) Chain
  • (B) Antichains
  • (C) None
  • (D) Length of chain

A

Admin • 833.24K Points
Coach

Q. A ------ is a poset (A, ≤) in which every subset {a, b} of A, has a least upper bound and a greatest lower bound.

  • (A) Chain
  • (B) Lattice.
  • (C) Antichains
  • (D) Group

A

Admin • 833.24K Points
Coach

Q. Pigeon Hole Principle says that if there are many pigeons and a few pigeon holes, then there must be some pigeon holes occupied by--------------

  • (A) Two or more pigeons.
  • (B) Pigeons
  • (C) One only
  • (D) None

A

Admin • 833.24K Points
Coach

Q. Digraph can be represented by-----

  • (A) Hasse diagrams
  • (B) Digraph
  • (C) Graph
  • (D) None

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.