Scribd
Upload
93 views5 pages

Ett 304: Digital Electronincs

This document outlines the structure and content of an exam for a digital electronics course. The exam contains two sections - Section A contains one question that must be answered, and Section B contains seven optional questions from which four must be selected. The summary focuses on providing a high-level overview of the exam structure and content rather than summarizing each question.

Uploaded by

francismihayo1
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
93 views5 pages

Ett 304: Digital Electronincs

This document outlines the structure and content of an exam for a digital electronics course. The exam contains two sections - Section A contains one question that must be answered, and Section B contains seven optional questions from which four must be selected. The summary focuses on providing a high-level overview of the exam structure and content rather than summarizing each question.

Uploaded by

francismihayo1
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

ETT 304: DIGITAL ELECTRONINCS.

TIME: 1:30 Hours December, 2010

1. This paper consists of sections A and B. Section A has ONE question, section B has
SEVEN (7) questions. Attempt all questions in section A, and any FOUR (4)
questions in section B. All questions in section A and B carry equal marks.
2. You are not allowed to write anything in the question paper.
3. Write in black/blue ink and draw diagrams in pencil.
4. Write clearly.
5. Phones are not allowed in the examination room.
Section A: (Answer All Questions)

Question 1: (10 marks)

i. Which of the following logical operations is represented by the + sign in Boolean


algebra?

(a) Inversion (b) AND.

(c) OR (d) Complementation.

ii. The format used to present the logic output for the various combinations of logic
inputs to a gate is called.

(a) Boolean constant. (b) Boolean variable.

(b) Truth table. (d) Input logic function.

iii. Logically, the output of a NOR gate would have the same Boolean expression as;

(a) NAND gate immediately followed by an inverter.

(b) OR gate immediately followed by an inverter.

(c) AND gate immediately followed by an inverter.

(d) NOR gate immediately followed by an inverter.

iv. A 2-input NOR gate is equivalent to……………………………..

(a) Negative-OR gate.

(b) Negative-AND gate.

(c) Negative-NAND gate.

(d) None of the above


v. When AB are the inputs to a NAND gate, according to De Morgan’s theorem, the
output expression could be

(a) X=A+B.

(b) X= AB .

(c) X= (A)(B).

(d) X=AB

vi. The Boolean expression X= A+B+C is logically equivalent to what single gate?

(a) NAND (b) NOR.

(c) AND (d) OR.

vii. The output of an exclusive –NOR gate is 1. Which input combination is correct?

(a) A=1,B=0 (b) A=0,B=1

(c) A=0, B=0 (d) None of the above.

viii. Given the function F(X,Y,Z) = XZ + Z(X'+ XY), the equivalent most simplified
Boolean representation for F is:
(a) Z + YZ
(b) Z + XYZ
(c) XZ
(d) X + YZ
(e) None of the above

ix. Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF


yields which of the following results?

(a) ABCDEF
(b) AB
(c) AB + CD + EF
(d) A+B+C+D+E+F
(e) A + B(C+D(E+F))

x. An equivalent representation for the Boolean expression A' + 1 is

(a) A
(b) A
(c) 1
(d) 0
SECTION B: Answer any four question only

Question 2: (20 marks)

(a) There are exists MANY basic laws of Boolean algebra. State ANY SIX laws that you
know;
(b) Use ANY laws that you know to simplify the following logic expressions
i. C =  (AB) + (AB) 
 
ii. X = (A+C)(A+ABC)

(c) Draw the K-Maps for two- input OR, XNOR and XOR gates.

Question 3: (20marks)

(a) Using Boolean algebra show that the two forms of DeMorgan’s theorem are
equivalent.
(b). By using Boolean algebra, prove that the following equation is correct:
(A+B)(A+C)(B+C)=(A+B)(A+C)
(c). Use Boolean algebra to simplify the following expression.
F=ABCD+ABCD+ABC+ACD+ACD

Question 4: (20 marks)

Use the Karnaugh Map to simplify the following.

i. X = ABC+ABC+ABC+ABC
ii. X = ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD+ABCD

Question 5: (20 marks).

Given the following equation:

F=A+C +A+B+C
(i) Derive the logic equation for F in minimal form;

(ii) Draw the circuit once using AND and OR gates and

(iii) Draw the circuit once using only NAND gates;

You should not assume that the complements of A, B, and C are available.

Question 6: (20 marks).

i. Prove or disprove the following proposition.


Let A and B be the switching-algebra variables. Then A.B=0 and A+B=1 implies that
A=B .
ii. According to De-Morgan’s theorem, the complement of X+Y.Z = X.Y+Z . Yet
both functions are 1 for XYZ=110. How can both a function and its complement
be 1 for the same input combination? What’s wrong here?

Question 7: (20 marks).

(a) Explain the properties of NAND gates, and use NAND gate to generate

i. AND gate.

ii. OR gate.

iii. NOR gate.

(b) For each case, in (a) draw the symbol diagram, and explain the functions for each
system with the help of truth table for each.

(c) Re -do question (a) by using NOR gates.

You might also like