1. 1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam

2. 2 1. Identify each of these logic gates by name, and complete their respective truth tables:

3. 3 2. Below given are some of boolean algebra rules used for simplification. (a) Draw equivalent figures for rules (5) and (8). (b) Write the rules (6) and (8).

4. 4 3. You have designed a logic circuit and expressed it as: (a) Sketch the logic circuit corresponding to the given logic function. (b) Write down the truth table for the given logic expression.

5. 5 4. Label the inputs for the below given logic circuit and write boolean expression for it.

6. 6 5. A Karnaugh map is nothing more than a special form of truth table, useful for reducing logic functions into minimal Boolean expressions. Below shown is a truth table for a specific three-input logic circuit. Complete the given Karnaugh map, according to the values found in the given truth table.

7. 7 6. Consider the Boolean function X defined by the truth table below. Derive: (a)Standard sum of products (SOP) expression for X ( (= sum of minterms) (b) Standard product of sums (POS) expression for X (= product of maxterms)

8. 8 7. Use a Karnaugh map to simplify the Boolean function X defined by the truth table below into minimum SOP form.

9. 9 8. Write the Boolean expression and truth table for the given logic circuit. Is it really equivalent of XOR gate? Why?

10. 10 9. Try to write expression for the given karnaugh map

11. 11 Y= A’.D’ + A.D + A’.B.C 10. Try to write expression for the given karnaugh map

12. 12 11. (in case if we have seen the topic in the course) The diagram below shows the operation of a hexadecimal-to-7-segment decoder. Use a Karnaugh map to simplify the Boolean expression for segment a. Assume that inputs not shown in the table below never occur (i.e. we don’t care what segments are illuminated in such cases).