Sie sind auf Seite 1von 1

EED206 DIGITAL ELECTRONICS Monsoon 2016

Problem Set 3
To be submitted in the tutorials starting on Tuesday, September 06

1– 8. Chapter 2 of Text-book: Problems 2.2, 2.4, 2.15, 2.17, 2.19, 2.22, 2.30, 2.31.

9-13. Chapter 3 of the text-book: Problems 3.4, 3.6, 3.8, 3.10, 3.13.
14. An intelligence agency uses a special code for storing numerical data for the sake of data security,
representing each 4-bit number (N) by a 4-bit binary code PQRS according to the following scheme:
For 4  N  0, PQRS = 13 – N, e.g. if N = 2, PQRS = 1011,
for 11  N  5, PQRS = N – 3, e.g. if N = 6, PQRS = 0011,
for 13  N  12, PQRS = N + 2, e.g. if N = 12, PQRS = 1110, and
for 15  N  14, PQRS = 15 – N, e.g. if N = 15, PQRS = 0000.
A DECODER has to be designed for obtaining the normal binary representation B3B2B1B0 of N from
its PQRS representation.
(a) Construct the K-maps for the 4 bits B3, B2, B1, B0 in terms of P, Q, R, S.
(b) Obtain the Boolean expressions for B3, B2, B1, B0 in the sum of products form.
15. A combinational circuit has to be designed for performing the operation z = (x + 1)y + 2, where both
x and y are positive integers in the range 03 and are represented by 2-bit binary codes X1X0 and
Y1Y0 respectively. z is represented by the four-bit binary code Z3Z2Z1Z0.
(a) Construct Karnaugh maps for the 4 output bits Z3, Z2, Z1, Z0.
(b) Obtain the minimal Boolean expressions for Z3, Z2, Z1, Z0 in the sum of products form.