logo

CuriousTab

CuriousTab

Discussion

Home ‣ Electronics ‣ Number Systems and Codes Comments
  • Question

  • What is the resultant binary of the decimal problem 49 + 1 =?


  • Options
  • A. 01010101
  • B. 00110101
  • C. 00110010
  • D. 00110001

  • Correct Answer
  • 00110010 

    • Number Systems and Codes problems

    Search Results

    • 1. What is the difference between binary coding and binary coded decimal?

    • Options
    • A. Binary coding is pure binary.
    • B. BCD is pure binary.
    • C. Binary coding has a decimal format.
    • D. BCD has no decimal format.
      • Discuss
    • 2. Convert 110010012 (binary) to decimal.

    • Options
    • A. 201
    • B. 2001
    • C. 20
    • D. 210
      • Discuss
    • 3. Convert the binary number 1011010 to hexadecimal.

    • Options
    • A. 5B
    • B. 5F
    • C. 5A
    • D. 5C
      • Discuss
    • 4. Sample-and-hold circuits in ADCs are designed to:

    • Options
    • A. sample and hold the output of the binary counter during the conversion process
    • B. stabilize the ADCs threshold voltage during the conversion process
    • C. stabilize the input analog signal during the conversion process
    • D. sample and hold the ADC staircase waveform during the conversion process
      • Discuss
    • 5. Base 10 refers to which number system?

    • Options
    • A. binary coded decimal
    • B. decimal
    • C. octal
    • D. hexadecimal
      • Discuss
    • 6. The Boolean expression is logically equivalent to what single gate?

    • Options
    • A. NAND
    • B. NOR
    • C. AND
    • D. OR
      • Discuss
    • 7. Which statement below best describes a Karnaugh map?

    • Options
    • A. It is simply a rearranged truth table.
    • B. The Karnaugh map eliminates the need for using NAND and NOR gates.
    • C. Variable complements can be eliminated by using Karnaugh maps.
    • D. A Karnaugh map can be used to replace Boolean rules.
      • Discuss
    • 8. The systematic reduction of logic circuits is accomplished by:

    • Options
    • A. symbolic reduction
    • B. TTL logic
    • C. using Boolean algebra
    • D. using a truth table
      • Discuss
    • 9. Which of the examples below expresses the commutative law of multiplication?

    • Options
    • A. A + B = B + A
    • B. A ? B = B + A
    • C. A ? (B ? C) = (A ? B) ? C
    • D. A ? B = B ? A
      • Discuss
    • 10. Which output expression might indicate a product-of-sums circuit construction?

    • Options
    • A.
    • B.
    • C.
    • D.
      • Discuss

    Comments

    There are no comments.
Enter a new Comment




Aptitude

Engineering

Programming

Reasoning

Links

Copyright ©CuriousTab. All rights reserved.