# Discrete Mathematics | Normal Forms MCQs

Discrete Mathematics | Normal Forms MCQs: This section contains multiple-choice questions and answers on Normal Forms in Discrete Mathematics.
Submitted by Anushree Goswami, on July 20, 2022

1. As a decision problem, it consists of finding in a finite number of steps whether a statement is____?

1. Tautological
3. Satisfiable
4. All of the above

Answer: D) All of the above

Explanation:

As a decision problem, it consists of finding in a finite number of steps whether a statement is tautological, contradictory, or satisfiable.

2. It may not always be feasible to construct a ____ for a Decision Problem?

1. Dataset
2. Truth table
3. Data table
4. Decision table

Explanation:

It may not always be feasible to construct a truth table for a Decision Problem.

3. If the truth table cannot be created, we consider the ____ to normal forms as an alternative?

2. Subtraction
3. Reduction
4. Division

Explanation:

If the truth table cannot be created, we consider the reduction to normal forms as an alternative.

4. How many types of normal forms are there to which reduction can be performed?

1. 2
2. 3
3. 4
4. 5

Explanation:

There are 2 types of normal forms in which reduction can be performed.

5. Full form of DNF is -?

1. Disjoining Normal Form
2. Disjunctive Normal Form
3. Divisional Normal Form
4. Dividend Normal Form

Explanation:

Full form of DNF is Disjunctive Normal Form.

6. Which of the following is/are the type(s) of normal forms to which reduction can be performed?

1. Disjunctive Normal Form
2. Conjunctive Normal Form
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

The following are the types of normal forms to which reduction can be performed -

1. Disjunctive Normal Form
2. Conjunctive Normal Form