Unit 3

Introduction to Numbers system and Logic gates

Number System Conversion Methods

1. Decimal to Binary Number System

(10.25)10
Steps:
(i) To convert from decimal to binary, start dividing decimal number by 2, and whatever
the reminder getting, writing down from bottom to top, and that will be the binary
number representation of the decimal number
(ii) . The number contains fractional part, then multiply 2 in the fractional part.

Note- Keep multiplying the fractional part with 2 until decimal part 0.00 is obtained.
(0.25)10 = (0.01)2
Answer: (10.25)10 = (1010.01)2

2. Binary to Decimal Number System

(1010.01)2

Steps:
(i) To convert from binary to decimal, start multiplying the exponent of 2 with each
digit of the number in decreasing order.
(ii) If the number contains fractional part then will divide it by the exponent of 2.

=1x23 + 0x22 + 1x21+ 0x20 + 0x2-1 + 1x2-2

= 8+0+2+0+0+0.25

= 10.25
Ans. (1010.01)2 = (10.25)10
 3. Decimal to Octal Number System
Steps:
(i) To convert from decimal to octal, start dividing decimal number by 8, and whatever
the reminder getting, writing down from bottom to top, and that will be the octal
number representation of the decimal number.
(ii) The number contains fractional part, then multiply 8 in the fractional part.

(10.25)10

= (10)10 = (12)8

Fractional part:

= 0.25 x 8 = 2.00

Note: Keep multiplying the fractional part with 8 until decimal part .00 is obtained.
(.25)10 = (.2)8

Answer: (10.25)10 = (12.2)8

4. Octal to Decimal Number System

Steps:

(i) To convert from octal to decimal, start multiplying the exponent of 8 with each digit of
the number in decreasing order.
(ii) If the number contains fractional part then will divide it by the exponent of 8.

(12.2)8
= 1 x 81 + 2 x 80 +2 x 8-1

= 8+2+0.25

= 10.25
(12.2)8 = (10.25)10

5. Hexadecimal to Binary Number System

To convert from Hexadecimal to Binary, write the 4-bit binary equivalent of hexadecimal.

1. (3A)16
Binary of 3= 0011
 Binary of A=1010
Ans. (3A)16= (00111010)2

6. Binary to Hexadecimal Number System

Steps:
1. To convert from Binary to Hexadecimal, start grouping the bits in groups of 4 from the
right-end and write the equivalent hexadecimal for the 4-bit binary.
2. Add extra 0’s on the left to adjust the groups.

1111011011
0011 1101 1011
(001111011011 )2 = (3DB)16

7. Binary to Octal Number System

Steps:
1. To convert from binary to octal, start grouping the bits in groups of 3 from the right
end and write the equivalent octal for the 3-bit binary.
2. Add 0’s on the left to adjust the groups.

111101101
111 101 101
(111101101)2 = (755)8

Code Conversion

1. Decimal to BCD code

Decimal Number BCD Excess 3

code
0 0000 0011
1 0001 0100
2 0010 0101
3 0011 0110
4 0100 0111
5 0101 1000
6 0110 1001
7 0111 1010
8 1000 1011
9 1001 1100

1.In the BCD numbering system, the given decimal number is segregated into chunks of
four bits for each decimal digit within the number.
2. Each decimal digit is converted into its direct binary form (usually represented in 4-
bits).

Convert (123)10 in BCD

From the truth table above,
1 -> 0001
2 -> 0010
 3 -> 0011
thus, BCD becomes -> 0001 0010 0011
Convert (324)10 in BCD
(324)10 -> 0011 0010 0100 (BCD)
Again from the truth table above,
3 -> 0011
2 -> 0010
4 -> 0100
thus, BCD becomes -> 0011 0010 0100

2. Decimal to Excess-3 Conversion

1. To convert a decimal number into excess-3, we write down the equivalent excess-3
codes for each decimal digit separately. To get the excess-3 codes for each digit,
2. We add 3 to each decimal digit individually, the maximum sum that can occur this way
is 9 +3 = 12.
3. We then write down the binary values in 4-bits for each obtained digit.
4. Alternatively, we can add 0011 to the BCD codes for each decimal digit directly.
(67.43)10 in excess-3 is given as: –
67.43 + 33.33 = (9) (10) . (7) (3) (Add 3 individually to each digit)
= (1001 1010. 0111 0011) (Each digit’s corresponding binary value is written)

