AKJ CVS DU 2022 1

AKJ CVS DU 2022 2

AKJ CVS DU 2022 3
AKJ CVS DU 2022 4
 Bit: it is the smallest memory measurement unit. It
stands for “ Binary Digit”.
Binary operations
0 +0 =0 1+0 = 1
0+1=1 1 + 1 = 10
0.0 = 0 0.1=0
1.0 = 0 1.1 =1

AKJ CVS DU 2022 5

 (1011)2 * (101)2 = 1011 *1 +1011* 0 +1011*1
1011
X101
=1011
0000x
1011 x
=1 10 1 11
Ans= 110111
= 1*25 + 1 *24 +1 *22 +1*21 +1*20
= 32 + 16 + 4+ 2 + 1 = 55

678 * 12

AKJ CVS DU 2022 6

AKJ CVS DU 2022 7
Q1.
(511.52)10 = ( )5
For the non- fractional part , we have,
(511)10 = (4021)5
5)511(1
5 ) 102(2
5 ) 20(0
4 (stop here as 4<5 and read from bottom to top)
For the fractional part, we have
0.52 * 5 = 2.60
0.60*5 = 3.00 // considering only the fractional part.
0.0 * 5 = 0.0 // stop here
Note 1: Stop calculation when the result of the multiplication is 0 or there is repeating result.
Note 2: Read only the integer part from top to bottom (opposite to non-fractional part).
Hence (511.52)10 = (4021.23)5

AKJ CVS DU 2022 8

AKJ CVS DU 2022 9
AKJ CVS DU 2022 10
AKJ CVS DU 2022 11
AKJ CVS DU 2022 12
AKJ CVS DU 2022 13
 +6= 00000110 (using 8 bits)
11111001 1’s complement of 6
11111001
+1 =11111010

AKJ CVS DU 2022 14

AKJ CVS DU 2022 15
AKJ CVS DU 2022 16
 Construct the truth table of the following Boolean
expressions:

(a)(xy + z)(y + xz)

(b) (A' + B)(B' + C)
(c) y'z + wxy' + wxz' + w'x'z

AND-> ^
OR V
XOR

(a)Let P=(xy +z).(y+xz)

X Y Z XY XY+Z XZ Y+XZ P
0 0 0 0 0 0 0 0
0 0 1 0 1 0 0 0
0 1 0 0 0 0 1 0
0 1 1 0 1 0 1 1
1 0 0 0 0 0 0 0
1 0 1 0 1 1 1 1
AKJ CVS DU 2022 17
 1 1 0 1 1 0 1 1
1 1 1 1 1 1 1 1

AKJ CVS DU 2022 18

AKJ CVS DU 2022 19
AKJ CVS DU 2022 20
AKJ CVS DU 2022 21
AKJ CVS DU 2022 22
AKJ CVS DU 2022 23
AKJ CVS DU 2022 24
 X +1 = x+ (x +x’) =x +x’
Q1. Express F= A+B’C into SOP.
There are 2 terms “A” and “B’C”. In the Ist term B & C are
absent and in the 2nd term A is absent.
Introducing missing variables, we have
A= A.(B+B’)= A.B +A.B’
=A.B.(C+C’) + A.B’.(C+C’)
= ABC + ABC’ +AB’C +AB’C’
B’C =B’C.(A+A’)=AB’C + A’B’C
Now combining all terms we have
F= ABC +ABC’ +AB’C+AB’C’ +AB’C +A’B’C
=ABC + ABC’ +AB’C + AB’C’+ A’B’C (Discarding duplicate
terms and writing them only once).
=m7 +m6 +m5 + m4 +m1
=m1 + m4 +m5 +m6 +m7
=∑(1,4,5,6,7)

AKJ CVS DU 2022 25

AKJ CVS DU 2022 26
AKJ CVS DU 2022 27
AKJ CVS DU 2022 28
 Note:- Ignore last two steps of the above simplification.

Note: There is a mistake in the logic diagram. Correct it.

AKJ CVS DU 2022 29

AKJ CVS DU 2022 30
AKJ CVS DU 2022 31
AKJ CVS DU 2022 32
 AA’ +B+C+D
Let B+C+D =X
So we have AA’ + X = (A +X) . (A’+X)
= (A + B+C+D ). (A’ +B+C+D)

A B C D Maxterms Minterms
0 0 0 0 0 M15 m0
1 0 0 0 1 M14 m1
2 0 0 1 0 M13 m2
3 0 0 1 1 M12 m3
4 0 1 0 0 M11 m4
5 0 1 0 1 M10 m5
6 0 1 1 0 M9 m6
7 0 1 1 1 M8 m7
8 1 0 0 0 M7 m8
9 1 0 0 1 M6 m9
10 1 0 1 0 M5 m10

AKJ CVS DU 2022 33

 11 1 0 1 1 M4 m11
12 1 1 0 0 M3 m12
13 1 1 0 1 M2 m13
14 1 1 1 0 M1 m14
15 1 1 1 1 M0 m15

F= XY +X’Z +YZ =XY +X’Z + YZ.(X+X’)

AKJ CVS DU 2022 34

AKJ CVS DU 2022 35
AKJ CVS DU 2022 36
AKJ CVS DU 2022 37
AKJ CVS DU 2022 38
AKJ CVS DU 2022 39
AKJ CVS DU 2022 40
AKJ CVS DU 2022 41
AKJ CVS DU 2022 42
AKJ CVS DU 2022 43
AKJ CVS DU 2022 44
AKJ CVS DU 2022 45
AKJ CVS DU 2022 46
AKJ CVS DU 2022 47
AKJ CVS DU 2022 48
AKJ CVS DU 2022 49
AKJ CVS DU 2022 50
AKJ CVS DU 2022 51
AKJ CVS DU 2022 52
AKJ CVS DU 2022 53
AKJ CVS DU 2022 54
AKJ CVS DU 2022 55
AKJ CVS DU 2022 56
AKJ CVS DU 2022 57
AKJ CVS DU 2022 58
AKJ CVS DU 2022 59
AKJ CVS DU 2022 60
AKJ CVS DU 2022 61
AKJ CVS DU 2022 62
AKJ CVS DU 2022 63
AKJ CVS DU 2022 64
AKJ CVS DU 2022 65
AKJ CVS DU 2022 66
AKJ CVS DU 2022 67
AKJ CVS DU 2022 68
AKJ CVS DU 2022 69
AKJ CVS DU 2022 70
AKJ CVS DU 2022 71
AKJ CVS DU 2022 72
AKJ CVS DU 2022 73
AKJ CVS DU 2022 74
AKJ CVS DU 2022 75
AKJ CVS DU 2022 76
AKJ CVS DU 2022 77
AKJ CVS DU 2022 78
AKJ CVS DU 2022 79
AKJ CVS DU 2022 80
 Q. Design a counter that counts the following sequence:
0,3,6,9.
PRESENT STATE NEXT STATE
A3 A2 A1 A0 A3 A2 A1 A0
0 0 0 0 0 0 1 1
0 0 0 1 X X X X
0 0 1 0 X X X X
0 0 1 1 0 1 1 0
0 1 0 0 X X X X
0 1 0 1 X X X X
0 1 1 0 1 0 0 1
0 1 1 1 X X X X
1 0 0 0 X X X X
1 0 0 1 0 0 0 0
1 0 1 0 X X X X
1 0 1 1 X X X X
1 1 0 0 X X X X
1 1 0 1 X X X X
1 1 1 0 X X X X
1 1 1 1 X X X X

AKJ CVS DU 2022 81

AKJ CVS DU 2022 82
AKJ CVS DU 2022 83
AKJ CVS DU 2022 84
 Q2.Design a combinational circuit that
takes three inputs x,y and z. The
circuit produces one output z1 = 1 if
the number of 1’s in the input
combination is even otherwise 0.
Q3.Design a combinational circuit that
takes four inputs w,x,y and z and
produces one output z1 = 1 if the input
is divisible by 3 otherwise 0.

X Y Z Z1
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

KMAP for z1

yz 00 01 11 10

1 1
1 1
AKJ CVS DU 2022 85
 X’y’z’ +xy’z + x’yz + xyz’

AKJ CVS DU 2022 86

 1 1 1 0 0
1 1 1 1 1

AKJ CVS DU 2022 87

AKJ CVS DU 2022 88
AKJ CVS DU 2022 89
AKJ CVS DU 2022 90
AKJ CVS DU 2022 91
AKJ CVS DU 2022 92
AKJ CVS DU 2022 93
AKJ CVS DU 2022 94
 Note : XOR is an odd function. This implies if we supply
odd number of 1’s XOR function, the result is always 1.
Cout<<”abc”

100111011010
pcode operand

AKJ CVS DU 2022 95

AKJ CVS DU 2022 96
AKJ CVS DU 2022 97
AKJ CVS DU 2022 98
AKJ CVS DU 2022 99
AKJ CVS DU 2022 100
AKJ CVS DU 2022 101
AKJ CVS DU 2022 102
AKJ CVS DU 2022 103
AKJ CVS DU 2022 104
AKJ CVS DU 2022 105
AKJ CVS DU 2022 106
AKJ CVS DU 2022 107
 Assume that the length of instruction is 16 bits
Address instruction
009 x=y
011 print x
013 x++
015 print x
We know that PC contains the address of the next
instruction to be executed but before execution of the
program PC will keep the address of the first instruction
and when x=y goes for execution, PC will be incremented
by 2.

AKJ CVS DU 2022 108

AKJ CVS DU 2022 109
AKJ CVS DU 2022 110
AKJ CVS DU 2022 111
AKJ CVS DU 2022 112
AKJ CVS DU 2022 113
AKJ CVS DU 2022 114
AKJ CVS DU 2022 115
AKJ CVS DU 2022 116
AKJ CVS DU 2022 117
AKJ CVS DU 2022 118
AKJ CVS DU 2022 119
AKJ CVS DU 2022 120
AKJ CVS DU 2022 121
AKJ CVS DU 2022 122
AKJ CVS DU 2022 123
AKJ CVS DU 2022 124
AKJ CVS DU 2022 125
AKJ CVS DU 2022 126
AKJ CVS DU 2022 127
AKJ CVS DU 2022 128
AKJ CVS DU 2022 129
AKJ CVS DU 2022 130
AKJ CVS DU 2022 131
AKJ CVS DU 2022 132
AKJ CVS DU 2022 133
AKJ CVS DU 2022 134
AKJ CVS DU 2022 135
AKJ CVS DU 2022 136
AKJ CVS DU 2022 137