Description
It is expected that answers to assignments are either typed or written *extremely* neatly. In all cases, the Karnaugh Maps formats below *must* be used, either copied and edited to add the required bits and circles or printed and written on. Circuits much be drawn using a circuit drawing program.
1. Determine the radix r given that (2362)r = (36D)16 (show all your work).
2. Show the bit configuration that represents the decimal number 251 in
a. Binary
b. BCD
c. ASCII (7 bit)
d. ASCII with even parity
3. Simplify the following expressions, using Boolean algebra, into minimum sum of products form. Show each Boolean Algebra rule used in the simplification.
a. (𝐷+𝐶̅)(𝐴+𝐶)(𝐷+𝐵)(𝐶+𝐷)
b. (𝐴+𝐷+𝐸)(𝐴̅+𝐵+𝐶̅)(𝐴̅+𝐶+𝐷̅)(𝐴+𝐶̅)
4. Use Karnaugh maps to simplify the following Boolean expressions, giving the result in Sum of Products form:
a. 𝐴 𝐵 𝐶+𝐵𝐶 𝐷+𝐵𝐶̅𝐷+𝐴𝐵 𝐷̅+𝐴𝐶𝐷̅+𝐵𝐶𝐷
b. F(A,B,C) = (𝐴 𝐶+𝐴 𝐵𝐶+ 𝐵𝐶+𝐴𝐵𝐶)
c. F(W,X,Y,Z) = Σ𝑚(0,2,6,7,8,12)
d. F(w,x,y,z) = Σ𝑚(3, 4, 9, 13) + d(1, 5, 7, 14, 15).
5. Use Karnaugh maps to simplify the following Boolean expressions, giving the result in Product of Sums form.
a. F(W,X,Y,Z) = (𝑋+𝑌+𝑍)(𝑊+𝑌+𝑍̅)(𝑊+𝑌+𝑍)(𝑊+𝑋+𝑍̅)(𝑊̅+𝑋+𝑌)
b. F(w,x,y,z) = Σ𝑚(0,1,4,6,8,10,12,13,14)
c. F(w,x,y,z) = Σ𝑚(0,2,7,9,10,13,14,15)
d. F(w,x,y,z) = Σ𝑚(1, 3, 7, 13) + d(5,6,8, 9, 12, 14)
6. Design circuits as specified below. In each case assume that all variables are available in both true and inverted form (i.e., there is no need to put inverters on the main inputs). Gates may have any fan-in up to 4. More marks will be awarded for circuits that use fewer gates.
a. a two level circuit for b(c + a̅) + b̅(c + d) +a̅d using only AND, OR gates;
b. a circuit for a̅bc + a̅b̅d + a̅c using NAND gates only
c. a circuit for ab̅c̅ + a̅cd + ab̅c + abd using NOR gates only.
7. A switching network has 3 inputs (w, x and y) and 2 outputs (a and b). The output variables, a and b, represent the first and second bits, respectively of a binary number, N. N equals the total number of the inputs which are “0”. For example, if w=1, x=0. y=1, then a=0, b=1, representing 1 “0” input. A second example, if w=1, x=0. y=0, then a=1, b=0, representing 2 “0” inputs.
a. Find the minterm expansion for a and b. Express the answer in abbreviated notation (with or π).
b. Find the maxterm expansion for a and for b. Express the answer in abbreviated notation (with or π).
c. Provide a circuit, using AND and OR gates for this switching network
