➢ Important Topics of this Chapter for Creative Question of (c) & (d):

Times Questions Board & Year the Questions Have

Importance Topic Appeared Appeared
c d CQ
T-01: Number System
DB’23, 19, 18,17; RB’23, 19, 17; Ctg.B’23,
(Base, Conversion,
19, 17; JB’23, 19, 18,17,16; BB’23,
 2's Complement 25 24
19,17; SB’23,19, 18; CB’23, 19,17;
Method, Code)
Din.B’23, 19, 18; MB’23
DB’23, 19, 18, 17, 16; RB’23, 19, 17, 16;
T-02: Boolean Algebra and
Ctg.B’23, 17,16; BB’23, 19,17,16; SB’23,
 Logic Gate 28 23
19, 18,17,16; CB’23, 19,17; Din.B’23,
18,17,16; MB’23; JB’18,17
T-03: Integrated Circuit
CB’23, 16; JB’23, 19; BB’23; Din.B’23,
 and Digital Devices 6 10
19,16; Ctg.B’19; RB’17
 T-04: Clock Sequential 1 2 JB’23; SB’17
Circuits (Latches,
Flipflop and Counter)

T-01: Number System (Base, Conversion, 2's Complement Method, Code)

01. Rony and Johny bought books worth Taka (346)8 and (10110110)2 respectively from this year's Ekeshey
book fair. [DB’23]
(c) Find the total number of books bought by stem’s Ronnie and Johnny in decimal number system. 3
(d) Determine by the 2's complement method which of the two persons in the stem bought the more
expensive book. 4
Answer
(c) Total Value= Cost of Rony’s Book+ Cost of Jony’s book
= ৳ (346)8 + ৳ (10110110)2
= ৳ (3 × 82 + 4 × 81 + 6 × 80 )10 + ৳ (1 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 0 × 23 + 1 × 22 + 1 × 21 +
0 × 20 )10
= ৳ (3 × 64 + 4 × 8 + 6 × 1)10 + ৳ (128 + 32 + 16 + 4 + 2)10
= ৳ (230)10 + ৳ (182)10
= ৳ (230 + 182)10
= ৳ (412)10
∴ In total they both bought books worth (412)10 taka.

1
 3 4 6
(d) ⏞ 100
(346)8 = 011 ⏞ 110
⏞ = (11100110)2

∵ The sign bit is 0.

∴ Cost of Rony’s book− Cost of Jony’s book⇒ Positive
∴ Cost of Rony’s book− Cost of Jony’s book > 0
∴ Cost of Rony’s book> Cost of Jony’s book
∴ Rony bought books of comparatively higher cost.
02. X, a class XI science student of a college, had (2F)16 merit in the half-yearly examination. His merit rank
in the annual examination is (14)8. [RB’23]
(c) Convert the half-yearly examination merit list of X into binary and octal number systems. 3
(d) Determine the difference in the results of the two exams of X of the stem by addition. 4
Answer
(c) The half-yearly exam’s merit of X, (2F)16
2 F
(2F)16 =⏞
0010 ⏞
1111 = (101111)2
101 111
(2F)16 = (← ← ) = 101 ⏟ = (57)8
⏟ 111
2
5 7
2 F
(d) ⏞
Merit Order of Half Yearly Examination of X(2F)16 . (2F)16 = 0010 ⏞
1111 = (101111)2
1 4
⏞ 100
Merit order of annual examination of X(14)8 . (14)8 = 001 ⏞ = (1100)2
এখন, (1100)
⏟ 2 < (101111)
⏟ 2
4 bit 6 bit
So both numbers have to be found by adding the difference to 8 bits.
Annual Examination Merit Order,

Difference = (Half Yearly) + (- Yearly)

∴ Differences in the results of the two tests= (100011)2 = 1 × 25 + 1 × 21 + 20 = (35)10

03. X = (123)n and Y = (43)16 [Ctg.B’23]
(c) What is the value of n if the decimal value of the number X is (83)10 ? 3
(d) X-Y Arithmetic process by addition can be done with 2's complement—Mathematically analyze the
expression. 4

2
 Answer
(c) By question,
X = (83)10
⇒ (123)n = (83)10 ⇒ (1 × n2 + 2 × n1 + 3 × n0 )10 = (83)10
⇒ (n2 + 2n + 3)10 − (83)10 = 0 ⇒ (n2 + 2n + 3 − 83)10 = 0
⇒ (n2 + 2n − 80)10 = 0 ⇒ (n2 + 10n − 8n − 80)10 = 0
⇒ (n(n + 10) − 8(n + 10))10 = 0 ⇒ ((n + 10)(n − 8))10 = 0
∴ n = −10, 8
∵ The base of the number system is natural numbers and 1 is greater than 1, −10 < 1 and −10 ∉ ℕ
∴ n ≠ −10 ; ∴ n = 8
(d) From “c” we get, n = 8
1 2 3
⏞ 010
∴ X = (123)8 = 001 ⏞ 011
⏞ = (1010011)2
[From "c" we get, X = (83)10]
Y = (43)16 = (4 × 161 + 3 × 160 )10 = (67)10
4 3
Again, Y = (43)16 = ⏞ 0100 ⏞0011 = (1000011)2
X − Y = (83)10 − (67)10 = (16)10
−128 ≤ 83 ≤ 127
−128 ≤ 67 ≤ 127
−128 ≤ 16 ≤ 127
∵X, Y and X-Y each have values within the 8-bit register.
∴ This can be done using 8-bit registers.

Sign bit is positive 1 ∴ result= (10000)2

= (1 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20 )10
= (16)10, which we have seen earlier
That is, the X - Y arithmetic process can be done by addition with 2's complement.
04. [SB’23]
Binary
Number
100010 (1st)
100100 (2nd)
100110 (3rd)
? (4th)
101010 (5th)
(c) Convert the 5th digit of stimulus to octal, decimal and hexadecimal number system. 3
(d) Calculate the difference between the 4th digit and the 2nd digit of the stimulus sequence using the 2's
complement method. 4
3
 Answer
(c) The 5th number of the stimulus: (101010)2
101 010
Conversion to Octal: (← ← ) = 101 ⏟ = (52)8
⏟ 010
2
5 2
Convert to decimal: (101010)2 = (1 × 25 + 0 × 24 + 1 × 23 + 0 × 22 + 1 × 21 + 0 × 20 )10
= (32 + 8 + 2)10 = (42)10
⃖
Hexadecimal conversion: ( 10 1010 ⃖
) = (0010 ⃖
1010 ) = 0010
⏟ ⏟
1010 = (2A)16
2 2
2 10(A)
(d) Applying SOP Method to the truth table of Scenario-2 we get- X = A̅B̅ = ̅̅̅̅̅̅̅
A + B ̅ That is, Scenario-2 basically
indicates NOR ( ). It is a Universal Gate, that is, any function can be implemented with it.
Simplifying scenario-1 we get-
X = ABC + A̅ BC̅ + A ̅B
̅C̅ + AB
̅C
= B(AC + A ̅ C̅) + B
̅(AC + A̅ C̅)
= (AC + A̅ . C̅)(B + B̅) ̅̅̅̅̅̅. 1 =
= A⨁C
̅̅̅̅̅̅
A⨁C
By implementing this with NOR we get
X = ̅̅̅̅̅̅̅
A⨁C = AC + A ̅ . C̅
= AC + A + C = ̅̅̅̅
̅̅̅̅̅̅̅ AC + A̅̅̅̅̅̅̅
+C
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
= ̅̅̅̅̅̅̅
A A + C = ̅̅̅̅̅̅̅
̅ + C̅ + ̅̅̅̅̅̅̅ ̅ + C̅ + ̅̅̅̅̅̅̅
A A+C
05. Recently a test match was organized between the 'red' and 'green' teams. The red team scored (1101010)2,
runs in the first innings. The green team took 9 wickets in the first innings and scored (347)10 runs. The red
team scored (C 3)16 runs in the 2nd innings. [BB’23]
(c) Convert the first innings runs of the 'green' team to hexadecimal number system. 3
(d) The sum of the runs of the two innings of the 'red' team is more or less than that of the first innings of
the green team? Explain. 4
Answer
(c) Runs scored in the 1st innings by the green team= (347)10

∴ (347)10 = (15B)16
(d) Red team's total runs scored in 1st two innings= (1101010)2 + (C3)16
= (1 × 26 + 1 × 25 + 0 × 24 + 1 × 23 + 0 × 22 + 1 × 21 + 0 × 20 )10 + (𝐶 × 161 + 3 × 160 )10 [∵ (C)196 = (12)10 ]
= (64 + 32 + 8 + 2 + 192 + 3)10
= (301)10 <runs scored in the 1st innings by the green team, that is (347)10
∴ The sum of the runs of the two innings of the red team is less than that of the first innings of the green team.
06. Two students in by the teacher in ICT class were asked to write two decimal numbers, one wrote (+63) and
the other (+70). Then sir said that he has invented a new number system with 0, 1, 2, 3 and 4. [JB’23]
(c) Convert the number (2FC)16 to sir's new number system. 3
(d) Find the difference of two decimal numbers of stimulus by addition. 4

4
 Answer
(c) The number system invented by Sir has 5 digits in total, i.e. it is a 5 based number system.
(2FC)16
= (2 × 162 + F × 161 + C × 160 )10
= (2 × 256 + 15 × 16 + 12 × 1 )10
= (512 + 240 + 12)10
= (764)10

∴ (764)10
= (11024)5

∴ (2FC)16 = (764)10 = (11024)5

(d)
The 1st number, (63)10 = (111111)2 The second number, (70)10 = 1000110

Difference = (70)10 − (63)2

= (1000110)2 − (111111)2 = (111)2 = (7)10
07. Mamun bought ticket from Joypurhat to Dhaka for (112)8 taka. Mamun's friend Abir bought a ticket from
Narayanganj to Dhaka for (3D)16 taka. [CB’23]
(c) Express in binary the total number of tickets purchased by Mamun and Abir. 3
(d) The difference between the purchase prices of Mamun and Abir's tickets can be determined by addition-
Analyze. 4
Answer
(c) Mamun ticket price = (112)8 = (001 001 010)2 Taka
Abir ticket price = (3D)16 = (0011 1101)2
Total price= (001 001 010)2 + (0011 1101)2 = (10000111)2
(d) Similar to the question 3(d)
08. Kakali, Polly and Kona are three girlfriends. Kakali and Polly went to the market and bought a dress each
for themselves. Later, when Kanna asked about the price of their clothes, Kakali said (167)8 taka and Polly
said (79)16 taka. [Din.B’23]
(c) Express the prices of kakali and poly dresses in decimal number system. 3
(d) Analyze whose clothing price is more by addition. 4

5
 Answer
(c) Price of Kakli's clothes
= (167)8 taka = (1 × 82 + 6 × 81 + 7 × 80 )10 taka
= (64 + 48 + 7)10 taka = (119)10 taka
Price of Pali's clothes
= (79)16 = (7 × 161 + 9 × 160 )10 = (112 + 9)10 = (121)10 taka
(d) Kakoli's dress price = (167)8 = (001 110 111)2
The Price of Polly's dress = (79)16 = (0111 1001)2
Difference = (167)8 − (79)16 = (01110111)2 − (0111 1001)2 = (01110111)2 + (− 0111 1001)2

In 8-bit register will show, (− 0111 1001)2 কে (10000111)2

Now,

Sing bit 1 means the subtraction is negative

∴ (167)8 < (79)16 ; Hence, poly dresses cost more.
09. A, B and C respectively have (1001000)2 , (67)10 and (502)8 taka each. [MB’23]
(c) Find the difference in money between A and B by addition. 3
(d) Show the difference in money between A, B and C in ascending order by converting to base 16. 4
Answer
(c) Amount of money of A is a 7-bit binary number. ∴ It can be calculated in 8-bit register.
(−128)10 < (67)10 < (127)10
Therefore, (67)10 can also be expressed in 8 bit register.
∴ The calculation indicated in the question is possible only in 8 − bit registers.

∴ (67)10
= (1000011)2

Here, (A's money)-(B's money)

= (A's money) (-B's money)

6
 Here, in 8-bit registers.
+B it’s money: 0 1 0 0 0 0 1 1
↓↓↓↓↓↓↓↓
1 0 1 1 1 1 0 0 [1’s Com.]
+1
−B it’s money: 1 0 1 1 1 1 0 1 [2’s Com.]

∴ Difference = (101)2
(101)2 = (1 × 22 + 0 × 21 + 1 × 20 )10 = (5)10
101
⏟ = (5)8
(← ) = 101
2
5
101 0101
(← ) = (← ) = 0101
⏟ = (5)16
2 2
5
∴ Required difference = (101)2 = (5)8 = (5)10 = (5)16
(d) A’s money,
100 1000 0100 1000
( ← ) = (← ← ) = 0100 ⏟ ⏟
1000 = (48)16
2 2
4 8
B’s money,

∴ (67)10 = (43)16
C’s money,
5 0 5
⏞ 000
(502)8 = 101 ⏞ 010
⏞ = (101000010)2
1 0100 0010 0001 0100 0010
= ( ← ← ) = (← ← ← )
2 2
= 0001
⏟ ⏟
0100 ⏟
0010
1 4 2
= (142)16
Difference in money of A and B
(48)16 > (43)16
48
−43
5
∴ Difference = (5)16
Difference in money of B and C Difference in money of C and A
(43)16 < (142)16 (142)16 > (48)16
2 + 16 = 18 [∵ 2 < 8]
2 + 16 = 18 [∵ 2 < 3] 18 − 8 = 10 ⇒ A
18 − 3 = 15 ⇒ F 142
4+1=5
4+1=5 − 48 4 + 16 = 20 [∵ 4 < 5]
142 FA
− 43 4 + 16 = 20 [∵ 4 < 5] 20 − 5 = 15 ⇒ F
FF
20 − 5 = 15 ⇒ F 0+1=1
0+1=1 1≮1
1≮1 ∴ Difference (FA)16
∴ Difference (FF)16
Ascending order: ∵ (5)16 < (FA)16 < (FF)16
∴ Money difference between A and B < Money difference between C and A < Money difference between B
and C

7
10. Taskin sir was discussing number system of ICT subject in the class. At one point of the class the teacher
asked Sohel and Rohan their marks in the 1st term examination. Sohel said (105)8 and Rohan said (4F)16 .
Mita sitting in the back said,”Sir, I got (100111)2 marks.” [DB’19]
(c) Convert the marks obtained by Mitu in decimal. 3
(d) Is it possible to determine the difference of the marks scored by Sohel and Rohan using summation?
Analyze and give opinion. 4
Answer
(c) Mita got (100111)2 marks. If it is converted to decimal then,
(100111)2 = 1 × 25 + 0 + 0 + 1 × 22 + 1 × 21 + 1 × 2o = (39)10
That is , Mita’s marks in decimal is (39)10.
(d) Similar to question 03(d)
11. Kristi, Piyal and Mukto bought gifts with (5D7)16 , (750)8 and (999)10 taka respectively on the occasion
of their classmate’s wedding. [RB’19]
(c) Determine the total cost of the gifts of Kristi and Mukto mentioned in the stem in binary number system. 3
(d) Determine the cost of the gifts of Piyal and Kristi in hexadecimal and decimalrespectively. 4
Answer
(c) Price of Kristi’s gift in the stem = (5D7)16 . Converting this to decimal we get,
5D7 = 5 × 162 + D(13) × 161 + 7 × 160 = 1495
Price of Mukti’s gift = (999)10 ∴ Total = 999 + 1495 = (2494)10 .Converting this to binary we get,
Reminder
2 2494
0
2 1247
1
2 623
1
2 311
1
2 155
1
2 77
1
2 38
0
2 19
2 9 1

2 4 1

2 2 0

2 1 0

1
0
∴ Total in binary= (2494)10 = (100110111110)2

8
(d) In case of Piyal, (750)8 = (111101000)2 = (1E8)16
In case of Kristi, (5D7)16 = 5 × 162 + 13(D) × 161 + 7 × 160 = (1495)10
That is, cost price of Piyal’s gift in hexadecimal is (1E8)16 and cost price of Kristi’s gift in decimal is
(1495)10.
12. Roni gets an idea about different number types in the class. Based on this idea Roni’s sister’s age is (110101)2
years that of his brother is (53)8 years. Roni and his brother bought two school bags of same brand and same
model from different shops with (207)16 and (510)10 taka respectively. [Ctg.B’19]
(c) Determine the difference of the ages of Roni’s sister and brother using summation. 3
(d) Give your opinion by determining the price of their school bags in octal. 4
Answer
(c) Ronnie's sister's age = (110101)2
Ronnie's brother's age = (5 3)8
5 3
( ↙ ↘ )
101 011 2
∴ Ronnie's brother's age= (101011)2
Now, (110101)2 > (101011)2
∴ Ronnie's sister is older.
11010100
(101011)2 = 1’s complement of (00101011)2 = +1
11010101 [2′ s comp]

∴ Age difference = (110101)2 − (101011)2

= (00110101)2 + (11010101)2
00110101
+11010101
→ (1010)2 = (10)10
1 00001010

∴ Their age difference (10)10.

(d)
(2 0 7)16 Also,
↙ ↓ ↘
8 510
(0010 0000 0111)2
8 63 − 6
= (1007)8
8 7−7
∴ (207)16 = (1007)8
0−7
∴ (510)10 = (776)8
So, the price of Roni’s bag is higher.

13. The age of Sumi, Sumi’s father and Sumi’s mother are respectively (10)16 , (100)8 and (2F)16 years.
[SB’19]
(c) Convert the age of Sumi’s mother to octal. 3
(d) How many times is the age of Sumi’s father than Sumi? Analyze. 4

9
 Answer
(c) Sumi’s mother’s age is (2F)16 years which is a hexadecimal number. Hexadecimal to binary conversion:
2 F

0010 1111
∴ (2F)16 = (00101111)2
Binary to octal:
101 111

5 7
∴ (101111)2 = (57)8
∴Age of Sumi’s mother is (57)8 years. (Ans.)
(d) Here, Sumi’s age is (10)16 years.
Sumi’s father’s age is (100)8 years.
Conversion of Sumi’s age to decimal:
(10)16 = 1 × 16 + 0 × 16° = 16
Conversion of Sumi’s father’s age to decimal:
(100)8 = 1 × 82 + 0 × 8′ + 0 × 8° = 64
∴ (100)8 = (64)10
64
∴ Sumi’s father’s age is = 16 = 4 times of Sumi. (Ans.)
14. The ICT teacher was teaching the number system in the class. When a student was asked about his roll
number, he said (375)10. The teacher converted the roll number to a number system consisting of 8 unique
symbols. Knowing the previous year roll number of the student to be (17C)16, the teacher commented that
his result of the last exam was well. [BB’19]
(c) Convert the current roll number of the student to the number system showed by theteacher. 3
(d) Evaluate the comment of the teacher by determining the difference of the roll numbers using summation. 4
Answer
(c) The number system showed by the teacher is octal number system.
8 375
8 46-7 ∴ (375)10 = (567)8
8 5-6
0-5
(d) Similar to question 02(d)
15. The marks obtained by Jhumi and Rumi in the test examination respectively (920)10 and (920)8. Their class
roll numbers are respectively (37)8 and (3A)16. [JB’19]
(c) Convert the mentioned two roll numbers in the stem into conventional numbers system. 3
(d) Is it possible to determine the difference of the marks scored by Jhumi and Rumi by summation?
Analyze. 4
Answer
(c) Jhumi’s roll number is (37)8
Here, (37)8
/ ↘
011 111
∴ The corresponding decimal number is = (20 + 21 + 22 + 23 + 24 ) = (31)10
Rumi’s roll number is (3A)16
/ ↘
0011 1010
∴ Decimal number = (21
+ 2 + 24 + 25 ) = (58)10
3

Their roll numbers are (31)10 and (58)10

(d) Similar to question 02(d)

10
16. ‘ICT teacher of college ‘A’ wrote the numbers (63)10 , (63)8 and (63.8)16 on the board and showed the
sum of the 2nd and 3rd number. Then he said, “All the mathematical calculations inside a computer are done
by only one operation”. [CB’19]
nd rd
(c) Express the sum of the 2 and 3 number using in binary. 3
st nd
(d) It is possible to determine the difference of the 1 and 2 number using the operation mentioned in the
stem? Analyze. 4
Answer
(c)
2nd number (63)8 = (110011)2 (6 3)8
/ \
3rd number (63.8)16 = (1100011.1)2 110 011
(63.8)16
∴ Sum,
/ \
110011.00
1100011.1 110 0011.1000
(10010110.1)2
(d) Similar to question 02(d)
17. [Din.B’19]
X = (36.75)10 P = (57)8
Y = (59. F)16 Q = (30)10
Scenario-A Scenario-B
(c) Find the sum of X and Y of scenario-A in binary. 3
(d) Determine the difference between P and Q mentioned in scenario-B using 2’s complement process. 4
Answer
(c) X = (36.75)10
Conversion to Binary:

∴ (36.75)10 = (100100.1100)2
Y = (59. F)16

Conversion to Binary:

(59. F)16 = (1011001.1111)2

Add: (36.75)10 + (59. F)16
= (100100.1100)2 + (1011001.1111)2
0100100.1100
+ 1011001.1111
1111110.1011
∴ Sum = (1111110.1011)2
(d) Similar to question 02(d)

11
18. Rana and Sumi got (62)8 and (2F)16 marks in the ICT exam out of (110010)2 marks.
[DB, JB, SB, Din.B’18]
(c) Convert the total marks in ICT exam to decimal. 3
(d) Is it possible to determine the difference of the marks scored by Rana and Sumi using summation?
Analyze mathematically. 4
Answer
(c) Similar to question 10(c)
(d) Similar to question 02(d)
19. ICT teacher was teaching number system in the class. But getting disturbed due to inattention of one of the
students, he asked him his roll number. The student answered (31)10. Then when the teacher asked the him
what his roll number was in the previous class, he answered (15)10. The teacher then said. “Due to your
inattention you got poor result.” [DB’17]
(c) Express the current class roll of student in the stem in binary number system. 3
(d) Evaluate the change of result of the student by only finding the difference of his roll numbers of the two
classes using summation. 4
Answer
(c) Current Class Roll = (31)10
Conversion to Binary:

∴ (31)10 = (11111)2
(d) Similar to question 02(d)
20. Adnan Jami asked his uncle to know the sum of two numbers (E)16 and (7)8 . Uncle showed Adnan Jami
the sum and said that all the mathematical operations inside the computer like––addition, subtraction,
multiplication, division are done by a single operation, and addition also uses one type of circuit. [RB’17]
(c) Subtract the numbers in the stem by using the operation that uncle indicated. 3
Answer
(c) Similar to question 02(d)
21. Sneha and Mita were discussing the test results. Sneha said, I got (4C)16 in ICT in exam. Mita says I got
(103)8 marks in ICT. Their brother who was studying in class 5 did not understand who got more marks.
[Ctg.B’17]
(c) How many marks in the stem Sneha and Mita scored on decimal based number system – – Analyze. 3
(d) Find the difference between the number obtained by Sneha and Mita in the stem in 2's complement
method using 8 bit register. 4
Answer
(c) Similar to question 04(c)
(d) Similar to question 02(d)
22. Asif’s father is a teacher of ICT. When he wanted to know the obtained marks of Asif in ITC he told him
that he got (112)8 in half-yearly exam and (7F)16 annual exam. [BB’17]
(c) Convert the obtained number of Asif in half-yearly exam into hexadecimal number. 3
(d) The marks obtained by Asif in annual exam is how much less or more than (80)10 ? Give logic in
regards to your answer. 4

12
 Answer
(c) Asif's half-yearly exam marks = (112)8
Conversion to Binary:

= (1001010)2

Hexadecimal conversion to (1001010)2 : (0100

⏟ ⏟ )
1010
4 A 16
∴ (112)8 = (4A)16
(d) Marks obtained in the annual = (7F)16
Convert to decimal:
(7F)16 = 7 × 161 + F(15) × 16°
= 112 + 15 = 127
∴ (7F)16 = (127)10 > (80)10
Difference = (127)10 − (80)10 = (47)10
∴ Asif's half-yearly exam marks higher than annual exams.
23. In 2016, vegetable farmers suffered huge losses due to natural calamities. Farmer Ali (42) 10 hectares of
potato, Jamil (253.2)8 hectares of mustard, Haseeb (E3.2)16 hectares of tomatoes and Jalil (110)2 hectares of
cucumbers were destroyed. [CB’17]
(c) Subtract the crop loss of Jalil's land from Ali's land used as in stem in 2's complement. 3
(d) Between Jameel and Haseeb, whose crop has suffered more damage in the stem and by how much? –
Give an analytical opinion. 4
Answer
(c) Similar to question 02(d)
(d) Similar to question 05(d)
24. Shafiq, Shifa and Tanay scored three marks in Information and Communication Technology (1001000)2,
(531)8 and (4A)16 respectively. [JB’17]
(c) Convert the obtained number of Tanay in the stimuli to decimal system. 3
(d) Determine the number (1100011)2 is greater or less than the number received by Shifa in the stimulus. 4
Answer
(c) Similar to question 04(c)
(d) Similar to question 22(d)
25. The ICT subject professor was teaching number systems in the class. Imran was then asked to know the
marks obtained in his half-yearly and annual exams in ICT subject and he said that he got (37)8 in half-
yearly and (3F)16 marks in the annual exam. When the other students did not understand the meaning and
asked the sir, the sir explained in detail. [JB’16]
(c) Convert the marks obtained in the half-yearly examination of Imran to hexadecimal number as described
in the stem. 3
(d) How much less or more than (72)10 is mark obtained in Imran's annual examination as described in the
stem? Justify your answer. 4
Answer
3 7
(c) Imran's marks obtained in half yearly examination = (37)8 = 011 ⃖
= (11111)2 = (1 1111 )2 =
111
⃖
(0001 ⃖
1111)2 = (1F)16
(d) Similar to question 22(d)

13
 T-02: Boolean Algebra and Logic Gate

01. F = A̅ BC + AB ̅C + ABC̅ + ABC [DB’23]

(c) Construct the truth table of the logic function given the stem. 3
(d) Implement the simplified value of the equation given by the stem with only NAND gates. 4
Answer
(c) The required truth table of the function given in the stem has been prepared below–
INPUT PROCESS OUTPUT
A B C 𝐀 ̅ 𝐁 ̅ 𝐂̅ 𝐀 ̅ 𝐁𝐂 𝐀𝐁 ̅ 𝐂 𝐀𝐁𝐂̅ ABC F= 𝐀 ̅ 𝐁𝐂 + 𝐀𝐁̅ 𝐂 + 𝐀𝐁𝐂̅ + 𝐀𝐁𝐂
0 0 0 1 1 1 0 0 0 0 0
0 0 1 1 1 0 0 0 0 0 0
0 1 0 1 0 1 0 0 0 0 0
0 1 1 1 0 0 1 0 0 0 1
1 0 0 0 1 1 0 0 0 0 0
1 0 1 0 1 0 0 1 0 0 1
1 1 0 0 0 1 0 0 1 0 1
1 1 1 0 0 0 0 0 0 1 1
(d) F=A ̅ BC + AB̅C + ABC̅ + ABC
=A̅ BC + AB ̅C + ABC̅ + ABC + ABC + ABC [∵ x = x + x]
̅
= AB(C + C) + BC(A + A ̅ ) + CA(B + B̅)
= AB. 1 + BC. 1 + CA. 1[∵ x + x̅ = 1]
= AB + BC + CA [∵ x . 1 = x]
Which is the simplified value of F. By implementing it by NAND gates we obtain- –
F = AB + BC + CA = ̅̅̅̅AB + ̅̅̅̅
BC + ̅̅̅̅ ̅̅̅̅̅̅̅̅̅̅̅̅̅
CA = ̅̅̅̅
AB. ̅̅̅̅
BC. ̅̅̅̅
CA
02. Look at the diagram and answer the following questions. [RB’23]

(c) Determine the logic equation for X according to the stem. 3

(d) Suggest by logic equation analysis whether the circuit can be replaced by a single logic gate keeping
the given input and received output of the stem’s circuit unchanged. 4
Answer
(c) We redraw the stimulator circuit and sequence the gates:

Here,
P = A ̅, Q = B ̅, R = A + C, S = QR, T = P + S, U = (T. T) ̅, ∴ X = ̅̅̅̅̅ T. T
= ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(P + S). (P + S) = (A̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ + QR). (A ̅ + QR) = {A̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅+B ̅(A + C)}. {A ̅+B ̅(A + C)}
Which is the logic equation of X.

14
(d) The logic equation of X, X= {A ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅+B ̅(A + C)}. {A ̅+B ̅(A + C)}
After simplification we obtain,
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
X = {A̅+B ̅(A + C)}. {A ̅+B ̅ (A + C)}
= A̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅+B ̅
̅(A + C) = A. B ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ + (A + C) =A. ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ + (A + C)
B
=A (B ̅ + ̅̅̅̅̅̅̅
A + C) = A(B + ̅̅̅̅̅̅̅
A + C)= A(B + A ̅ . C̅)
= AB + A ̅ AC̅ = AB + 0 =AB
Simplified circuit
That is, the entire circuit of the stem can be replaced by just an AND gate.
03. ̅C
F = AB
Fig-1 Fig-2 [Ctg.B’23]
(c) Construct the truth table of the logic function of stem Fig.-1. 3
(d) “Logic circuit of the logic function of Fig-1 can be implemented by the logic gate of Fig-2 of the stem”
– draw and analyze the logic circuit. 4
Answer
(c) Truth table of fig-1 logic function of the stem:
Input Process Output
A B C 𝐁̅ 𝐀𝐁̅ 𝐅 = 𝐀𝐁̅𝐂
0 0 0 1 0 0
0 0 1 1 0 0
0 1 0 0 0 0
0 1 1 0 0 0
1 0 0 1 1 0
1 0 1 1 1 1
1 1 0 0 0 0
1 1 1 0 0 0
(d) Figure 2 shows the NAND gate, which is basically a universal gate. Any type of Boolean function can be
implemented by such a gate.
F = AB̅C = AB.
̅̅̅̅̅ ̅̅̅̅̅̅̅̅̅
BC = AB. ̅̅̅̅̅
BC

04. Scenario-1: X = ABC + ABC + A ̅B̅ C̅ + ABC

Scenario-2: [SB’23]
A B X
0 0 1
0 1 0
1 0 0
1 1 0
(c) Draw the truth table for scenario-1. 3
(d) Analyze the possibility of implementing the simplified equation of scenario-1 with the gate that
scenario-2 represents. 4

15
 Answer
(c) The truth table of scenario-1 is as follows:
INPUT PROCESS OUTPUT
A B ̅
C A ̅
B C̅ ABC A̅ BC̅ A
̅B̅C̅ ̅C
AB ̅ BC̅ + A
X= ABC + A ̅B̅C̅ + AB
̅C
0 0 0 1 1 1 0 0 1 0 1
0 0 1 1 1 0 0 0 0 0 0
0 1 0 1 0 1 0 1 0 0 1
0 1 1 1 0 0 0 0 0 0 0
1 0 0 0 1 1 0 0 0 0 0
1 0 1 0 1 0 0 0 0 1 1
1 1 0 0 0 1 0 0 0 0 0
1 1 1 0 0 0 1 0 0 0 1
(d) ̅ ̅ ̅̅̅̅̅̅̅
Applying SOP Method to the truth table of Scenario-2 we get- X = AB = A + B ̅ That is, Scenario-2 basically
indicates NOR ( ). It is a Universal Gate, that is, any function can be implemented with it.
Simplifying scenario-1 we get-
X = ABC + A̅ BC̅ + A
̅B̅C̅ + AB
̅C
= B(AC + A̅ C̅) + B
̅(AC + A̅ C̅)
̅ . C̅)(B + B
= (AC + A ̅̅̅̅̅̅. 1 = A⨁C
̅) = A⨁C ̅̅̅̅̅̅
By implementing this with NOR we get
X = ̅̅̅̅̅̅̅
A⨁C = AC + A ̅ . C̅
A + C = ̅̅̅̅
= AC + ̅̅̅̅̅̅̅ AC + ̅̅̅̅̅̅̅
A+C
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
= ̅̅̅̅̅̅̅
A A + C = ̅̅̅̅̅̅̅
̅ + C̅ + ̅̅̅̅̅̅̅ ̅ + C̅ + ̅̅̅̅̅̅̅
A A+C
05. [BB’23]

Fig-1 Fig-2 Fig-3

(c) Construct a truth table for the output of figure-1. 3
Answer

(c) For figure-1 , Output = xy + xy

Truth table for figure-1 is as follows:
Input Process Output
x y 𝐲 𝐱𝐲 xy xy + 𝐱𝐲 𝐱𝐲 + 𝐱𝐲
0 0 1 0 0 0 1
0 1 0 0 0 0 1
1 0 1 1 0 1 0
1 1 0 0 1 1 0

16
06. Look at the two pictures below and answer the questions: [CB’23]
A B X
0 0 1
0 1 0
1 0 0 N 2N
1 0 1
Fig-1 Fig-2
(c) Implement the figure-1 of the stem by basic gates. 3
Answer
(c) Applying Sum of Products (SOP) method to truth table we get –
X=A ̅ + AB = ̅̅̅̅̅̅̅̅
̅. B A ⊕ B, which is the X-NOR gate Equation.
In implementing the X-NOR gate as a fundamental gate
X = ̅̅̅̅̅̅̅̅
A ⊕ B = AB + A ̅B̅ = AB + ̅̅̅̅̅̅̅
A+B

07. [Din.B’23]
Input Output
A B C X
0 0 0 0
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 1
Fig-1 Fig-2
(c) Implement the simplified value of X obtained from Fig-1 by NAND gate. 3
Answer
(c) Applying the SOP process in Figure-1
X =A ̅ BC + AB ̅C + ABC̅ + ABC
=A ̅ BC + AB ̅C + ABC̅ + (ABC + ABC + ABC)
= (A ̅ BC + ABC) + (AB ̅C + ABC) + (ABC̅ + ABC)
= BC(A + A) + CA(B + B) + AB(C̅ + C)
̅ ̅
= AB. 1 + BC. 1 + CA. 1
= AB + BC + CA
It has to be implemented by NAND.
X = AB + BC + CA
= ̿̿̿̿
AB + BC ̿̿̿̿ + CA
̿̿̿̿
= ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅̅
AB. ̅̅̅̅
BC. ̅̅̅̅
CA.

17
08. [MB’23]
Input Output
P Q R
0 0 1
0 1 1
1 0 1
Logic Circuit 1 1 0
Fig-1 Fig-2
Truth Table
(c) Which gate is equivalent to the logic circuit? Explain. 3
(d) “It is possible to implement the gate shown in Fig-2 only by NOR Gate”-Analyze. 4
Answer
(c) From Logic Circuit we get,

̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
Y = ̅̅̅̅̅̅̅
̅+B
A ̅ + ̅̅̅̅̅̅̅
A+B
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ ̅
= (A B) + A + B = ̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅̅̅̅ AB + A ̅. B
̅
= ̅̅̅̅̅̅̅
A⨁B = A⨁B
∴ Logic circuit is equivalent to X-OR gate
(d) Applying SOP method to the Truth Table of Figure-2, we get-
R=P ̅Q̅+P ̅Q + PQ̅
̅ ̅
= P(Q + Q) + PQ ̅
=̅P. 1 + PQ̅
=P̅ + PQ ̅
̅
= (P + P)(P ̅+Q ̅)
= 1. (P̅+Q ̅)
=P̅+Q ̅
̅̅̅̅
= PQ, Which is the equation of NAND gate.
It can be implemented only by NOR, R = PQ ̅̅̅̅ = P
̅+Q ̅ = ̅̅̅̅̅̅̅
̅+Q
P ̅
09. Read the stem and answer the following questions: [DB’19]
INPUT OUTPUT INPUT OUTPUT INPUT OUTPUT
A B X A B X A B X
0 0 0 0 0 1 0 0 1
0 1 0 0 1 0 0 1 0
1 0 0 1 0 0 1 0 0
1 1 1 1 1 1 1 1 0
Fig-1 Fig-2 Fig-3
(c) Fig-1 is related to which gate? Give its description. 3
(d) Is it possible to implement the gate of figure-2 using the gate of figure-3? Give logic in favor of your
answer. 4

18
 Answer
(c) Fig 1 of the stem is related to AND gate. AND gate is described below:
A
AND gate: B C = AB

A B
AND gate circuit: evwZ
Bulb

AND gate Truth table:

Input Output
A B C
0 0 0
0 1 0
1 0 0
1 1 1
Fig 1 of the stem mainly expresses the AND gate.
(d) Fig-3 of the stem is NOR gate and fig-2 are X-NOR gate. X-NOR gate can be implemented by NOR gate.
It is discussed below:
NOR gate is a universal gate. It is possible to implement any gate using this gate.

In case of X-NOR gate: X = A ⊕ B = AB + A B = AB + A B

= AB. A B = (A + B)(A + B) = (A + B) + (A + B)
Then the logic circuit should be -
A B

X = (A + B) + (A + B) = A⨁B

Alternative:

After the discussion it can be said that gate of fig-2 can be implemented using gate of fig-1.
10. [RB’19]
M R S

X
Y
Z

(c) Determine the simplified value of Y in the stem. 3

(d) Implement the simplified value of Y using NAND gate. 4

19
 Answer
(c) In the stem,
M R S
M R S
M+R+S

M+R+S=Y
M+R+S = M+R+S

M.R.S=M+R+S
∴ Y = M + R + S = M. R. S hv Y which is the value of Y.

(d) Simplified value of Y, Y = M. R. S = M. R. S = M + R + S

Now if it is implemented by NAND gate then
M M
M.R.S = M+R+S
R R M+R+S

S S

That is, the simplified value of Y can be implemented like this.

11. [SB’19]
A
B
C Y
F = AB + A + B

Fig-1 Fig-2
(c) Determine the simplified value of Y. 3
(d) “The gate of the simplified value of F is used in binary addition”-Analyze. 4
Answer
(c)
A
ABC ABC. A+B+C
B
C

A+B+C
̅̅̅̅̅̅ ̅̅̅̅̅̅̅̅̅̅̅̅̅
Here, Y = ABC A + B + C = (A̅+B
̅ + C̅)(A
̅. B
̅. C̅) [De Morgan’s law]

̅A
=A ̅B
̅C̅ + A
̅B ̅C̅ + A
̅B ̅B̅C̅C̅ = A
̅B̅ C̅ + A
̅B̅ C̅ + A
̅B̅ C̅ [∵ A. A = A]
̅B
= A ̅ C̅(Ans. )[∵ A + A + A = A]

20
(d) F = ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
AB + ̅̅̅̅̅̅̅
A + B = ̅̅̅̅
AB. ̿̿̿̿̿̿̿
A + B [De Morgan’s law]
̅̅̅̅
= AB (A + B) = ̅
(A +B ̅)(A + B) = AA ̅+A ̅ B + AB ̅ + BB
̅
=A ̅ B + AB ̅ [∵ AA ̅ = 0] = A ⨁ B
The gate of the simplified value of F is X − OR gate.
Binary addition is done in half adder using X-OR gate.
Full-adder is a type of circuit that can add a carry bit and two number bits and output the sum and the carry bit.
The inputs of full-adder are X, Y. From Ci , sum S and carry Co are found. From input X, Y of the first
half adder, sum S1 and carry C1 and C2 are obtained. That’s why,
S2 = S1 ⨁Ci = X⨁Y⨁Ci … … … … …. (3) [Since S1 = X⨁Y; as per (1)]
and C2 = S1 Ci = (X⨁Y)Ci … … … … .. (4)
The inputs of full-adder are X, Y. From Ci , sum S and carry Co are found. So, the sum-
S = X⨁Y⨁Ci = S1 ⨁Ci = S2 … … … .. (5)
Carry, Co = XYCi + XYCi + XYCi + XYCi = Ci (XY + XY) + XY(Ci + Ci )
= Ci (X⨁Y) + XY = C2 + C1 … … … .. (6) [according to (4)]
Ci
X S1 S(S2)
Y
C1 C2
C0
12. [BB’19]
PQ R

A F

(c) Show the value of the output F in truth table. 3

(d) Is it possible to implement F using only the ‘A’ marked gate? Analyze. 4
Answer

(c) F = P + Q. (R + P) = P. Q. (P + R) = P. (Q + (P + R))

= P (Q + (P. R)) = P(Q + PR) = PQ + PPR = PQ + 0 = PQ

Truth Table:
Input 𝐎𝐮𝐭𝐩𝐮𝐭
P Q R 𝐅 = 𝐏𝐐
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 0

21
(d) From (c) we get F = PQ
Again, gate A is NOR gate.

∴ F = PQ = PQ = P + Q = P + Q
P Q

13. [CB’19]
A B

Fig-2
Fig-1
(c) Show the value of Y in truth table. 3
(d) Is it possible to implement the equivalent circuit of fig-1 using the gate represented by fig-2. 4
Answer
(c) Y = (A̅̅̅̅̅̅̅
+B ̅) + (A̅̅̅̅̅̅̅
+B ̅)
= ̅̅̅̅̅̅̅
A+B =A ̅. B
̅=A ̅B
Input 0utput
A B ̅𝐁
𝐀
0 0 0
0 1 1
1 0 0
1 1 0
(d) Fig-2 is NAND Gate.

Y=A ̅ . B = AB
Implementation by NAND Gate:

14. [DB, JB, SB, Din.B’18]

P Q R
P P+ Q + QR
X
QR
Y

(c) Show the value of Y in truth table. 3

(d) Implement the simplified value of X using NOR gate. 4

22
 Answer
(c) y = P. P. Q + Q. P = PQ + QP = P ⨁ Q
∴ Truth table of X-OR Gate is given below:
Input Output
P Q Y
0 0 0
0 1 1
1 0 1
1 1 0

(d) X = P + P + Q + Q. R = P + Q + Q. R = P + Q + Q + R [De Morgan’s law]

= P + Q + R = P. Q. R [De Morgan’s law]
In case of implementing using NOR gate:
P. Q. R = P + Q + R = P + P + Q + Q + R + R . Now the figure is shown below:
P
X
Q
R
15. Look at the diagram below and answer questions c and d: [DB’17]

(c) Simplify the output equation of the logic circuit in the stem. 3
(d) State the importance of NAND gate by implementing the value of F in the stem through NAND gate. 4
Answer
(c) F = p̅qr + p̅qr̅ + pr = p̅q(r + r̅ ) + pr = p̅q + pr [∵ r + r̅ = 1]
(d) F = p̅q + pr = ̅̅̅̅̅̅̅̅̅̅
p̅q + pr = ̅̅̅̅̅̅̅̅
̅̅
p̅̅q̅. pr
̅̅̅

Importance of NAND Gate:

Functionally the NAND gate is composed of an end and a NOT gate. So apparently, its structure may seem
harder than the basic gates. But in fact, using semiconductors to make NAND and NOR is easier and less
expensive. Moreover, another important point is the NAND gate is a universal gate.

23
 Any type of logic circuit can only be implemented by NAND gate. Such as: Output equation of X-OR gate:
f=A⊕B=,A.B+A,B, which requires two ends, two NOT and one OR gate to implement with the help of the
basic gate.

One NAND IC (74HC00), one AND IC (74HC08), and one OR IC (74HC32) usually have four NAND,
AND & OR gates respectively. And the IC of 74HC04 or NOT Gate has 6 NOT gate.
This means, on the one hand, we have to use more expensive basic gates, and on the other hand, there are
some additional unused gates, which are not useful. Now let's see what happens when implementing the X-
OR gate with NAND:

16. Read the stimulus and answer the following questions: [RB’17]
Input Output Input Output
P Q R P Q R
0 0 1 0 0 1
0 1 1 0 1 0
1 0 1 1 0 0
1 1 0 1 1 1
Truth table-1 Truth table-2
(c) Truth Table-1 Represents NAND Gate – Prove. 3
(d) Is the gate represented by truth table-2 possible to implement the gate represented by truth table-1? Analyze. 4
Answer
(c) Similar to question 09(d)
(d) True Sarani-2 represents the X-NOR gate.

Implemented by NAND: Y = ̅̅̅̅̅̅̅̅̅̅̅̅

̅ B + AB
A ̅ = ̅̅̅̅̅
A AB̅ = ̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ B + ̅̅̅̅ ̅̅̅̅̅
̅ B. ̅̅̅̅̅
A AB̅

17. Armsman Mr. Jisan room has to be kept under high security. So he has to cross 2 doors to enter his room.
Turning on either of the 2 switches on the first door opens the door. If 2 switches are turned on or off
simultaneously, it does not open. But in the case of the second door, the opposite of the first door has to be
done. [Ctg.B’17]
(c) Determine the truth table of the logic gate that the first gate of the stimulus indicates. 3
(d) Analyze the truth with the truth table of the second gate of the stem. 4

24
 Answer
(c) Let, switches A and B
When switched ON, Value = 1
When switched OFF, Value = 0
Here, if the value of two switches A and B is 0 or 1 simultaneously, the fan is off, i.e. F = 0
If one of the two is 0 and the other is 1, then the fan is on, that isF = 1, the system indicates XOR gate
where,
F=A⊕B=A ̅ B + AB ̅
Truth table:
A B F=A ̅ B + AB
̅
0 0 0
0 1 1
1 0 1
1 1 0
(d) Let there be two switches A and B; Value=1 in ON and Value=0 in OFF
Truth Table:
A B Door
0 0 1
0 1 0
1 0 0
1 1 0
18. Mr. Atiq uses the bed switch to operate the fan in his bedroom. He turned off the bed sweet as he felt cold.
As a result, the fan stopped. How is this possible, he thought, when a switch on the fan was turned on but
the fan stopped? [BB’17]
(c) Explain the reason why the fan stops by drawing the circuit of the stem. 3
(d) Does changing the stem circuit cause the fan to turn off even if a switch is turned off? Explain. 4
Answer
(c) The two switches in the stimulus are A and B
Here, the fan F will turn on only when the two switches are simultaneously ON. Otherwise, the fan will be
off.
Circuit: Here the switch is connected in two
series. If either of the two is turned off,
the circuit will be disconnected. As a
result, the fan will be turned off.

(d) If switches A and B are connected in parallel in the stimulus circuit, the fan will be ON if one of the switches
is OFF and at least one is ON .
Circuit:

If only two switches A and B are turned off in that circuit, then the circuit will be disconnected and the fan
will be off.

25
19. [SB’17]

(c) Find the simplified value of y according to the stem. 3

Answer

(c) y = AB + AB = A ⊕ B
20. [JB’17]

Fig-1 Fig-2 Fig-3

(c) Figure-1 and Figure-2 are called what type of gate? Explain 3
(d) Is it possible to implement the gate of Figure-3 only by the gate of Figure-2? Justify your answer. 4
Answer
(c) Figure 1 is NOR gate. This is the opposite of OR gate.

Figure 2 is the NAND gate. It's the opposite of AND GATE.

(d) Figure 3 is the diagram of the XOR gate:

Figure 2 is the NAND gate. XOR gate implemented by NAND gate:

Y= A⊕B = A ̅ = ̅̅̅̅̅̅̅̅̅̅̅̅
̅ B + AB ̅ B + AB
A ̅=A̅̅̅̅̅̅̅̅̅̅
̅̅̅̅̅
̅ B. ̅̅̅̅
AB̅

Alternative:

26
21. Observe the stem below- [CB’17]
A B
1
C
2

(c) Determine the simplified value of C in the stem. 3

(d) 'Basic gates can be implemented with 1st gate used in stem'. -Explain. 4
Answer
(c) C = ̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅
AB + ̅̅̅̅
AB = ̅̅̅̅
AB = AB
(d) Similar to question 06(c)
22. Observe the stem below- [Din.B’17]
A BC

(c) Simplify the value of F in the stem. 3

(d) “Simplified value of F can be implemented by NOR gate” -explain with diagram. 4
Answer
(c) F = (A + B)(A + B ̅)(A̅ + c)
= (AA ̅
+ AB + AB + BB ̅)(A̅ + C)
̅ ̅
= {A + A(B + B) + O}(A + C) = (A + A)(A̅ + C)
= A(A̅ + C) = AA ̅ + AC = O + AC = AC
(d) To be 'C', F = AC implemented by NOR gate : F = AC = ̅̅̅̅
AC = ̅̅̅̅̅̅̅
̅ + C̅
A

___ ____
23. F = AB + B C [DB’16]
(c) Construct a truth table based on the function in the stem. 3
(d) Is it possible to implement the function with only NAND gates in the stem? Analyze. 4
Answer
(c) F=A ̅B + B̅C
Truth Table:
A B C A ̅ ̅ A
B ̅B ̅C
B F=A̅B + B
̅C
0 0 0 1 1 0 0 0
1 0 0 0 1 0 0 0
0 1 0 1 0 1 0 1
0 0 1 1 1 0 1 1
1 1 0 0 0 0 0 0
1 0 1 0 1 0 1 1
0 1 1 1 0 1 0 1
1 1 1 0 0 0 0 0
(d) Similar to question 03(d)

27
 _____ _____ ______ _______
24. X = AB + BC , Y = AB . C + ABC + AB + BC [RB’16]
(c) Show that X is implemented using only NOR gates. 3
(d) Simplifying “Y” to Boolean Algebra Simplifies Circuit Implementation” – Analyze. 4
Answer
(c) Similar to question 09(d)
(d) Y = ̅̅̅̅ ̅̅̅̅
ABC + ABC + AB + BC
Its circuit:

Simplifies Y with Boolean algebra:

̅̅̅̅C + ABC + AB + BC
Y = AB ̅̅̅̅
= (AB + AB)C + AB + ̅̅̅̅
̅̅̅̅ BC
̅̅̅̅
= 1. C + AB + BC = C + AB + B ̅+C̅
= (C + C ̅ ) + AB + B̅ = 1 + AB + B
̅
=1
Here, the value of Y is always 1, i.e. the circuit will always be ON.

∴ Simplification does not require a gate to implement the circuit.

25. [Ctg.B’16]

scenario-2 scenario-2
(c) Find the simplified value of y. 3
(d) Compare the simplified value of y with the logic gate obtained from the truth table of scenario-2. 4
Answer
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅ ̅̅̅̅̅̅̅̅̅
(c) Y = (A + B). (A A + B + ̅̅̅̅
̅ B + B) = ̅̅̅̅̅̅̅ ̅B + B
A
̅̅̅̅̅̅̅̅̅̅̅̅̅
= ̅̅̅̅̅̅̅
A+B+A ̅+B ̅ + B = ̅̅̅̅̅̅̅
A + B + ̅̅̅̅̅̅̅
A+1
= ̅̅̅̅̅̅̅
A + B + 1̅ = ̅̅̅̅̅̅̅
A+B

28
(d) The truth table of scenario 2 represents X-OR gate.

Diagram of X-OR gate :

To be 'c', ; it Y = ̅̅̅̅̅̅̅̅
A + B represents the NOR gate.

Truth Table og NOR gate:

A B ̅̅̅̅̅̅̅̅
A+B
0 0 1
0 1 0
1 0 0
1 1 0
Comparing the truth table of the two gates, we get:
At least one or both of A and B in the NOR gate are Ouput 0 if they are 1, and both A and B are 0 if
Output 1.
On the other hand, if the odd number of 1 in the input values between the values of X-OR gate A and B
will be output 1, otherwise output will be 0.
_____ ____
26. F= A B+ BC [BB’16]
(c) Draw and explain the logic diagram of the stem function. 3
(d) Is it possible to implement the stem function with only NAND gates? Do the analysis. 4
Answer
(c)

(d) Similar to question 23(d)

27. [SB’16]

Observe the logic circuit of the stem and answer the following questions.
(c) Implement the value of Q using a NOR gate. 3
(d) The logic circuit used in the stem can be implemented with the minimum number of gates—Verify the
statement analytically. 4

29
 Answer
(c) Similar to question 04(d)
(d) Here, by simplifying P,
P = ̅̅̅̅̅̅̅̅̅
̅̅̅̅
x̅ y. ̅̅̅̅
x y̅ = ̅̅̅̅̅̅̅̅̅̅
x̅ y + xy̅ = x̅ y + xy̅ = x⨁y
Simplifies Q,
Q = ̅̅̅
xy = xy
Implementation by minimum number of gates:

28. Take a look at the stem below and answer the question below- [Din.B’16]

Fig-1 Fig-2
(c) Construct the truth table of Figure-1. 3
Answer
(c) Similar to question 09(c)

T-03: Integrated Circuit and Digital Devices

01. [BB’23]

Fig-1 Fig-2 Fig-3

(d) Which of Fig-2 and Fig-3 is more suitable for addition? Explain. 4
Answer
(d) Figure 2 refers to Half Adder and Figure 3 to Full Adder. Full adder is more useful than half adder for
addition. The circuit we use to add 2 bits is called half adder whereas the circuit which adds two bits and
carry is called full adder circuit. Since the carry bit must be added in addition to the two bits added, the full
adder takes a total of 3 input bits. Outputs the sum and carry bits. On the input lines of a half adder, only the
bits of the two numbers being added can be added. But the carry bit cannot be added. Full adder, on the other
hand, has three input lines, so the bits of the two numbers being added can also be manipulated with bits and
the result is obtained accordingly. So full adder is more useful.

30
02. [JB’23]

(c) Implement the stem’s circuit by NOR gate. 3

(d) By increasing the number of one of the inputs in the stem’s circuit, implement the new circuit formed
by the previous circuit. 4
Answer
(c) The stem is pointing to the half adder.
The output equation of the half adder is as follows: Carry = AB
Sum = A+B
Transforming to NOR operation:

Carry = AB = AB = A + B Its circuit diagram is as follows:

Sum = A ⊕ B

= A ⊕ B = AB + AB = 0 + AB + AB + 0

= AA + AB + AB + BB

= A(A + B) + (A + B)B

= (A + B)(A + B) = (A + B) + (A + B)
(d) Incrementing an input in the circuit of the stem turns it into a full adder.
Below is the implementation of a full adder using a half adder:

Figure: Implementation of full-adder using half-adder

03. Look at the two pictures below and answer the questions: [CB’23]
A B X
0 0 1
0 1 0 N 2N
1 0 0
1 0 1
Fig-1 Fig-2
(d) If N=3, analyze the stem’s Fig-2 by constructing the truth table and circuit diagram for Fig-2. 4

31
 Answer
(d) Figure-2 mainly indicates Decoder.
If N = 3 , 2N = 23 = 8
∴ It is 3 × 8 decoder.The block diagram of the circuit is:
Its truth table:
Input Output
X Y Z D0 D1 D2 D3 D4 D5 D6 D7
0 0 0 1 0 0 0 0 0 0 0
0 0 1 0 1 0 0 0 0 0 0
0 1 0 0 0 1 0 0 0 0 0
0 1 1 0 0 0 1 0 0 0 0
Figure: Block diagram of 3×8 line 1 0 0 0 0 0 0 1 0 0 0
decoder 1 0 1 0 0 0 0 0 1 0 0
1 1 0 0 0 0 0 0 0 1 0
1 1 1 0 0 0 0 0 0 0 1
Figure: Truth table of 3×8 line decoder

Function: From truth table we get,

D0 = x̅ y̅ z̅ D4 = x y̅ z̅
D1 = x̅ y̅ z D5 = x y̅ z
D2 = x̅ y z̅ D6 = x y z̅
D3 = x̅ yz D7 = x y z

04. [Din.B’23]
Input Output
A B C X
0 0 0 0
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 1
Fig-1 Fig-2
(d) Is it possible to implement a full addition circuit by Fig-2? Do the analysis. 4

32
 Answer
(d) It is not possible to implement Full-Adder circuit by Fig-2.
Figure-2 is a Half-Adder, its truth table: On the other hand, truth table for Full Adder:
Input Output Input Output
A B C0 S A B Ci Co S
0 0 0 0 0 0 0 0 0
0 1 0 1 0 0 1 0 1
1 0 0 1 0 1 0 0 1
1 1 1 0 0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1
As we can see, Half Adder always adds two bits to give sum and output carry bit and Full Adder always
adds three bits to give sum and carry bit.
In the case of addition of two binary numbers, the addition of two bits is enough to determine the sum bit in
the rightmost cell [cell of 20] and the carry bit relative to it. But the cells to its left [21 and higher exponents]
may require addition of the carry bit in addition to the two bits of the number to be added. That is, in the
case of complete addition, a circuit capable of determining the sum and output carry of three bits is needed
in all cells except the rightmost cell. Although the work can be done by Full-Adder, it cannot do Image-2 of
the stem ie Half Adder. Hence, implementation of full summation circuit by Fig-2 is impossible.
However, a full adder can be made with 2 half adders, in which case the implementation of a full adder
circuit is possible.
05. [Ctg.B’19]

(c) Implement the above circuit using basic gates. 3

(d) Implement the new circuit that can be found by decreasing an input number using NAND gate. 4
Answer
(c)
The circuit of the stem is a full adder. S = X ⊕ Y ⊕ Ci
X =X̅ Y ̅ Y C̅i + X Y
̅ Ci + X ̅ C̅i + XYCi
S
Y F/A
Ci Co Co = YCi + XCi + XY

X Y Ci

Co

33
(d) The new circuit that can be found by decreasing an input number on the circuit of the stem is a half adder.
X H/A S
Y C

S=̅ X Y + XY̅ C = XY = XY
= ̿̿̿̿̿̿̿̿̿
̅Y. XY
X ̅
̅̅̅̅̅̅̅̅̅̅
= ̅̅
̅̅̅
X Y. ̅̅ ̅̅
XY̅
X Y

06. [JB’19]
Ci S
A F/A Co
B
Fig-1 Fig-2 Fig-3
(c) Describe the circuit for summation formed by combination of fig-1 and fig-2. 3
(d) It is possible to implement fig-3 using the combined circuit of fig-1 and fig-2. 4
Answer
(c) Half adder is created by the combination of fig-1 and fig-2 which acts as the circuit for summation.
The adder that can add 2 bits and can hold the carry bit is called a half adder.
A half adder is created by the combination of an X-OR gate and an AND gate. Fig-1 is X-OR gate and fig-
2 is AND gate. The half adder formed by their combination is showed below:

Logic circuit Block diagram

(d) Half adder is created using fig-1 and fig-2. Again, it is possible to make fig-3 or full-adder using two half
adders. Implementation of full adder using half adder:
The work of a full adder can be done using two half adders. Inputs of the full adder are X, Y. From
Ci , sum S and carry Co are found. To make a full adder using half adder, 2 half adders and an OR gate are
needed. From input X, Y of the first half adder, sum S1 and carry C1 are obtained. From input S1 and C1
of the second half adder, sum S2 and carry C2 are obtained. S2 is the sum S of the full adder.
X S
Y F/A
Ci Co
Figure: Symbol of full adder

34
 Now adding carry C1 and C2 by an OR gate, the carry Co of full adder is found.
A block diagram is shown below-

X C1
F/A C2 Co
Y
H/A S2
Ci S
In the figure below, the implementation of a full adder by two half adders using logic gates si shown:
Ci
Ci S1 S
X S1
Y C2
C1 Co
C1
Figure: Implementation of full adder using half adder
In this way a full adder can be created using two half adders.
07. [Din.B’19]

Block diagram-A Block diagram-B

(c) Draw the truth table and logic circuit by marking the block diagram-A. 3
(d) Which of the two block diagrams has significant role in converting computer understandable language
to human understandable language? Analyze. 4
Answer
(c) Block diagram-1 is encoder. It is mainly an 8 to 3 encoder.
Octal encoder: In an 8 to 3 encoder for 8 inputs, 3 output lines are found. So, with the help of it octal number
can be converted to binary. For this it is called octal to binary encoder.
O0 Input Output
O1 X O0 O1 O2 O3 O4 O5 O6 O7 X Y Z
O2 Y
O3 8 to 3 Z 1 0 0 0 0 0 0 0 0 0 0
O4 Encoder 0 1 0 0 0 0 0 0 0 0 1
O5
O6 0 0 1 0 0 0 0 0 0 1 0
O7 0 0 0 1 0 0 0 0 0 1 1
0 0 0 0 1 0 0 0 1 0 0
0 0 0 0 0 1 0 0 1 0 1
0 0 0 0 0 0 1 0 1 1 0
0 0 0 0 0 0 0 1 1 1 1

35
 Output equations-
X = O4 + O5 + O6 + O7
Y = O2 + O3 + O6 + O7
Z = O1 + O3 + O5 + O7
Oo O1 O2 O3 O4 O5 O6 O7

(d) In converting computer understandable language to human understandable language, the role of block
diagram-2 is significant.
Block diagram-2 is a decoder. So, for getting 2n number of outputs, n number of inputs are required. The
given figure is of a 2 to 4 decoder. Binary number is decoded using decoder.
In a 2 to 4 decoder, one of the 4 output lines from 2 input lines has 1. 1 is found in one of the output lines
and the rest of the outputs are 0. But which line will have 1 it depends on the input lines. Here truth table
and equation for a 2 to 4 single bit decoder is shown:
Truth Table
A1 Ao D3 D2 D1 Do
0 0 0 0 0 1
0 1 0 0 1 1
1 0 0 1 0 0
1 1 1 0 0 0
Mean term Equations
Do = A1 . Ao D1 = A1 . Ao
D2 = A1 . Ao D3 = A1 . Ao

08. Adnan Jami asked his uncle to know the sum of two numbers (E)16 and (7)8 . Uncle showed Adnan Jami
the sum and said that all the mathematical operations inside the computer like––addition, subtraction,
multiplication, division are done by a single operation, and addition also uses one type of circuit. [RB’17]
(d) Show the process of adding these two numbers using the circuit mentioned by uncle. 4
Answer
(d) Similar to question 05(c)
09. Observe the block diagrams and answer the following questions. [CB’16]

Block diagram-1 Block diagram-2

(c) Explain Block diagram-1 with basic gates and explain truth table by drawing logic circuit. 3
Answer
(c)

Truth Table:
A B S C
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
(d) Similar to question 06(d)

36
10. Answer the questions based on the stem below.
[Din.B’16]

Fig-1 Fig-2
(d) Analyze the role of diagram in the stem in making binary addition circuit. 4
Answer
(d) Similar to question 06(d)

T-04: Clock Sequential Circuits (Latches, Flipflop and Counter)

01. [JB’23]

(c) Explain the device encircled with dots (......) in the stem. 3
(d) What will be the values of X, Y and Z when the 4th, 5th and 7th clock pulse is applied to the stem image?
Analyze. 4
Answer
(c) In the stem, the device surrounded by dots (…) is a 3 to 8 decoder.
Decoder is basically the reverse device of encoder. This will give 2n number of outputs for n number of
inputs.

If N = 3 then, 2N = 23 = 8
∴ It is 3 × 8 decoder. Block diagram of the circuit:
Truth table:
Input Output
X Y Z D0 D1 D2 D3 D4 D5 D6 D7
0 0 0 1 0 0 0 0 0 0 0
0 0 1 0 1 0 0 0 0 0 0
0 1 0 0 0 1 0 0 0 0 0
0 1 1 0 0 0 1 0 0 0 0
1 0 0 0 0 0 0 1 0 0 0
1 0 1 0 0 0 0 0 1 0 0
Figure: Block diagram of : 3 × 8 line decoder 1 1 0 0 0 0 0 0 0 1 0
1 1 1 0 0 0 0 0 0 0 1
Figure: Truth table of 3 × 8 line decoder

37
 Drom truth table we get,
Function:
D0 = x̅ y̅ z̅ D4 = x y̅ z̅
D1 = x̅ y̅ z D5 = x y̅ z
D2 = x̅ y z̅ D6 = x y z̅
D3 = x̅ yz D7 = x y z

(d) The picture given here is a picture of a ripple counter. The table of the ripple counter looks like this-
Clock Pulse q2 q1 q0
0 0 0 0
1 0 0 1
2 0 1 0
3 0 1 1
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
We can say that the output will be 100 in the 4th clock pulse, 101 in the 5th clock pulse, 111 in the 7th clock
pulse.
02. [SB’17]

(d) Evaluate the logic circuit obtained by interchanging the gates marked No. 2 and 3 of the stem for use in
a binary addition circuit. 4
Answer
(d) The two gates marked 2 and 3 are interchanged in the stimulus,

here, Y = (A̅ + B)(A + B

̅) = A ̅A + A
̅B̅ + AB + BB ̅B
̅ = AB + A ̅ = ̅̅̅̅̅̅̅̅
A⊕B
It is the X-NOR gate, but the X-OR and AND gate are used in binary addition circuits, so the circuit is not
usable.

38
 CQ Knowledge-Based Questions & Sample Answers from Previous Board Exams

01. What is the ASCII code? [DB’23; RB, Ctg.B’19]

Ans: The full form of ASCII is American Standard Code for Information Interchange. It is an Alphanumeric
Code consisting of either 7bit (ASCII-7) or 8bit (ASCII-8), which uniquely computer codes 128 or 256
symbols (digits, letters, punctuation etc.) respectively.
02. What is called the counter? [DB, Din.B’23; DB, JB, SB, Din.B’18]
Ans: Counter is one kind of special Sequential Integrated Circuit, which is capable
of counting the number of provided clock pulses.
03. What is a signed number? [RB’23]
Ans: All positive and negative numbers including 0 are collectively called signed numbers.
04. What is an Encoder? [RB, MB’23; DB’19; BB’17; JB’16]
Ans: A 2n Line – to – n Line digital integrated circuit or device for converting each of 2n number of different
inputs into n-bit binary code is called Encoder.
05. What is BCD code [Ctg.B’23; SB, JB’19; CB’17; DB, Din.B’16]
Ans: Full form of BCD is Binary Coded Decimal. It is a numeric code that converts each decimal digit to
its 4 bit binary equivalent. That is, BCD code of t digit decimal number is 4×t bits.
Example: (1093)10 = (0001 0000 1001 0011)BCD
06. What is Adder? [Ctg.B, CB’23; BB, Din.B’19]
Ans: Adder is an associative/integrated circuit which performs binary addition.
07. What is register? [SB’23; RB’19; BB, CB’17; CB’16]
Ans: Register is a type of memory device consisting of a set of flip-flops. A register can hold bits .An n-bit
register contains n flip-flops.
08. What is bit? [SB’23]
Ans: The full form of bit is binary digit, basically every digit of any code written in binary number system
or binary code is called bit.
09. What is flipflop? [BB’23]
Ans: Flipflop is a specialized digital circuit that can hold any one bit and can change rapidly as needed.
10. What is base? [BB, Din.B’23; DB, Ctg.B’17]
Ans: The Coordinate number system has many basic mathematical symbols as digits that can be used to
form a number in a specific number system are called the base of the corresponding number system.
11. What is the radix point? [JB’23]
Ans: In decimal number system, the point given to separate whole part and fraction is called Radix point.
The digits to the left of the Radix Point are decimal exponent with positive integers and the digits to the right
are decimal exponent with negative integers.
12. What is the mode number of the counter? [JB’23; SB’19]
Ans: In counter logic, the total number of states of the count sequence is called the MOD Number of the
counter.
13. What is positional number system? [CB’23]
Ans: Numerical system in which Digits have local value based on their position in addition to their own
value, is called Positional Numerical System.
14. What is meant by number system? [MB’23; SB’17]
Ans: The method of expressing numbers through symbols, calculation and calculation is called Number
System.
15. What is binary number system? [DB’19]
Ans: The number system consisting of only 2 digits 0 and 1 is called binary number system.

39
16. What is Unicode? [Ctg.B, CB, Din.B’19, RB’17]
Ans: Unicode is used to code every language around the world - big or small into the computer. Unicode is
mainly a 2 byte or 16 bit code. By this code 65,536 or 216 number of unique symbols can be specified.
17. What is Universal Gate? [Ctg.B, JB’19]
Ans: All types of gates can be implemented by using NAND gate and NOR gate, so they are called universal
gates.
18. What is code? [BB’19; DB, JB, SB, Din.B’18; Din.B'17; RB’16]
Ans: To make the CPU understand each letter, number, or special symbol used in a computer system
separately, unique signals are created using different formats of bits (0 & 1). This unique signal is called
code.
19. What is truth table? [Din.B’19]
Ans: The table where different values of the variable as input and value of the function as the output are
expressed together is called truth table.
20. What is Boolean postulate? [DB’17]
Ans: Some rules are assumed to be true for summation and multiplication in Boolean Algebra. These rules
are called Boolean postulates.
21. What is logic gate? [Ctg.B’17, SB, BB’16]
Ans: The Digital Electronic Circuit that is used to implement the basic operations of Boolean Algebra:
logical OR, Logical AND Logical NOT.
22. What is decoder? [SB’17]
Ans: Decoder is a type of digital circuit that converts code or computer understandable language to human
understandable language That is decoder converts digital signal to analog signal.
23. What is 2’ Complement? [SB’17]
Ans: The number that is obtained by reversing every bit of a binary number is called 1’s complement. The
number obtained by adding 1 to the 1’s complement of the binary number is called 2’s complement.
24. What is Boolean Algebra? [JB’17]
Ans: George Boole was the first to discover the relation between Mathematics and logic and made a type of
algebra on the basis of Mathematics and logic which is called Boolean Algebra.

CQ Comprehensive Questions & Sample Answers from Previous Board Exams

01. “It is possible to convert coded data into uncoded data.”—Explain. [DB’23; JB’19]
Ans: The expression refers to the circuit called decoder.
Decoder mainly is a n-to-2nline circuit, Which basically converts any code converted to n-bit code to actual
value. such as: 2-to-4 Decimal Decoder
Input Output Product
X Y 𝐃𝟎 𝐃𝟏 𝐃𝟐 𝐃𝟑
0 0 1 0 0 0 𝐃0 = x̅ y̅
0 1 0 1 0 0 𝐃1 = x̅ y
1 0 0 0 1 0 𝐃2 = x y̅
1 1 0 0 0 1 𝐃3 = yy Fig: Logic circuit of 2 × 4 Line Decoder

40
02. 'Binary and BCD are not the same.'—Explain. [DB’23]
Ans: Difference between BCD code and Binary numbers:
BCD code Binary Numbers
(i) BCD code is not a number system. (i) Binary code is a number system.
(ii) It is used to express decimal numbers into (ii) In this number system, only two numbers
binary numbers. (0,1) are used.
(iii) Expressing decimal numbers in BCD code is (iii) It is quite difficult to express decimal
very easy. numbers into binary numbers.
(iv) Only remembering the binary equivalents of
(iv) Determining binary numbers requires
the decimal numbers 0 to 9 is sufficient for
calculations.
performing calculations.
(v) It takes more amount of bits to express any (v) It takes less amount of bits to express any
number in BCD code. number in binary number system.
(vi) For example: The BCD code of (137)10 is (vi) For example: The binary equivalent of
= (0001 0011 0111) BCD (137)10 = (10001001)2
Thus, "Binary and BCD are not the same" - the saying is correct.
03. Explain, “ASCII code is an alphanumeric code.” [RB’23]
Ans: ASCII code is one type of Alphanumeric code. Alphanumeric code is the code used to express the
data contained in all buttons including all letters, mathematical symbols, special meaning symbols, digits
from 0-9 on computer keyboard errors. ASCII is one such alphanumeric code. Its full form is American
Standard Code for Information Interchange. In ASCII-7 and ASCII-8, 7 and 8 bits respectively are used to
express 27 = 128 ও 28 = 256 unique symbols. This code is widely used in microcomputers. This code is
used to exchange alphanumeric data between the computer and the device used for input/output (eg:
keyboard, mouse, monitor, printer, etc.).
04. De-Morgan's theorem makes the interchange between rational addition and rational multiplication – Explain.
[RB’23]
Ans: De-Morgan’s 1st Theorem:
̅̅̅̅̅̅̅̅…..= A
ABCD ̅+ B
̅ + C̅ + D
̅ + …….
There are NOT and OR (Boolean/Logical Addition) operations on the right side, and NOT and AND
(Boolean/Logical Multiplication) operations on the left side.
De-Morgan’s 2nd theorem:
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
A+B+C+D = A ̅. B
̅. C̅. D
̅ … ….
There are NOT and OR (Boolean/Logical Addition) operations on the left side, and NOT and AND
(Boolean/Logical Multiplication) operations on the right side.
That is, in both de Morgan's theorems in Boolean algebra, we can see that both sides are NOT operations,
and if one side has OR, the other side has AND. That is, in simple terms, De-Morgan's theorem makes the
trade-off between rational addition and rational multiplication.

41
05. Explain 5 + 3 = 10. [Ctg.B’23; Ctg.B’17]
Ans: 5 + 3 = 10 ⇒It is possible in Octal system.
In our daily calculation (Decimal) rule, 5 should be 5 + 3 = 8. But Octal has no digits except 0,1,2,3,4,5,6
and 7. So, (5)8 + (3)8 = (5)8 + (2)8 + (1)8 = (7)8 + (1)8 is fine, then 1 is added to 7, meaning 7 goes
to the next digit. Since 8 is not missing, the cycle of 80 is completed once. As a result, the cell of 80 is
reset to 0 again, but the cell just to its left increases by 1.
∵ (7)8 = (07)8 ∴ 81 cell had 0 before addition.
∴ After addition (0 + 1) = 1.
∴ In octal,
(7)8 + (1)8 = 108
⇒ (5)8 + (2)8 + (1)8 = (10)8
∴ (5)8 + (3)8 = (10)8
06. Explain P + 1 = 1. [Ctg.B’23]
Ans: P+1 is the OR operation between P and 1. This can be shown in the Electrical Circuit Diagram:

Here, whether the P switch is ON(1) or OFF (0), Parallelly Connected the bulb will always be ON(1) as the
other switch is 1(ON).
This can be shown in the truth table as follows:

∴ P + 1 = 1, it is called Identity Law of Boolean Algebra OR operation.

07. Prove the De. Morgan’s theorem by truth table. [SB’23]
nd
Ans: De-Morgan's 1st theorem = ̅̅̅̅̅̅̅
x + y = x̅. y̅ x𝑦 = ̅̅̅̅̅̅̅
De-Morgan's 2 theorem = ̅̅̅ x+y
Input Process Output Input Process Output
x y x̅ y̅ x + y ̅̅̅̅̅̅̅
x+y x̅. y̅ x y x̅ y̅ xy xy
̅̅̅ x̅ + y̅
0 0 1 1 0 1 1 0 0 1 1 0 1 1
0 1 1 0 1 0 0 0 1 1 0 0 1 1
1 0 0 1 1 0 0 1 0 0 1 0 1 1
1 1 0 0 1 0 0 1 1 0 0 1 0 0

Same Same
08. Explain code that integrate almost all languages. [SB’23]
Ans: Unicode is the code that unites almost all languages.
The code used to encode all major and minor languages in the world is known as Unicode. Unicode was
developed in 1991 by a group of computer engineers from Apple Inc and Xerox Corporation. It is a 2 byte
or 16 bit code that can specify 216 or 65,536 symbols. As a result, it has been possible to express the
languages of many countries through this code. Bengali has started to be used through Unicode in Windows
from the Windows 2000 version of the operating system.

42
09. Why NAND gate is called universal gate? [BB’23]
Ans: Any Boolean function basically has at most three types of operations. For example: AND, OR and
NOT molecular gates can be implemented with the help of NAND gates, so NAND gates are called universal
gates.
Implementation of NOT Gate by NAND:
Q = A. A = A, which is the equation of NOT gate.
Implementation of AND Gate by NAND:

Q = AB. AB = AB = AB , which is the equation of AND gate.

Implementation of OR Gate by NAND:

Q = A. B = A + B = A + B , which is the equation of OR gate.

10. “Unicode has changed the alphabets of all native languages of the world to computer alphabets” -Explain.
[BB’23]
Ans: Unicode converted all the world's native language characters to computer characters.
All the world's languages are coded through the use of Unicode, which specifies 65,536 unique symbols. By
using Unicode, 65,536 characters can be specified by 2-byte or 16-bit codes. As a result, all languages of the
world can be properly expressed through it. Among these Hex 0980 to Hex 09FF represent Bengali letters
and symbols. Thus Unicode represents all languages of the world.
11. Show how 9 + 7 = 20 is possible. [JB’23]
Ans: 9 + 7 = 20 is only possible when 9 and 7 are decimal or hexadecimal and this 20 is 20 in octal.
(9 + 7)10 = (16)10

∴ (16)10 = (20)8
12. Showed D-Morgan's 1st theorem for 2 variables by circuit. [JB’23]
Ans: De Morgan's 1st Theorem: A + B = A . B
Left Hand Side Right Hand Side

The last gate in the figure on the right is an AND gate.

That is, the same output will be obtained from the above two circuits.
13. Which requires more bits among the BCD code and binary number equivalent to (14)10? Explain.
[CB’23; BB’17]
1 4
Ans: (b) (14)10 = ⏞
0001 ⏞
0100 = (0001 0100)BCD ⇒8 bit

∴ (14)10 = (1110)2 ⇒ 4 bit

That is, BCD requires more bits than Binary. And it is always true that BCD will require the same or more
number of codes as binary.

43
14. What is required to find the value of a number in positional number system? Explain. [CB’23]
Ans: To find the value of a number in the positional number system, 3 things need to be known:
1. Each digit has its own value
2. Basics of number system
3. The local value of the digits of the number
Example- In hexadecimal number system 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E each digit value is 0, 1, 2,
3, 4, 5 , 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 respectively. Base of the number system is 16.
Then the value of 4B3 = 4 × 162 + 11(𝐵) × 161 + 3 × 160 = 4 × 256 + 11 × 16 + 3 × 1 = 1203
15. Which is the most commonly used 8 bit? Explain. [Din.B’23]
Ans: The most widely used 8-bit code is the ASCII-8 code, which is basically an improved version of ASCII-7.
ASCII-8

`
The ASCII-7 version did not have a parity bit.
The full form of ASCII is American Standard Code For Information Interchange. ANSI invented this
alphanumeric code in 1963. ASCII was originally a 7-bit code, with the first three zone bits and the next
four value bits. This allows 27=128 unique characters to be encoded. Among these were 32 Command
Characters and 96 Symbolic Characters Among the Symbolic Characters there were '0'-'9' 'a'-'z' and 'A'-'Z'
in addition to numbers. The Zone bits of the digits were 011, that is, to write the ASCII-7 code of 5, the 4-
bit binary value of 5 must be given with 011.(5)10 = (101)2 = (0101)2
∴ ASCII-7code of 5 ⇒ 011⏟ 0101
⏟
𝑧one value
Later, when more characters were required to be computer coded, an additional bit was added called the
parity bit, resulting in ASCll-7 being upgraded to ASCll-8. The question focuses on this code itself. In this
case, (000 0000)ASCII−7 to (111 1111)ASCll−7 becomes (000 0000)ASCII−7 to (0 111 1111)𝐴𝑆𝐶11−8 , and
new characters are encoded from (1 000 0000)ASCll−8 to (1 111 1111)ASCll−8 ) keeping the value of these
first 128 identical.
The currently widely used unicode is basically the extended version of ASCll-8.
16. Which circuit has 2n number of inputs and n number of outputs? Explain. [Din.B’23]
Ans: If the encoder inputs are 2n, then the number of outputs is n.
As we know, it is possible to express a total of 2n different numbers from 0 to maximum 2𝑛−1 by n bits.
That is, if we want to see for 2n different inputs, how much is its binary code, i.e. want to encode it, then we
have to use n bits, that is, we have to keep n number of Output Lines. The circuit used in this work is called
Encoder. That is, the circuit mentioned in the question is Encoder.
17. Explain, 'Output is the logical opposite of Input'. [MB’23]
Ans: The statement basically refers to NOT Gate.
We get from the principle of Boolean complement:
0̅ = 1; 1̅ = 0; A. A̅ = 0; A + A̅=1
NOT Gate also basically works as Logical Inverter, it gives Output = 0 if Input signal is 1, Output = 1 if
Input Signal is 0.
̅̅̅̅̅̅̅
That is, the output of the NOT gate = Input

44
18. How 6 + 5 + 3 = 1110- Explain. [DB’19]
Ans: If 6, 5, 3 are expressed in Octal, Hexadecimal or Decimal and their sum is expressed in binary number
then 6 + 5 + 3 = 1110. In hexadecimal, decimal or Octal-
(6 + 5 + 3)8 = (16)8 = (1110)2
(6 + 5 + 3)10 = (14)10 = (1110)2
(6 + 5 + 3)16 = (E)16 = (1110)2
That is, the relationship is possible.
19. Unicode can understand “Bangla language”- Explain. [DB’19]
Ans: Unicode is a type of alpha numeric code. Unicode is a 2 byte or 16 bit code using which 65,536 or 216
number of unique symbols can be specified. With the help of Unicode all languages around the world-big
or small, can be coded into computer easily. Unicode is compatible with the ASCII code. That is, the first
256 codes of Unicode are similar to the 256 codes of ASCII. Since Bangla language is also included in the
Unicode so it can understand the Bangla language.
20. 2’s complement make the digital circuits simple-Explain. [RB’19]
Ans: 2’s complement is one of the ways to convey negative values. It simplifies the circuit. It is because-
(i) Complex circuit is needed to form real value which is not needed in 2’s complement.
(ii) In 1’s complement +0 and −0 are found which is not found in 2’s complement.
That’s why 2’s compliments make the circuits simple.
21. Simplify F = AB + AC + BC. [RB’19]
Ans: Given that, F = AB + AC + BC = AB + C(A + B)
= (AB + C). (AB + A + B) = (AB + C)(B(A + 1) + A) = (AB + C). (A + B)
which is the simplified form.
22. Explain "1 + 1 + 1 = 1". [Ctg.B’19]
Ans: In case of Boolean Algebra, 1 + 1 + 1 = 1. As per the Boolean axiom of Boolean Algebra,
1 + 1 = 1. Again, according to Associative law, (1 + 1) + 1 = 1 + (1 + 1).
Therefore, 1 + 1 + 1 = (1 + 1) + 1 = 1 + 1 = 1
23. Explain the circuit to convert the language of computers to human understandable language. [Ctg.B’19; DB'17]
Ans: The circuit to convert the language of computers to human understandable language is the decoder.
Decoder is a digital circuit in which from n number of inputs, 2n number of outputs are obtained where
maximum one output line contains 1 and the rest are 0. It depends on the inputs which output line will have
1. Different types of decoders are used among which 2 to 4 decoder, 3 to 8 decoder, 4 to 16 decoder are
popular. It is possible to implement two 2 to 4 decoders. Also, it is possible to implement two 8 to 3 decoders
and it is possible to implement a 4 to 16 decoder using two 3 to 8 decoders.
24. “Only the sign changes when 2’s complement is done”-Explain. [SB’19]
Ans: Only the sign of the number is changed when 2’s complement is done.
2’s complement is formed by adding 1 to the 1’s complement. In this case, the sign bit is also changed.
Negation of binary numbers consisting of signs is done by converting them to 2’s complement. That’s why
using summation, the difference of two numbers can be found out. As in this case, only negation is done, so
the value does not change only the sign changes.

45
25. How many NAND gates are needed to implement an AND gate with 5 inputs? Explain. [SB’19]
Ans: 4 NAND gates are needed to implement an AND gate with 5 inputs.
5 inputs of the AND gate A1 A2 A3 A4 A5.
A1 A1 A2
A1 A2
A2
A1 A2A3 A4
A3 A3 A4 A1 A2A3 A4
A3 A4
A4 A1 A2A3 A4A5
A1 A2A3 A4A5
A5

26. A 4-bit binary counter can count how many numbers? Explain. [BB’19]
Ans: A 4-bit binary counter can count from 0 to 15.
Counter is a type of sequential circuit that can count the number of pulses given to it as input. Counter is a
type of register that is used for special purpose. The input pulse of the counter (which is called a count pulse)
can be any other pulse than the clock pulse. The count may come after a certain period of time or may also
come irregularly. Counter can follow different types of sequence or order bit the easiest and simple sequence
is the binary sequence The counter that follows binary sequence is called a sequence counter. An n bit binary
counter is a circuit made of n number of flip-flops and corresponding gates that can follow the sequence of
calculations of n binary bit, that is, from 0 to 2n – 1.
27. The number next to FF is 100 – Explain. [BB’19]
Ans: In hexadecimal number system, the number next to (FF)16 is (100)16 . Hexadecimal number system
consists of 16 digits: 0 to 9, A, B, C, D, E, F. So (FF)16 is the highest 2-digit number in this system. The
number next to it will be the smallest number consisting of 3 digits. That’s why the number next to (FF)16
is (100)16 .
28. It has been possible to code all the languages of the world-Explain. [JB’19]
Ans: It has been possible to code all the languages of the world using Unicode by which 65,536 number of
unique symbols has been specified. Using the Unicode 216 symbols can be specified through 2 byte or 16
bits. As a result, all languages around the world can be expressed using it. In it Hex 0980 to Hex 09FF
expresses Bangla letters and symbols. In this way Unicode expresses all the languages around the world.
29. Is 9 + 7 = 10 possible? Explain. [CB’19]
Ans: 9 + 7 = 10 is only possible when calculate in hexadecimal number system.
The system of writing or expressing any number is called number system. The base of the hexadecimal
number is 16 that is there are 16 digits here (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F). For this 10 comes here
instead of 16 in decimal number system. That’s why 9 + 7 = 10 in hexadecimal number system.
30. Explain M (M + N) = M. [Din.B’19, CB’16]
Ans: M(M + N) = MM + MN = M + MN = M(1 + N) = M. 1 = M
31. Explain the number system used in digital devices [Din.B’19, CB’16]
Ans: The number system used in digital devices is binary number system that only deals with 0 and 1. Binary
number system only works with two numbers. In this case generally logic 0 means from 0 to +0.8 Volt and
logic 1 means from +2 Volt to +5 Volt. In this case 0.8 to 2 is not defined. Usually, 0 indicates OFF and 1
indicates ON. In this way binary number system is used. In this case decimal number system is not used
because then 10 different different electrical conditions would have been needed which is time consuming.

46
32. Implement OR gate using NAND gate. [Din.B’19]
Ans: OR gate is implemented by using NAND as follows:
A
Y = A. B = A + B = A + B Y=A+B
B
33. Explain 3 based number system. [DB, JB, SB, Din.B’18]
Ans: The number system where only three digits or symbols are used is called a 3 based number system. In
this case the symbols can be 0, 1 and 2 and the base will be 3. So, to convert a decimal number to a 3 based
number system, it is to be divided by 3. After converting to 3 based number, the base has to be considered
3. For example:
(121)3 = (1 × 32 + 2 × 31 + 1 × 30 )10 = (16)10 . It is 3 based number system.
34. NOR gate functions as a basic gate when all of its inputs are same-Explain. [DB, JB, SB, Din.B’18]
Ans: NOR gate functions as basic gate when all of its inputs are same.
y = A+A =A
A
In this case, NOT gate is a basic gate, so NOR gate works as basic gate when all of its inputs are same.
35. Explain the most used alpha numerical code before the emergence of Unicode. [DB’17]
Ans: The most used alpha numerical code before Unicode is ASCII code. ASCII is the short form of American
Standard Code for Information Interchange. ASCII is a widely used code which is formed of 8 bits.
36. In what logic 1 + 1 = 1 and 1 + 1 = 10 - Explain. [RB, SB’17]
Ans: By Boolean addition 1 + 1 = 1 and by binary addition 1 + 1 = 10. By Boolean addition or logical
addition 1 + 1 = 1. On the other hand, in binary addition 1 + 1 = 10. It is because the logical addition of
Boolean addition is important. On the contrary, binary addition being an addition of two digits (0 and 1) ,
here 1 + 1 = 10 that is, the number after 1 is 10 as the base of binary system is 2.
37. Unicode is a blessing to people of all languages around the world-Explain. [Ctg.B’17]
Ans: Unicode is a 16-bit alpha numeric code whose other name is the universal code. All letters, numbers
and symbols are used in Unicode to use in digital devices. It is easier to convert to any standard code from
the Unicode. So, it can be said that Unicode is a blessing to people all the languages around the world.
38. There are 4 flip-flops in a 4-bit register-Explain. [SB’17]
Ans: One flip-flop can store one bit data. Register is a circuit formed of a bunch of flip-flops and gates
where each flip-flop stores one binary bit. In an n-bit register, there are n number of flip-flops and can store
n-bit binary data. Thus, it can be said that there are 4 flip-flops in a 4-bit register.
39. The advantages of XOR gate are more than that of OR gate-Explain. [BB’17]
Ans: OR gate is used in logical addition of two or more binary numbers. XOR gate is a special gate. X-OR
gate is used in addition of two or more binary numbers. That’s why the advantages of XOR gate are more
than that of OR gate.
40. Why the number (11)10 is called positional number? Explain. [JB’17]
Ans: Here the number (11)10 belongs to decimal number system whose base is 10. In this system there are
total 10 symbols from 0 to 9. That’s why (11)10 is a positional number.
41. Why is digital signal suitable in case of computers? Explain. [JB’17]
Ans: Digital instruments work on binary mode. One switch can be off in digital signal or signal may be
present or absent. Binary number system is related to this. That’s in case of computers digital signal is
suitable.
42. What type of number is 5D? Explain. [CB’17]
Ans: 5D is a hexadecimal number. Because a digit and a letter are used in the number namely 5 and D.
Among the four number systems only in hexadecimal system these digits and letters are used.

47
43. Output, Input’- Its logical opposite-Explain. [CB’17]
Ans: The logical inverse statement of input and output is applicable on NOT gate. NOT gate is a basic gate
which has an input and an output. This gate functions as logical complement. In logical complement,
complement of 0 is 1 and complement of 1 is 0. That is the input and output of NOT gate are opposite. That’s
why it is also called an inverter.
44. Explain the importance of forming 2’s complement. [Din.B’17]
Ans: In forming the 2’s complements the values of (+0) and (-0) are same which is similar to reality. Simple
circuit is needed to form 2’s compliment and it works very fast. The same circuit can be used in forming 2’s
complement for addition, subtraction, multiplication and division. That’s why the importance of forming 2’s
complement in modern computers is significant.
45. Explain 1 + 1 = 1. [DB’16]
Ans: 1 + 1 = 1 is a logical addition that can be implemented by OR gate. If any one of the inputs of an OR
gate is 1, the output becomes 1.
46. Subtraction can be done by addition-Explain. [RB’16]
Ans: The value obtained by adding 1 to the 1’s complement of a binary number is called 2’s complement.
2’s compliment is the binary value of the negative value of any number. If any number can be turned negative
and added to the mentioned negative number then it is actually subtraction. Therefore using 2’s compliment
subtraction can be done with the help of addition.
47. Computers do not take the number (267)10 directly-Explain. [Ctg.B’16]
Ans: Logic level 0 and 1 are related to binary number system. That’s why in computers and all other
electronic devices binary number system is used. As the (267)10 number do not belong to binary number
system so computers do not take the number directly.
48. Explain whether the number (298)8 is correct or not. [SB’16]
Ans: The number (298)8 is not correct. The symbols in octal number system are 0,1,2,3,4,5,6,7. That is
there are 8 basic symbols in octal system. Thus, the base of an octal system is 8. As the digits 8 and 9 are
used in the number so it is not an octal number.
49. XOR gate is a combined gate of all logic gates-Explain. [BB’16]
Ans: It is seen by implementing the XOR gate that all basic gates AND, OR and NOT are used. So, it can
be said that XOR gate is a combined gate of all logic gates.
50. “The figure represents logical addition" – Explain. [JB’16]
Ans: The figure is an OR gate which represents logical addition.
The figure is of an OR gate. The inputs of the OR gate are added by logical addition or by Boolean
system and the output result is shown. For example:
which represents logical addition.
51. “Octal is a 3-bit code”- Explain. [Din.B’16]
Ans: Three bits in binary are found when any digit in octal is converted to binary. The number system in
which 8 basic symbols (0,1,2,3,4,5,6,7) are used is called octal number system. For example, to express 7,
3 bits (111) are required, that is, within 3 bits any symbol or digit of the octal number system can be
expressed.

48