1. Part a) i)
2. Part a) ii)
3. Part a) iii)
4. Part b) i)
5. Part b) ii)
6. Part b) iii)
7. Part c)
8. Part d) i)
9. Part d) ii)
10. Part d) iii)

Part a) i)

        _______________________
       |        4-to-1         |
D0 ----|      Multiplexer      |
       |                       |
D1 ----|                       |---> Output
       |                       |
D2 ----|                       |
       |                       |
D3 ----|_______________________|
              |         |
              |         |
              |         |
              |         |
              S1        S0

Part a) ii)

Set the select inputlines to 01 to select the 2^nd line, and when input from the 4^th line is needed after 1 second (i.e i3), set the select input lines to 11

Part a) iii)

– It always exists in 1 of 2 stable states.
-It can retain its state to achieve storage (in the case the set goes from 1 to 0)

Can be used in RAM Arrays (to implement 1 bit storage) or to Implement a Ripple Counter

Part b) i)

1101

(First bit is 1 for to represent a negative value,

working for 5₁₀ to binary :

       2 | 5  

       2 |2  remainder 1

       2 |1  remainder 0 

            0  remainder 1

i.e 5₁₀  = 101₂

combining the result we get 1101₂

)

Part b) ii)

1010 (flipped bits of 0101)

Part b) iii)

1010 +1 = 1011

Part c)

(Show binary-decimal conversions)

For an unbiased exponent and unnormalized mantissa:

sign is -ve, Exponent = 2, Mantissa= 0101

i.e -0.0101 x 2_­² = -1.01

-1.01₂   =  (-1 x 2⁰)+ (0 x 2^-1)+ (1 x 2^-2)

          = -1 + 0+ ¼

          = -1.25

Part d) i)

Not (Unary operator)

x	Not X
0	1
1	0

Part d) ii)

AND

x	Y	X AND Y
0	0	0
0	1	0
1	0	0
1	1	1

Part d) iii)

OR

x	y	X OR Y
0	0	0
0	1	1
1	0	1
1	1	1

---

© 2023  Vedesh Kungebeharry. All rights reserved.