This set of Data Structure test focuses on “Binary Decision Diagrams & And Inverter Graph”.

1. Binary Decision Diagram is a type of __________

a) Multigraph

b) Cyclic Graph

c) Directed Acyclic Graph

d) Directed Acyclic Word Graph

View Answer

Explanation: An Inverter is a directed graph which is used to solve Boolean expressions, hence have no loops.

2. In which of the following case does a Binary Decision Diagram is used for?

a) Representation of Boolean Functions

b) String Matching

c) Searching

d) Sorting of number

View Answer

Explanation: A Binary Decision Diagram is used to represent a Boolean function.

3. In a Binary Decision Diagram, how many types of terminal exists?

a) 1

b) 2

c) 3

d) 4

View Answer

Explanation: In a BDD, 2 terminals namely terminal-0 and terminal-1 exists.

4. In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.

a) dashed, bold

b) bold, dashed

c) dotted, bold

d) dotted, dashed

View Answer

Explanation: It is used to distinguish between the 2 values without explicitly writing.

5. How many nodes are required to create a Binary Decision Tree having 4 variables?

a) 2^{4}

b) 2^{4-1}

c) 2^{5}

d) 2^{5-1}

View Answer

Explanation: Binary Decision Trees are complete Binary Trees of level V + 1, here V is the number of variables.

6. Two or more And Inverter Graphs can represent same function.

a) True

b) False

View Answer

Explanation: And Inverter Graphs are not canonical in nature.

7. Size of an And Inverter Graph is the number of _______ gates and the number of logic levels is number of ________ gates on the __________ path from a primary input to a primary output.

a) AND, AND, average

b) AND, OR, longest

c) OR, OR, shortest

d) AND, AND, longest

View Answer

Explanation: The given statement forms the attributes of the And Inverter Graph.

8. And Inverter Graph is a type of __________

a) Multigraph

b) Cyclic Graph

c) Directed Acyclic Graph

d) Directed Acyclic Word Graph

View Answer

Explanation: And Inverter is a directed graph which is used to solve boolean expressions, hence have no loops.

9. The And Inverter Graph representation of a Boolean function is more efficient than the Binary Decision Diagram.

a) True

b) False

View Answer

Explanation: The conversion from the network logic is faster and more scalable than in the case of the Binary Decision Diagram.

10. Which of the following logical operation can’t be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?

a) Conjunction

b) Disjunction

c) Negation

d) Tautology Checking

View Answer

Explanation: In Binary Decision Diagram, Conjunction, Disjunction, Negotiation can be implemented in polynomial time whereas tautology checking can be implemented in linear time.

**Sanfoundry Global Education & Learning Series – Data Structure.**

To practice all areas of Data Structure for tests, __here is complete set of 1000+ Multiple Choice Questions and Answers__.

**Next Steps:**

- Get Free Certificate of Merit in Data Structure I
- Participate in Data Structure I Certification Contest
- Become a Top Ranker in Data Structure I
- Take Data Structure I Tests
- Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
- Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

**Related Posts:**

- Apply for Computer Science Internship
- Practice Computer Science MCQs
- Practice Design & Analysis of Algorithms MCQ
- Buy Data Structure Books
- Buy Computer Science Books