Digital Electronics-Boolean Algebra and Logic Simplification

Digital Electronics-Boolean Algebra and Logic Simplification
31. The binary value of 1010 is converted to the product term .
  • TRUE
  • FALSE
Show Answer
32. Most Boolean reductions result in an equation in only one form.
  • TRUE
  • FALSE
Show Answer
33. A Karnaugh map is similar to a truth table because it presents all the possible values of input variables and the resulting output of each value.
  • TRUE
  • FALSE
Show Answer
34. The process of reduction or simplification of combinational logic circuits increases the cost of the circuit.
  • TRUE
  • FALSE
Show Answer
35. By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
  • TRUE
  • FALSE
Show Answer
36. Five-variable Karnaugh maps are impossible.
  • TRUE
  • FALSE
Show Answer
37. If you need a NAND, an AND, and an inverter you would purchase a 7400 IC.
  • TRUE
  • FALSE
Show Answer
38. The systematic reduction of logic circuits is performed using Boolean algebra.
  • TRUE
  • FALSE
Show Answer
39. CPLD software can be used to design original circuits that prove the Boolean rules and laws.
  • TRUE
  • FALSE
Show Answer
40. A Karnaugh map is similar to a truth table.
  • TRUE
  • FALSE
Show Answer
Digital Electronics
Questions and Answers for Competitive Exams Various Entrance Test