Scribd Logo
Upload

Welcome to Scribd!

  • BANAL MIGUEL JOHN L. Final Project in AR101 Architecture and Organization

    Uploaded by

    Hagad, Angelica BA 2A
    6 views4 pages
    This document outlines the requirements for Part I of a final project in an architecture and organization course. It involves completing a binary-coded decimal to 7-segment display decoder truth table, deriving boolean equations for the decoder outputs in both unsimplified and simplified forms, drawing the corresponding unsimplified and simplified logic circuits, and implementing the circuits in Tinkercad for a 2-input binary system with additional points possible for a 3-input binary implementation. The project will be scored out of 100 total points.

    Original Description:

    computer

    Original Title

    BANAL MIGUEL JOHN L. Final Project in AR101 Architecture and Organization (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the requirements for Part I of a final project in an architecture and organization course. It involves completing a binary-coded decimal to 7-segment display decoder truth table, deriving boolean equations for the decoder outputs in both unsimplified and simplified forms, drawing the corresponding unsimplified and simplified logic circuits, and implementing the circuits in Tinkercad for a 2-input binary system with additional points possible for a 3-input binary implementation. The project will be scored out of 100 total points.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views4 pages

    BANAL MIGUEL JOHN L. Final Project in AR101 Architecture and Organization

    Uploaded by

    Hagad, Angelica BA 2A
    This document outlines the requirements for Part I of a final project in an architecture and organization course. It involves completing a binary-coded decimal to 7-segment display decoder truth table, deriving boolean equations for the decoder outputs in both unsimplified and simplified forms, drawing the corresponding unsimplified and simplified logic circuits, and implementing the circuits in Tinkercad for a 2-input binary system with additional points possible for a 3-input binary implementation. The project will be scored out of 100 total points.

    Copyright:

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

    Final Project in AR101-Architecture and Organization

    Part I (Written - 2-Input Binary) - Total Score: 100 pts

    Complete/Fill-out the Binary-Coded Decimal (BCD) to 7-Segment Decoder Truth-Table (20


    pts)

    Binary Inputs Decoder Outputs


    7-Segment Display
    Outputs
    X Y A B C D E F G

    0 0 1 1 1 1 1 1 0 0

    0 1 0 1 1 0 0 0 0 1

    1 0 1 1 0 1 1 0 1 2

    1 1 1 1 1 1 0 0 1 3
    Boolean Equation for the Decoder Outputs (Unsimplified). (20 pts)

    Decoder Outputs Boolean Equation

    A X’Y’ + XY’ + XY

    B X’Y’ + X’Y + XY’ + XY

    C X’Y’ + X’Y + XY

    D X’Y’ + XY’ + XY

    E X’Y’ + XY’

    F X’Y’

    G XY’ + XY

    Draw the Unsimplified Logic Circuit (20 pts)


    Boolean Equation for the Decoder Outputs (Simplified) (20 pts)

    Decoder Outputs Boolean Equation

    A X+Y’

    B 1

    C X’+Y

    D X+Y’

    E Y'

    F X’ + Y’

    G X

    Draw the Simplified Logic Circuit (20 pts)


    Part I (Tinkercad) - Total Score: 100 pts

    Scoring System

    Logic Circuit Grade

    No Logic Circuit 0 point

    Incomplete / With Error (2-Binary Input) 20 points

    Complete / Fully-Functional (2-Binary Input) 50 points

    Complete / Fully-Functional (2-Binary Input) and


    70 points
    Incomplete / With Error (3-Binary Input)

    Complete / Fully-Functional (2-Binary Input) and


    100 points
    Complete / Fully-Functional (3-Binary Input)

    You might also like