B1 SLOT 24-02-2017

Forenoon

School of Computer Science & Engineering

Continuous Assessment Test – I
CSE1003-Digital Logic and Design
Time: 1:30 Hrs Max.Marks:50
Answers ALL the questions (10×5=50 Marks)
1. a) How many ones are there in the number AB98 in base 13? [2]
Solution : ((13*13*13*10) + (13*13*11) + 13*9) + 8) = 23954
b) Perform the given operation on the following numbers without converting [3]
them into decimal.
(i) (15F)16 + (A7)16 = (206)16
(ii) 100112-100012 =(10)2
(iii) What is the value of b if =

√41 = 5

Since the highest digit used is 5, then it has to be at least a base 6 and 41 = 25 in base 10.

So we have an unknown base with a known result:

25 = 4 *b + 1

solving for b:

24 = 4b
b=6

2. Simplify the following Boolean functions to a minimum number of literals and draw [5]
the logic circuit for the minimized expression.
F(A,B,C) = [(A'+B)(AB+C)+ABA'+A'B'C+(A+B)(A'+C)]'
Solution

1|Pa g e
 B1 SLOT 24-02-2017
Forenoon

3. John and Jane Doe have two children, Joe and Sue. When eating out they will go to a [5]
restaurant that serves only hamburgers or one that serves only chicken. Before going
out, the family votes to decide on the restaurant, The majority wins, except when
Mom and Dad agree, and in that case they win. Ant other tie votes produce a trip
to the chicken restaurant. We wish to design a logic circuit that will automatically
select the restaurant when everyone votes.

4. Find the minimum equivalent circuit for the one shown below: [5]

Solution

2|Pa g e
 B1 SLOT 24-02-2017
Forenoon

5. Expand F(P,Q,R) = P(P' + Q) (P' + Q +R') to maxterms and minterms [5]

Solution

Min terms= ∑(6,7)

6. Dertermine the minimum-cost SOP expressions for the function [5]

F(A,B,C,D) = ∑m(0,4,5,7,8,10,14,15)

Soln:
F=A’C’D’+A’BD+ABC+AB’D’ [or]
F= B’C’D’+A’BC’+BCD+ACD’

7. Simplify the Boolean function F using the don't care conditions d in POS [5]

F = A'B'D + A'CD + A'BC

3|Pa g e
 B1 SLOT 24-02-2017
Forenoon

d = A'BC'D + ACD + AB'D'

Soln: F=(C+D) A’(B+C)

8. Explain the full adder with the neat circuit diagram. [5]
Solution

9. Reduce the expression using tabulation method and find the prime implicants [5]
F(A,B,C,D) = ∑(2,4,6,7,9,11,13)
Solution:
0010 (2) ✔ 0-10 (2,6)
01-0 (4,6)
0100 (4) ✔

0110 (6) ✔ 011- (6,7)

10-1 (9,11)
1001(9) ✔

0111(7) ✔ 1-01 (9,13)

1011(11) ✔

1101(13) ✔

Solution
F = A'CD' + A'BD' + A'BC + AB'D + AC'D

10. Design an adder which adds two 2-bit binary numbers to give a 3-bit binary sum. [5]
Find the truth table for the circuit.

Solution

4|Pa g e
 B1 SLOT 24-02-2017
Forenoon

5|Pa g e