Vous êtes sur la page 1sur 3 KIMATHI UNIVERSITY COLLEGE OF TECHNOLOGY

University Examinations 2010/2011

SECOND YEAR SUPPLEMENTARY/SPECIAL EXAMINATION FOR THE DEGREE OF BACHELOR OF SCIENCE IN COMPUTER SCIENCE/ INFORMATION TECHNOLOGY

ICS 2205: Digital Logic

DATE: 10 th November 2010

TIME: 8.30 am 10.30 am

Instructions: Answer Question 1 and Any Other Two.

INSTRUCTIONS

Answer question one and any other two questions Question one

 (a) (i) Explain the main feature of Gray code which is different to ordinary binary code? (2marks) (b) ((i) Drive the Boolean equation for the circuit below (2marks) (ii) use Boolean algebra to simplify the equation of (b i) above (6marks) (iii) Implement the minimized circuit in (b ii) above using basic gates. (4marks)

Page 1 of 3

• (c) Explain what you understand by the following terms: Standard sum of

(i)

products form (SOP) and Standard product of sums form (POS) (4 marks) (ii) Implement the POS expression (A + B)(B + C + D) (A + C) using

NAND gates only

(4 marks)

• (d) With the aid of digital logic circuits show how the NOR gates can

used to implement the AND, OR and NAND functions

(5 marks)

• (e) Using truth table explains the operation of an EX-OR gate and draw

symbol

(3marks)

Question 2 A mission control systems uses four indication lights A, B, C to monitor the performance of its fuel combustion, it required that a warning buzzer is to sound when the following conditions occur.

• 1. A and B are on

• 2. A, B and C are on

• 3. B, on C are on

• 4. A and C are down

(a)

(i)

Represent the above conditions of the system in a truth table

(3marks)

(ii)

Drive the Boolean equation for output from the resulting truth

table in (a i) above

(4marks)

(b)

Simplify the above Boolean expression

(5marks)

(c)

(i)

Explain the advantages of edge triggered flip-flops over the

level triggered flip-flops.

(ii)

(2 marks)

Describe the operation of D- Latch

(6 marks)

Question

3

• (a) With the aid of a truth table drive the expression for the sum

(i)

and carry of a full Adder

(4 marks)

(ii)

Reduce the expressions in (i) using Boolean algebra and then

Implement the logic circuit using basic gates

(7 marks)

• (b) the

With

aid

of block diagram

Show how

a

can

be

implemented from half adders

(6 marks)

• (c) the logic circuit and the truth table of a S-R flip flop using

Sketch

NOR gates

(3marks)

Page 2 of 3

Question

4

• (a) bit Gray

(i) Design

a three

code

to

binary code converter and

implement the circuit using exclusive-OR gates only (8 marks)

(ii) With

the

aid

of

a block diagram, describe the operation of a

 1-of-4 multiplexer. (6marks) (b) State the applications of following digital logic circuits: (i) Encoders (ii) Decoders (iii) Ring counter (3 marks) (c) State limitations of the ripple through (asynchronous) counters. (3 marks)

Question

5 • (a) Use Boolean algebra proof that

(i)

(3marks)

(ii)

Convert the following binary numbers into gray code and from

gray to binary

(2marks)

Binary numbers

Gray code

1101111

1001101

1010101

1111001

• (b) With aid of an appropriate block and timing diagrams diagram s

describe how 4 bit serial shift register can be loaded with the

binary data 1011

(8marks)

• (c) Use K-map or otherwise to simplify the logic diagram below.

(i) (5marks) (ii) Draw simplified logic diagram (2 marks)

Page 3 of 3