Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Eed 213 Test 1 2023

    Uploaded by

    thutomopako
    DIGITAL TEST

    Copyright:

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

    Eed 213 Test 1 2023

    Uploaded by

    thutomopako
    13 views3 pages
    DIGITAL TEST

    Original Title

    eed 213 test 1 2023

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    DIGITAL TEST

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views3 pages

    Eed 213 Test 1 2023

    Uploaded by

    thutomopako
    DIGITAL TEST

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    DEPARTMENT OF ELECTRICAL AND ELECTRONICS

    DIGITAL ELECTRONICS (EED 213) TEST 1

    DATE: 05 OCT 2023 TIME: 1030 DURATION: 90 MIN

    INTRUCTIONS
     Answer all questions
     Show all calculations where necessary
     Ensure diagrams are well labelled and tidy.
     Copying of any form will not be tolerated
     Calculators are not allowed
     This paper carries a total of 60 marks

    FULL NAMES: ____________________

    STUDENT ID: _____________________


    QUESTION 1 [10 MARKS]
    Number systems
    a) Express 173 in the following forms (4 marks)
    i. ( )2
    ii. ( )8
    iii. ( )16
    iv. ( )BCD
    b) Write 2’s complement for x= (-3.5)10 and y= (-2.25)10 (4 marks)
    c) What is two’s compliment representation (11011011)2 converted to an
    integer in decimal system? (2 marks)

    QUESTION 2 [10 MARKS]


    Logic gates
    a) Complete the truth table below for different logic operations. (4 marks)

    X1 X2 X3 X1.X2.X3 X1 + X2+ X3 X1 ⊕ X2 X1 X2 + X3X2


    0 0 0
    0 0 1
    0 1 0
    0 1 1
    1 0 0
    1 0 1
    1 1 0
    1 1 1

    b) Differentiate between Exclusive OR gate and an Exclusive NOR gate (2 marks)


    c) Design a circuit that has the function below. (4 marks)

    Z = (A + B).C
    QUESTION 3 [10 marks]
    Boolean Algebra/simplification
    a) Consider the function
    f (x1, x2, x3) = ∑m(2, 3, 4, 6, 7)
    i. Derive the canonical SOP expression (2 marks)
    ii. Simplify the expression from your answer above using identities (2 marks)
    b) A circuit that controls a given digital system has three inputs x1, x2 and x3.
    It has to recognize three different conditions:
     Condition A is true is x3 is true and either x1 is true or x2 is false
     Condition B is true is x1 is true and either x2 or x3 is false
     Condition C is true is x2 is true and either x1 is true or x3 is false
    The control circuit must produce an output of 1 if at least two of the conditions
    A, B, and C are true. Design the simplest circuit that can be used for this purpose. (8 marks)
    QUESTION 4 [20 MARKS]
    Simplification of logic f
    a) Two functions f1 and f2 of the same functions are to be implemented.
    The minimum-cost of these functions are depicted below.

    i. Derive the simplified functions f1 and f2 (4 marks)


    ii. Draw the combined circuit for f1 and f2 (6 marks)
    b) Plot the following function on k – map and determine minterms and
    Maxterms. f ( A, B, C , D)  ( A  C )(B  C )(B  C  D) (10 marks)

    QUESTION 5 (10 MARKS)


    Functions of combinational logic f
    a) Define a hazard and give at least 2 types of hazards. (3 marks)
    b) Differentiate between a decoder and an encoder (2 marks)
    c) Differentiate between multiplexer and a DE-multiplexer (2 marks)
    d) For the full-adder shown, assume the input bits are as shown with A = 0,
    B = 0, Cin = 1.

    The Sum and Cout will be? (1 mark)


    e) Define a full adder. (1 mark)
    f) Explain what cascading is. (1 mark)

    You might also like