(1542) in excess-3 is given as: –

1542 + 3333 = (4) (8) (7) (5) (Add 3 individually to each digit)
= (0100 1000 0111 0101) (Each digit’s corresponding binary value is written)

3. Binary to Gray Code Conversion

The gray code for a number can be obtained from its binary number using the following steps: –

1. Write down the binary form of the number.

2. The first digit (MSB) of binary is copied as the first digit of gray code.

3. The next bits can be obtained by performing XOR operations between the neighbouring
binary digits going from MSB to LSB.

4. This is done till we perform XOR operation between the two last binary digits.

 Note-All the arrows shown in red denote XOR operation in the right direction between
binary digits.
 (1011) in gray code is written as: –

 The first digit 1 is copied as it is.

 The next gray digit is (1 XOR 0) as 1 is the MSB of binary and 0 is its right
neighbouring bit. Thus,
1 XOR 0 = 1

 The next digit is (0 XOR 1) = 1

 The next is, 1 XOR 1 = 0

 Thus, the obtained gray code is 1110.

4.Gray Code to Binary Conversion

The binary code can be obtained from gray code by using XOR operations in the reverse direction.
The steps to follow for converting a gray number into binary are: –

 Write the MSB of gray code as the MSB of the binary number directly.

 The next digits of the binary number are obtained by performing XOR operations with the
obtained binary digit and the next gray digit right to the MSB.

 The process is repeated to its right till the last gray digit is XORed with

Gray code of (1110) in binary is given as: –

 The MSB is copied as it is. MSB = 1

 Then we XOR this obtained binary digit with the next gray digit.
(1 XOR1) = 0

 The next digit is, (0 XOR 1) =1

 And the LSB is (1 XOR 0) =1

 Thus, obtained binary number is 1011

SOP and POS Form

Representation of Boolean expression can be primarily done in two ways. They are as follows:

1. Sum of Products (SOP) form

2. Product of Sums (POS) form

1. Sum of Products (SOP) form

If the number of input variables are n, then the total number of combinations in Boolean algebra is
2n.

If the input variable (let A) value is :

 Zero (0) – A is LOW -It should be represented as A’ (Complement of A)

 One (1) – A is HIGH -It should be represented as A

SOP is sum of minterms and is represented as:

F in SOP = Σ m(0, 3)
Here, F is sum of minterm0 and minterm3.

A=0, B=0, C=0 Minterm is A'.B'.C'

A=1, B=0, C=1 Minterm is A.B'.C

If variable A is Low(0) - A'

A is High(1) – A

X (SOP) = Σ m(1, 3, 6)
= A’.B’.C + A’.B.C + A.B.C’

Construct SOP from a Truth Table:

Conversion from Minimal SOP to Canonical SOP Form

Minimal SOP form F = A̅B + B̅C

The term A̅B is missing input C. So we will multiply A̅B with (C+C̅) because (C+C̅ = 1). The term B̅C is
missing input A. so it will be multiplied with (A+A̅)

F = A̅B(C + C̅) + B̅C(A + A̅)

F = A̅BC + A̅BC̅ + AB̅C + A̅B̅C

Conversion from SOP to POS

Standard SOP expression can be converted into standard POS (product of sum) expression. For
example, the function given above is in canonical SOP form

F = A̅B̅C + A̅BC̅ + A̅BC + AB̅C

F = ∑ ( m1, m2, m3, m5 )

A B C y
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0

The remaining terms of this function are maxterms for which output is false. These max terms are
M0,M4,M6,M7. These Max terms will be used in POS expression as the product of these max terms.
The Symbol of Product is ∏.

F = ∏ ( M0, M4, M6, M7)

F = (A+B+C)(A̅+B+C)(A̅+B̅+C)(A̅+B̅+C̅)

The Max terms are the complement of minterms.

2. Product of Sums (POS) form

POS is product of maxterms and is represented as:

