###### UGC NET CS 2015 Jun- paper-2

October 16, 2023###### Aptitude

October 16, 2023# UGC NET CS 2015 Jun- paper-2

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)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) only | |

(b) only | |

(a) and (b) | |

(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.

→ 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.

Correct Answer: D

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.

→ 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.

Subscribe

Login

0 Comments