Scribd Logo
Upload

Welcome to Scribd!

  • Sem 2 0809

    Uploaded by

    Amirah Abdul Rahman
    20 views2 pages
    Using Boolean theorem, obtain the simplest Boolean expression for Z. Find the simplest Boolean expression of the combinational logic circuit in Figure Q6 using karnaugh map method.

    Original Description:

    Original Title

    sem 2 0809

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Using Boolean theorem, obtain the simplest Boolean expression for Z. Find the simplest Boolean expression of the combinational logic circuit in Figure Q6 using karnaugh map method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    20 views2 pages

    Sem 2 0809

    Uploaded by

    Amirah Abdul Rahman
    Using Boolean theorem, obtain the simplest Boolean expression for Z. Find the simplest Boolean expression of the combinational logic circuit in Figure Q6 using karnaugh map method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    FACULTY OF ELECTRICAL AND ELECTRONICS ENGINEERING UNIVERSITI TUN HUSSEIN ONN MALAYSIA

    DEPARTMENT OF ELECTRONICS ENGINEERING

    DIGITAL ELECTRONICS BEE2233

    TEST 1
    INSTRUCTIONS: ANSWER ALL QUESTION. CALCULATOR IS NOT ALLOWED. TEST DURATION: 1 HOUR.

    1.

    State and explain two (2) advantages of digital data transmission compared to analog data transmission. Nyata dan terangkan dua (2) kelebihan penghantaran data digit berbanding penghantaran data analog. (6 marks/ 6 markah)

    2.

    Convert BCD code 0011 1000 0101 0100 to hexadecimal. Show all steps. Tukarkan kod BCD 0011 1000 0101 0100 kepada nombor perenambelasan. Tunjukkan langkah kerja selengkapnya. (3 marks/ 3 markah)

    3.

    Convert the binary numbers 1011.0110 to decimal. Show all steps. Tukarkan nombor perduaan 1011.0110 kepada perpuluhan. Tunjukkan langkah kerja selengkapnya. (3 marks/ 3 markah)

    4.

    Using Boolean theorem, obtain the simplest Boolean expression for Z from the following Boolean expression. Dapatkan ungkapan Boolean termudah bagi Z dalam ungkapan Boolean berikut.

    Z = A B + A BCD + A BCD + A BCD


    (5 marks/ 5 markah) 5. Find the simplest Boolean expression of the combinational logic circuit in Figure Q6 using Karnaugh map method. Show all steps. Dapatkan ungkapan Boolean termudah bagi litar logik gabungan dalam rajah Q6 menggunakan teknik peta karnaugh. Tunjukkan semua langkah.

    Figure Q6/Rajah Q6 (8 marks/ 8 markah)

    You might also like