If variable A is Low(0) - A
A is High(1) - A'

F in POS = Π M(1, 2) Here, F is product of maxterm1 and maxterm2.

A=0, B=1, C=0 Maxterm is A+B'+C

A=1, B=1, C=1 Maxterm is A'+B'+C'

X (POS) = Π M(0, 2, 4, 5, 7)

= (A+B+C).(A+B'+C).(A'+B+C).(A'+B+C').(A'+B'+C')

Conversion from Minimal POS to Canonical form POS

Minimal POS form

F = (A̅+B̅) (B+C)

(A̅+B̅) term is missing C input so we will add (CC̅) with it. (B+C) term is missing A input so we will
add (AA̅) with it.

F = (A̅+B̅+CC̅) (B+C+AA̅)

F = (A̅+B̅+C)(A̅+B̅+C̅)(A+B+C)(A̅+B+C)

Conversion From Canonical POS to SOP

POS canonical form

F = (A+B+C)(A̅+B+C)(A̅+B̅+C)(A̅+B̅+C̅)

In canonical form each sum term is a max term so it can also be written as:

F = ∏(M0,M4,M6,M7)

The remaining combinations of inputs are minterms of the function for which its output is true. To
convert it into SOP expression first we will change the symbol to summation (∑) and use the
remaining minterm.

F = ∑ (m1,m2,m3,m5)

Now we will expand the summation sign to form canonical SOP expression.
 F = A̅B̅C + A̅BC̅ + A̅BC + AB̅C

Min terms are complement of Max terms for the same combination of inputs

Karnaugh Maps: A Graphical Tool for Logic Simplification

K-map of 3 variables

Solve for F(A,B,C)= ∑ (1 ,3 , 6 , 7) using K-map

A B C y
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
From red group we get product term— A’C

From green group we get product term— AB

Summing these product terms we get- Final expression (A’C+AB)

K-map for 4 variables

Solve for F (A, B, C, D) = ∑(0, 2, 5, 7, 8, 10, 13, 15)

Ans.

A B C D Y
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
 1 0 1 0 1
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

From the red group, the product term would be —BD

From the lilac group, the product term would be —B’D’

If we sum these product terms, then we will get this final expression (BD + B’D’)

POS FORM

3 variables K-map

F (A, B, C) = π(0,3,6,7)

Solution:

A B C y
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0

From the lilac group, the terms would be A B

If we take the complement of these two A’ B’

And then sum up them (A’ + B’)

From the blue group, the terms would be B C

When we take the complement of these terms B’ C’

And then sum them up (B’ + C’)

From the red group, the terms would be A’ B’ C’

If we take the complement of the two terms A B C

And then sum them up (A + B + C)

If we take the product of these three terms, then we will get this final expression –

(A’ + B’) (B’ + C’) (A + B + C)

4 variables K-map

F (P, Q, R, S) = π (3, 5, 7, 8, 10, 11, 12, 13)

Ans.

A B C D Y
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1
From the blue group, the terms would be R’ S Q

We take their complement and then sum them (R + S’+ Q’)

From the purple group, the terms would be R S P’

We take their complement and then sum them (R’ + S’+ P) S

From the red group, the terms would be P R’ S’

We take their complement and then sum them (P’ + R + S)

From the lilac group, the terms would be P Q’ R

We take their complement and then sum them (P’ + Q + R’)

Finally, we will express these in the form of the product – (R + S’+ Q’).(R’ + S’+A).(P’+ R + S).(P’+ Q +
R’)

K-map with Don’t Care Condition

1. Minimize the following function in SOP minimal form using K-Maps: f = m(1, 5, 6, 11, 12,
13, 14) + d(4) and implement using Universal gate like NAND gate.

Solution:

Therefore, SOP minimal is,

f = BC' + BD' + A'C'D + AB'CD

 2. Minimize the following function in SOP minimal form using K-Maps:
F(A, B, C, D) = m(1, 2, 6, 7, 8, 13, 14, 15) + d(0, 3, 5, 12) and implement using NAND gate.

Solution:

The SOP K-map for the given expression is: f = AC'D' + A'D + A'C + AB
 3. Minimize the following function in POS minimal form using K-Maps: f=M(2,3,6,7,8,9,12,13)
and implement using Universal gate like NOR gate.

Solution:
 4. Simplify the boolean function Y(A, B, C, D) = Π M (2, 3, 8, 9, 11, 13, 15) and implement
using universal NOR gate.

The simplified output expression is Y = (A’+B+C) (A’+D’) (A+B+C’)

MCQ questions

1. The decimal number 25 is equivalent to ____ in binary.

A) 11000
B) 11001
C) 10101
D) 10011

