• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Combinational Circuits

Question 31

A ROM is used to store the table for multiplication of two 8-bit unsigned integers. The size of ROM required is  
  • 256 x 16
  • 64K x 8
  • 4K x 16
  • 64K x 16

Question 32

Consider the circuit given below which has a four bit binary number b3b2b1b0 as input and a five bit binary number d4d3d2d1d0 as output. The circuit implements: b_adder111               .
  • Binary to Hex conversion
  • Binary to BCD conversion
  • Binary to grey code conversion
  • Binary to radix-12 conversion

Question 33

Consider the circuit in below figure. f implements
  • (ABC)\' + A\'BC\' + ABC
  • A + B + C
  • A ⊕ B ⊕ C
  • AB + BC + CA

Question 34

A logic network has two data inputs A and B, and two control inputs C0 and C1. It implements the function F according to the following table. logiic         . Implement the circuit using one 4 to 1 Multiplexer, one 2-input Exclusive OR gate, one 2-input AND gate, one 2-input OR gate and one Inverter.

    Question 35

    The output of the following combinational circuit is F. q10 The value of F is:
    • P1+P\'2P3
    • P1+P\'2P\'3
    • P1+P2P\'3
    • P\'1+P2P3

    Question 36

    The output of the following combinational circuit is F. "q10 The value of F is :
    • P1+P\'2P3
    • P1+P\'2P\'3
    • P1+P2P\'3
    • P\'1+P2P3

    Question 37

    A 32 bit adder is formed by cascading 4 bit CLA adder. The gate delays (latency) for getting the sum bits is
    • 16
    • 18
    • 17
    • 19

    Question 38

    When two n-bit binary numbers are added the sum will contain at the most
    • n bits
    • (n + 3) bits
    • (n + 2) bits
    • (n + 1) bits

    Question 39

    The dynamic hazard problem occurs in
    • combinational circuit alone
    • sequential circuit only
    • Both (a) and (b)
    • None of the above

    Question 40

    The Excess-3 code is also called
    • Cyclic Redundancy Code
    • Weighted Code
    • Self-Complementing Code
    • Algebraic Code

    There are 55 questions to complete.

    Last Updated :
    Take a part in the ongoing discussion