Digital System Design (Mc1406) Quiz 2                                   

10 Questions | Total Attempts: 107

SettingsSettingsSettings
Digital System Design (Mc1406) Quiz 2                                    - Quiz


Questions and Answers
  • 1. 
    Express the decimal number –37 as an 8-bit number in sign-magnitude.
    • A. 

      10100101

    • B. 

      00100101

    • C. 

      11011000

    • D. 

      11010001

  • 2. 
    Derive the Boolean expression for the logic circuit shown below: Which one do you like?
    • A. 

      C(A+B)DE

    • B. 

      [C(A+B)D+E

    • C. 

      [[C(A+B)D]E]

    • D. 

      ABCDE

  • 3. 
    If a 3-input NOR gate has eight input possibilities, how many of those possibilities will result in a HIGH output?
    • A. 

      1

    • B. 

      2

    • C. 

      7

    • D. 

      8

  • 4. 
    Convert the binary number 1001.00102 to decimal
    • A. 

      90.125

    • B. 

      9.125

    • C. 

      125

    • D. 

      12.5

  • 5. 
    What is the function of an enable input on a multiplexer chip?
    • A. 

       to apply Vcc

    • B. 

      To connect ground

    • C. 

      To active the entire chip

    • D. 

      To active one half of the chip

  • 6. 
    How many inputs are required for a 1-of-10 BCD decoder?
    • A. 

      4

    • B. 

      8

    • C. 

      10

    • D. 

      1

  • 7. 
    Select the statement that best describes the parity method of error detection.
    • A. 

      Parity checking is best suited for detecting double bit errors that occur during the transmission of codes from one location to another

    • B. 

      Parity checking is not suitable for detecting single bit errors in transmitted codes.

    • C. 

      Parity checking is best suitable for detecting single bit errors in transmitted codes.

    • D. 

      Parity checking is capable of detecting and correcting errors in transmitted codes.

  • 8. 
    Which statement below best describes a Karnaugh map?
    • A. 

      A Karnaugh map can be used to replace Boolean rules.

    • B. 

      The Karnaugh map eliminates the need for using NAND and NOR gates.

    • C. 

      Variable complements can be eliminated by using Karnaugh maps.

    • D. 

      Karnaugh maps provide a cookbook approach to simplifying Boolean expressions.

  • 9. 
    Which of the examples below expresses the distributive law of Boolean algebra?
    • A. 

      (A + B) + C = A + (B + C)

    • B. 

      A(B + C) = AB + AC

    • C. 

      A + (B + C) = AB + AC

    • D. 

      A(BC) = (AB) + C

  • 10. 
    How many 2-input NOR gates does it take to produce a 2-input NAND gate?
    • A. 

      1

    • B. 

      2

    • C. 

      3

    • D. 

      4

Back to Top Back to top