Answer: C) 10101

2. The hexadecimal number 1A is equal to ____ in decimal.

A) 24
B) 26
C) 18
D) 20
Answer: B) 26

3. Convert the octal number 73 to its decimal equivalent.

A) 59
B) 63
C) 56
D) 55

Answer: A) 59

4. Convert the decimal number 14 to its octal equivalent.

A) 16
B) 15
C) 17
D) 14

Answer: C) 17

5. The binary number 1111 is equal to ____ in hexadecimal.

A) E
B) D
C) F
D) B

Answer: C) F

6. The hexadecimal number 7F is equivalent to ____ in binary.

A) 01111111
B) 11111110
C) 11111000
D) 10011111

Answer: A) 01111111

7. The octal number 127 is equivalent to ____ in binary.

A) 1101011
B) 1010111
C) 1011111
D) 1111111

Answer: D) 1111111

8. Convert the binary number 11001 to octal.

A) 31
B) 25
C) 19
D) 23

Answer: C) 19
9. Which of these is the binary equivalent of hexadecimal C?

A) 1010
B) 1100
C) 1001
D) 1110

Answer: B) 1100

10. The hexadecimal number 3B is equivalent to ____ in decimal.

A) 59
B) 60
C) 58
D) 61

Answer: A) 59

11. Convert the octal number 64 to its binary equivalent.

A) 101100
B) 110100
C) 110011
D) 111000

Answer: B) 110100

12. The binary number 10101110 is equivalent to ____ in hexadecimal.

A) AE
B) AC
C) BE
D) CE

Answer: A) AE

13. Convert the decimal number 255 to binary.

A) 11001111
B) 11111111
C) 10111111
D) 10011111

Answer: B) 11111111

14. The BCD equivalent of the decimal number 25 is:

A) 0010 0101
B) 1010 0101
C) 0001 1001
D) 0100 1010

Answer: A) 0010 0101

15. The decimal number 8 in Excess-3 code is represented as:

A) 1011
B) 1000
C) 0110
D) 1110

Answer: A) 1011

16. The Gray code equivalent of binary number 1101 is:

A) 1011
B) 1001
C) 1111
D) 1100

Answer: B) 1001

17. The binary equivalent of Gray code 1010 is:

A) 1111
B) 1001
C) 1011
D) 1100

Answer: C) 1011

18. The BCD representation of the decimal number 93 is:

A) 1001 0100
B) 1010 0011
C) 1001 0011
D) 1111 0011

Answer: C) 1001 0011

19. The Excess-3 code for decimal number 5 is:

A) 0101
B) 1000
C) 0110
D) 1010

Answer: C) 1000

20. Convert the Gray code 1100 to binary:

A) 1011
B) 1000
C) 1110
D) 1010

Answer: B) 1000

21. Which of the following numbers cannot be represented in BCD?

A) 9
B) 11
C) 7
D) 3

Answer: B) 11

22. The Boolean expression A +AB simplifies to:

A) AB
B) A+BA
C) A
D) B

Answer: C) A

23. Which logic gate produces an output of 1 only if all inputs are 1?

A) AND
B) OR
C) XOR
D) NOR

Answer: A) AND

24. The output of an XOR gate is 1 when:

A) Both inputs are 0

B) Both inputs are 1
C) Inputs are unequal
D) Inputs are equal

Answer: C) Inputs are unequal

25. How many inputs does a full adder have?

A) 2
B) 3
C) 4
D) 1

Answer: B) 3

26. The logic gate represented by the Boolean expression A⋅B‾\overline{A \cdot B}A⋅B is:

A) NOR
B) NAND
C) XOR
D) AND

