Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    CpE 315 Quiz 2 - Prelim 9-19-23 LOMUGDANG

    Uploaded by

    Jeanbe Lomugdang
    This document contains a quiz for a logic circuits and design course. It has multiple choice questions that ask the student to simplify Boolean expressions using K-maps and the tabulation method. It also asks the student to implement a Boolean function using only NAND gates in Logisim and attach a screenshot. The student is asked to write their simplified expressions and attach their work.

    Copyright:

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

    You might also like

    CpE 315 Quiz 2 - Prelim 9-19-23 LOMUGDANG

    Uploaded by

    Jeanbe Lomugdang
    11 views2 pages
    This document contains a quiz for a logic circuits and design course. It has multiple choice questions that ask the student to simplify Boolean expressions using K-maps and the tabulation method. It also asks the student to implement a Boolean function using only NAND gates in Logisim and attach a screenshot. The student is asked to write their simplified expressions and attach their work.

    Original Description:

    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 contains a quiz for a logic circuits and design course. It has multiple choice questions that ask the student to simplify Boolean expressions using K-maps and the tabulation method. It also asks the student to implement a Boolean function using only NAND gates in Logisim and attach a screenshot. The student is asked to write their simplified expressions and attach their work.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    11 views2 pages

    CpE 315 Quiz 2 - Prelim 9-19-23 LOMUGDANG

    Uploaded by

    Jeanbe Lomugdang
    This document contains a quiz for a logic circuits and design course. It has multiple choice questions that ask the student to simplify Boolean expressions using K-maps and the tabulation method. It also asks the student to implement a Boolean function using only NAND gates in Logisim and attach a screenshot. The student is asked to write their simplified expressions and attach their work.

    Copyright:

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

    CpE 315 – Logic Circuits and Design

    Quiz 2 Prelim

    Student Name: JEANBE A. LOMUGDANG BSCpE 3A


    Module 2 – Simplification of Boolean Functions
    M2-A. Simplify the Boolean expressions using K-Map. Place your simplified expression on the space
    provided below the expression. 8 points.
    1. F1 = A (A + B’)
    Answer: A____________________________________________________________________

    2. F2 = B’C’ + AB + BC’
    Answer: _AB + C’ _______________________________________________________________

    3. F3 (A, B, C, D) = ∑ (0, 1, 2, 6, 8, 9, 10)


    Answer: B’D’ + B’C’ + A’CD’ ______________________________________________________
    4. F4 (A, B, C, D, E) = ∑ (2, 6, 11, 12, 15, 18, 22, 27, 28, 31)
    Answer: BCD’E’ + B’DE’ + BDE ____________________________________________________

    M2-B. Simplify the Boolean expressions using the Tabulation method. Place your simplified expression on
    the space provided below the expression and a photo of your simplification process. 4 points.
    1. F5 (A, B, C, D) = ∑ (1, 3, 5, 7, 11, 15)
    Answer: __AD’ + CD _____________________________________________________________

    Simplification Process
    M2-C. Implement the Boolean function, F6 = (W + X)(Y + Z) using NAND gates only. Make use of the
    Logisim for the implementation and attach a screenshot of the diagram in the space provided. 4 points.

    You might also like