Sail E0 Webinar

MCQs

Total Questions : 37 | Page 1 of 4 pages
Question 1.  Determine the values of A, B, C, and D that make the sum term A+B+C+D equal to zero.
  1.    A = 1, B = 0, C = 0, D = 0
  2.    A = 1, B = 0, C = 1, D = 0
  3.    A = 0, B = 1, C = 0, D = 0
  4.    A = 0, B = 1, C = 0, D = 0
 Discuss Question
Answer: Option B. -> A = 1, B = 0, C = 1, D = 0
Question 2.  One of De Morgan's theorems states that X+Y=X.Y. Simply stated, this means that logically there is no difference between:
  1.    a NOR and an AND gate with inverted inputs
  2.    a NAND and an OR gate with inverted inputs
  3.    an AND and a NOR gate with inverted inputs
  4.    a NOR and a NAND gate with inverted inputs
 Discuss Question
Answer: Option A. -> a NOR and an AND gate with inverted inputs
Question 3.  Which of the following expressions is in the sum-of-products (SOP) form?
  1.    (A + B)(C + D)
  2.    (A)B(CD)
  3.    AB(CD)
  4.    AB + CD
 Discuss Question
Answer: Option D. -> AB + CD
Question 4.  The systematic reduction of logic circuits is accomplished by:
  1.    using Boolean algebra
  2.    symbolic reduction
  3.    TTL logic
  4.    using a truth table
 Discuss Question
Answer: Option A. -> using Boolean algebra
Question 5.  For the SOP expression A B C + ABC +A B C, how many 1s are in the truth table's output column?
  1.    1
  2.    2
  3.    3
  4.    5
 Discuss Question
Answer: Option C. -> 3
Question 6.  An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate.
  1.    NOT
  2.    OR
  3.    NOR
  4.    NAND
 Discuss Question
Answer: Option C. -> NOR
Question 7.  A truth table for the SOP expressionA B C + A B C + A B C has how many input combinations?
  1.    1
  2.    2
  3.    4
  4.    8
 Discuss Question
Answer: Option D. -> 8
Question 8.  What is the primary motivation for using Boolean algebra to simplify logic expressions?
  1.    It may make it easier to understand the overall function of the circuit.
  2.    It may reduce the number of gat
  3.    It may reduce the number of inputs requir
  4.    all of the above
 Discuss Question
Answer: Option D. -> all of the above
Question 9. . Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]
  1.    associative
  2.    commutative
  3.    Boolean
  4.    distributive
 Discuss Question
Answer: Option B. -> commutative
Question 10.  
How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)
  1.    1
  2.    2
  3.    4
  4.    5
 Discuss Question
Answer: Option D. -> 5

Latest Videos

Latest Test Papers