Answer: B) NAND

27. Which of the following gates is a universal gate?

A) AND
B) OR
C) NAND
D) XOR
Answer: C) NAND

28. The output of a three-input OR gate is 1 if:

A) All inputs are 1

B) Any one input is 1
C) All inputs are 0
D) None of the above

Answer: B) Any one input is 1

29. MOS stands for:

A) Complementary Metal Oxide Semiconductor

B) Common Metal Oxide Semiconductor
C) Complementary MOSFET Oxide Semiconductor
D) Complementary MOS Logic System

Answer: A) Complementary Metal Oxide Semiconductor

30. In a CMOS NAND gate, the pull-up network is made of:

A) PMOS transistors in series

B) NMOS transistors in series
C) PMOS transistors in parallel
D) NMOS transistors in parallel

Answer: C) PMOS transistors in parallel

31. CMOS logic is preferred over TTL because:

A) CMOS is faster
B) CMOS has lower power consumption
C) CMOS gates are smaller
D) CMOS is easier to fabricate

Answer: B) CMOS has lower power consumption

32.In CMOS logic gates, the pull-down network consists of:

A) NMOS transistors in series/parallel

B) PMOS transistors in series
C) NMOS transistors in parallel only
D) PMOS transistors in parallel only

Answer: A) NMOS transistors in series/parallel

33. There are a total of ______ cells in a K-map with 4-variable.

a) 8

b) 18

c) 16
d) 12

Answer – (c) 16

34. The don’t care condition could be used in order to simplify the Boolean expressions in the
___________.

a) Latches

b) K-maps

c) Terms

d) Registers

Answer – (b) K-maps

35. Logic gates can be widely used in the _______________ design and are therefore available in
the IC form.

a) Digital

b) Sampling

c) Systems

d) Analog

Answer – (a) Digital

36. Every product term of the group, a’.b.c’ and a.c, represents the ____________ in that particular
group:

a) Sum of Maxterms

b) Sum of Minterms

c) POS

d) Input

Answer – (b) Sum of Minterms

37. Consider the Boolean function F(A,B,C) represented by the following Karnaugh Map:

Which of the following is the minimized expression for F(A,B,C)?

a) A′B+A′C +AB
b) B′C+AC
c) A′C+AB+BC
d) A′B′C+AB+AC

Ans. b) B′C+AC

38. Which law does the Boolean expression A⋅(B+C)=(A⋅B)+(A⋅C) represent?

a) Associative Law
b) Distributive Law
c) De Morgan's Theorem
d) Absorption Law

Answer: b) Distributive Law

39. Which expression represents the XOR operation A⊕B?

a. A.B+A’B’
b. A.B’+A’.B
c.A.B’.B
d.A+B
Answer: b) A⋅B’+A’⋅B

40. What does each cell in a 3-variable K-map represent?

a) A single minterm
b) A product term
c) A sum of terms
d) A literal

Answer: a) A single minterm

41. Which of the following Boolean functions represents the 3-variable K-map below?

Ans. a) B⊕C

42. What is the minimized Boolean expression for the 3-variable K-map where all cells are 1 except
the cell at (A=1,B=1,C=0)?

a) 1+A⋅B⋅C’
b) A⋅B’+C’
c) 1+A’⋅B’⋅C
d) A+B+C

Answer: d) A+B+C

43. Identify the minimized expression for the K-map below:

a) B′⋅A
b) A+B′
c) B′⋅C
d) B′
Answer: d) B′

44. What is the minimized expression for a K-map with 1s at cells corresponding to A ′B ′C?, AB ′C ′,
and ABC?
a) A+C
b) AB′C′+A′C
c) AC+AB′
d) AB+BC+AC

Answer: b) AB′C′+A′C

45. What is the minimized Boolean expression for a 3-variable K-map with 1s in all corners?
a) A′B′+AB
b) B′C′+BC
c) A′C+AC
d) C⊕B

Answer: b) B′C′+BC

46. Which of the following represents a valid grouping for simplification in a 3-variable K-map?
a) 3 cells
b) 5 cells
c) 8 cells
d) 7 cells

Answer: c) 8 cells