Scribd Logo
Upload

Welcome to Scribd!

  • Coa Mid 1

    Uploaded by

    Prasad Kaviti
    12 views1 page
    The document discusses several topics in digital logic including r's complement, DeMorgan's theorem, MIN and MAX terms, simplifying Boolean functions, full adders, multiplexers, decoders, and constructing instruction formats. It asks to define r's complement, represent numbers in signed 1's and 2's complement, explain universal gates and DeMorgan's theorem, differentiate MIN and MAX terms, simplify a Boolean function, discuss full adders with logic circuits, explain an 8x1 multiplexer with Boolean functions, discuss a 3x8 decoder with a truth table, and construct instruction formats for a given expression.

    Original Description:

    co question paper

    Original Title

    coa-mid-1

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses several topics in digital logic including r's complement, DeMorgan's theorem, MIN and MAX terms, simplifying Boolean functions, full adders, multiplexers, decoders, and constructing instruction formats. It asks to define r's complement, represent numbers in signed 1's and 2's complement, explain universal gates and DeMorgan's theorem, differentiate MIN and MAX terms, simplify a Boolean function, discuss full adders with logic circuits, explain an 8x1 multiplexer with Boolean functions, discuss a 3x8 decoder with a truth table, and construct instruction formats for a given expression.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views1 page

    Coa Mid 1

    Uploaded by

    Prasad Kaviti
    The document discusses several topics in digital logic including r's complement, DeMorgan's theorem, MIN and MAX terms, simplifying Boolean functions, full adders, multiplexers, decoders, and constructing instruction formats. It asks to define r's complement, represent numbers in signed 1's and 2's complement, explain universal gates and DeMorgan's theorem, differentiate MIN and MAX terms, simplify a Boolean function, discuss full adders with logic circuits, explain an 8x1 multiplexer with Boolean functions, discuss a 3x8 decoder with a truth table, and construct instruction formats for a given expression.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    1.

    A) Define r,(r-1)’s complement

    B) Represent number (-14) in signed-1’s complement and


    signed-2’complement .

    C) Explain Universal Gates

    D) Discuss DeMorgan's Theorem

    E) Differentiate MIN term and MAX term

    2.A)Simplify the following Boolean function


    F(A,B,C,D)= Σ(0,2,8,9,10,11,14,15)

    B)Discuss the combinational circuit Full Adder with logic circuit

    3.A)Explain 8×1 Multiplexer with Boolean function

    B)Discuss the 3×8 Decoder with truth table

    4.Construct instruction formats for the expression X=(A+B)*(C+D)

    You might also like