Karnaugh map (K-Map) MCQ

Karnaugh map (K-Map) MCQ

Karnaugh map (K-Map) MCQ, K-Map MCQ, Multiple Choice Questions on K-Map, Karnaugh map MCQ, Quine-McClusky MCQ, Multiple Choice Questions on Quine-McClusky, Digital Electronics MCQ, Engineering MCQ,

Logic Gate MCQ

Programmable Logic Devices MCQ

Objective Type Questions

Q.1. An n variable K-map can have

  • n2 cells
  • 2n cells
  • nn cells
  • n2n cells

Answer: 2n cells

Q.2. Each term in the standard SOP form is called a

  • minterm
  • maxtenn
  • don’t care
  • literal

Answer: minterm

Q.3. Each term in the standard POS form is called a

  • minterm  
  • maxterm 
  • don’t care
  • literal

Answer: maxterm

Q.4. The main criterion in the design of a digital circuit is the reduction of

  • Cost
  • size
  • weight
  • volume

Answer: Cost

Q.5. The binary number designations of the rows and columns of the K-map are in

  • binary code
  • BCD code
  • Gray code
  • XS-3 code

Answer: Gray code

Q.6. An 8-square eliminates

  • 2 variables
  • 3 variables
  • 4 variables
  • 8 variables   

Answer: 3 variables

Q.7. An 8-square is called

  • a pair
  • a quad
  • an octet
  • a cube 

Answer: an octet

Q.8. Uniform propagation delay is provided using

  • two level logic
  • multilevel logic
  • hybrid logic
  • high level logic 

Answer: two level logic

Q.9. Any variable appearing in the final expression is called a

  • literal
  • a real variable
  • final variable
  • variable 

Answer: literal

Q.10. The total number of 1s present in a term is called the

  • index
  • weight
  • logic level
  • term number 

Answer: index

Q.11. The combining of adjacent squares on a K-map containing 1s (or 0s) for the purpose of simplification of an SOP (or POS) expression is called

  • looping
  • squaring
  • charting
  • forming

Answer: looping

Q.12. The terms which cannot be combined further in the tabular method are called

  • implicants
  • prime implicants
  • essential prime implicants
  • selective prime implicants

Answer: prime implicants

Q.13. The implicants which will definitely occur in the final expression are called

  • Prime implicams
  • essential prime implicants  
  • selective prime implicants
  • edundant prime implicants

Answer: essential prime implicants

Q.14. The code used for labeling the cells of a K-map is

  • 8-4-2-1 binary  
  • hexadecimal
  • gray 
  • octal       

Answer: gray

Q.15. The number of cells in a 6 variable K-map is

  • 6
  • 12
  • 36
  • 64

Answer: 64

Q.16. In the Quine-McClusky method of minimization of the function f(A, B, C, D) the PI corresponding to -1 1- is

  • \overline{A}BC\overline{D}
  • BC
  • \overline{B}\overline{C}
  • A\overline{B}\overline{C}D

Answer: BC

Q.17. The Quine-McClusky method of minimization of a logic expression is a

  1. graphical method
  2. algebraic method
  3. tabular method
  4. a computer-oriented algorithm

The correct answers are

  • 3 and 4
  • 2 and 4
  • 1 and 3
  • 1 and 2

Answer: 3 and 4

Q.18. In simplification of a Boolean function of n variables, a group of 2m adjacent 1s leads to a term with

  • m – 1 literals less than the total number of variables
  • m + 1 literals less than the total number of variables
  • n + m literals
  • n – m literals

Answer: n – m literals

Q.19. The number of adjacent cells each cell in an n variable K-map can have is

  • n – 1
  • n
  • n + 1
  • 2n

Answer: n

Q.20. A 16-square eliminates

  • 2 variables
  • 3 variables
  • 4 variables
  • 8 variables

Answer: 4 variables

Q.21. In K-map simplification, a group of four adjacent 1s leads to a term with

  • one literal less than the total number of variables
  • two literals less than the total number of variables
  • three literals less than the total number of variables
  • four literals less than the total number of variables

Answer: two literals less than the total number of variables

Q.22. Minimization of logical expressions while designing digital systems helps in reducing

  • cost
  • space requirements
  • power requirements  
  • all of the above

Answer: all of the above

Q.23. The NAND-NAND realization is equivalent to

  • AND-NOT realization
  • AND-OR realization
  • OR-AND realization
  • NOT-OR realization

Answer: AND-OR realization

Q.24. The NOR-NOR realization is equivalent to

  • AND-OR realization
  • NOT-AND realization
  • OR-NOT realization
  • OR-AND realization   

Answer: OR-AND realization

Q.25. AND-OR realization of a combinational circuit is equivalent to

  • NAND-NOR realization
  • NAND-NAND realization  
  • NOR-NOR realization
  • NOR-NAND realization  

Answer: NAND-NAND realization

Q.26. OR-AND realization of a combinational circuit is equivalent to

  • NAND-NOR realization
  • NAND-NAND realization  
  • NOR-NAND realization
  • NOR-NOR realization

Answer: NOR-NOR realization

Q.27. For the design of a combinational circuit with four outputs using only NAND gates,the number of K-maps required for the simplification process is

  • 0
  • 1
  • 2
  • 4

Answer: 4

Q.28. The AND-OR realization of a combinational circuit requires three 3-input AND gates and one 3-input OR gate. This circuit can be designed using

  • four input NAND gates only
  • three 3-input OR gates and one 3-input AND gate
  • three 3-input NAND gates and one 3-input NOR gate
  • none of the above

Answer: four input NAND gates only

Leave a Reply

Your email address will not be published.