Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Assignment - 2-AEC0301

    Uploaded by

    rajthakur8102
    This document contains an assignment sheet from the Department of Electronics and Communication Engineering at NOIDA Institute of Engineering and Technology. It includes 14 problems involving minimizing Boolean functions using K-maps and implementing combinational logic circuits using multiplexers, decoders, and other basic gates. Students are asked to minimize Boolean functions in sum of products and product of sums form, implement circuits for addition, subtraction, decoding, encoding, and binary-coded decimal conversion using multiplexers, decoders and other basic components. The assignment is due on October 20th and will be returned with feedback by October 25th.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Assignment - 2-AEC0301

    Uploaded by

    rajthakur8102
    20 views1 page
    This document contains an assignment sheet from the Department of Electronics and Communication Engineering at NOIDA Institute of Engineering and Technology. It includes 14 problems involving minimizing Boolean functions using K-maps and implementing combinational logic circuits using multiplexers, decoders, and other basic gates. Students are asked to minimize Boolean functions in sum of products and product of sums form, implement circuits for addition, subtraction, decoding, encoding, and binary-coded decimal conversion using multiplexers, decoders and other basic components. The assignment is due on October 20th and will be returned with feedback by October 25th.

    Original Description:

    noice

    Original Title

    Assignment -2-AEC0301

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains an assignment sheet from the Department of Electronics and Communication Engineering at NOIDA Institute of Engineering and Technology. It includes 14 problems involving minimizing Boolean functions using K-maps and implementing combinational logic circuits using multiplexers, decoders, and other basic gates. Students are asked to minimize Boolean functions in sum of products and product of sums form, implement circuits for addition, subtraction, decoding, encoding, and binary-coded decimal conversion using multiplexers, decoders and other basic components. The assignment is due on October 20th and will be returned with feedback by October 25th.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    20 views1 page

    Assignment - 2-AEC0301

    Uploaded by

    rajthakur8102
    This document contains an assignment sheet from the Department of Electronics and Communication Engineering at NOIDA Institute of Engineering and Technology. It includes 14 problems involving minimizing Boolean functions using K-maps and implementing combinational logic circuits using multiplexers, decoders, and other basic gates. Students are asked to minimize Boolean functions in sum of products and product of sums form, implement circuits for addition, subtraction, decoding, encoding, and binary-coded decimal conversion using multiplexers, decoders and other basic components. The assignment is due on October 20th and will be returned with feedback by October 25th.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY, GREATER NOIDA

    Department of Electronics & Communication Engineering


    Accredited by NBA and NAAC Approved by AICTE and Affiliated to Dr. A.P.J. Abdul Kalam Tech. University, UP

    BTECH-ECE-SEMESTER (III)
    UNIT:- 2

    ASSIGNMENT SHEET No.- 2

    Subject Name: - DIGITAL SYSTEM DESIGN


    Name of Course Coordinator:- Dr V K Pandey
    Subject Code: - AEC- 0301

    Checked & Return Date 25.10.23 Submission Date: - 20-10-23

    A.
    1. F = A'CD' + A'BC'D + ABC'D' + ABCD' + ABC. Minimize using K-map.
    2. Minimize the function using k-map in SOP form : F(A,B,C,D) = Σ (0,2,8,7) + d(10)
    3. Minimize the function using k-map in SOP form :F(A,B,C,D) = Π (0,1,2,6,8,10,11,12)
    4. Minimize the function using k-map in POS form: F(A,B,C,D) = Π (0,2,7,11,15)
    5. Minimize the function using k-map in SOP form:
    6. F(A,B,C,D) = Π (4,5,6,7,12,13,14,15)
    7. Minimize the function using k-map in SOP form: F(A,B,C,D) = Σ (1,3,5,7,9,11)
    8. Minimize the function using k-map in SOP form: F(A,B,C,D) = Σ (0,12,14) + d(2,4,6)
    9. Minimize the function using k-map in SOP form: F(A,B,C,D) = Σ (3,4,6,15) + d(5,7,11,14)
    10. Minimize the function using k-map in POS form: F(A,B,C,D) = Π (1,9) + d(0,2,3,4,5,6,7,8)
    11. F (A, B,C,D)= ∑(2,5, 6,12, 13,14,15) + d (0,4) minimize using K-MAP in SOP form.
    12. F (A, B, C, D, E)= ∑(0,1,9,15, 24,29,30) + d (8,11,31) minimize using Q-M method.
    13. Simplify the following Boolean function using K-map
    Y = ∑m(0,1,3,5,6,7,9,11,16,18,19,20,21,22,24,26)
    B. 1. Combinational circuit is defined by F (A,B,C)= ∑(0,3,5,6,7).Implement the circuit using
    (a) 4:1 MUX (b) 8:1 MUX
    2. Design 4:16 decoder using 2:4 decoders.
    3. Implement F = ABD’ + BC + A’C’D using 4:1 multiplexer.
    4. Design 16:1 MUX using 2:1 MUX.
    5. Design a Combinational circuit with mode control that can perform 4 bit addition and
    subtraction.When Mode control = 0 it is an adder and when Mode control = 1 it is a subtractor.
    6. Implement full Adder and subtractor using only NAND and NOR gates respectively.
    7. Design a combinational circuit whose input is a 3-bit number and whose output is the 2’s
    complement of the number.
    8. Implement full adder using: a. 4:1 Multiplexers b. Decoder.
    9. Design a combinational circuit that converts a decimal digit from 8, 4, -2, -1 code to BCD.
    10. Write a short note on the followings:
    a. 2-bit Magnitude Comparator b. Priority Encoder
    c. Serial Adder/Barrel Shifter d. 1-digit BCD Adder

    You might also like