October 16, 2023
October 16, 2023
October 16, 2023
###### Aptitude
October 16, 2023
 Question 6
Consider the following statements :
(a)Boolean expressions and logic networks correspond to labelled acyclic digraphs.
(b)Optimal boolean expressions may not correspond to simplest networks.
(c)Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of these statement(s) is/are correct ?
 A (a) only B (b) only C (a) and (b) D (a), (b) and (c)
Question 6 Explanation:
→ An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a “DAG.”,We can represent the boolean expressions and logic networks by using DAG.
→ Karnaugh maps reduce logic functions more quickly and easily compared to Boolean algebra. By reduce we mean simplify, reducing the number of gates and inputs.
Question 6 Explanation:
→ An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a “DAG.”,We can represent the boolean expressions and logic networks by using DAG.
→ Karnaugh maps reduce logic functions more quickly and easily compared to Boolean algebra. By reduce we mean simplify, reducing the number of gates and inputs.