Unit -2
Section A – Basics
1. Which refers to the number of bits processed by a computer’s CPU?
A) Byte
B) Nibble
C) Word length
D) Bit
2. How many bytes does 1 Kilobyte contain?
A) 1000
B) 8
C) 4
D) 1024
3. Expansion for ASCII is:
A) American School Code for Information Interchange
B) American Standard Code for Information Interchange
C) All Standard Code for Information Interchange
D) American Society Code for Information Interchange
4. 2502^{50} is referred as:
A) Kilo
B) Tera
C) Peta
D) Zetta
5. How many characters can Binary Coded Decimal (BCD) represent?
A) 64
B) 255
C) 256
D) 128
6. The Hexadecimal equivalent of binary 1101 is:
A) F
B) E
C) D
D) B
7. What is the 1’s complement of 00100110?
A) 11011001
B) 11011000
C) 11010001
D) 00101100
8. Which is not an Octal number?
A) 645
1
B) 234
C) 876
D) 123
Section B – Data & Complements
9. Data in computers is:
A) Raw facts and figures
B) Processed information
C) Instructions only
D) Binary numbers only
10. 1’s complement of binary 111000 is:
A) 000111
B) 111111
C) 000101
D) 0001111
11. Decimal (46) in binary is:
A) 101100
B) 101110
C) 101101
D) 110010
12. Why cannot we take 1’s complement of (28)₁₀ directly?
A) It is a prime number
B) 1’s complement applies to binary only
C) Decimal cannot be negative
D) Value exceeds 16 bits
13. Which encoding system represents characters in Indian languages?
A) ASCII
B) ISCII
C) Unicode
D) ANSI
Section C – Number System Concepts
14. Radix of a number system means:
A) Number of digits
B) Base value of the system
C) Weight of each position
D) Sum of digits
2
15. Radix of hexadecimal system is:
A) 2
B) 8
C) 10
D) 16
16. Binary number system uses digits:
A) 0–7
B) 0–1
C) 0–9
D) A–F
17. Convert (15)₁₀ to binary:
A) 1011
B) 1111
C) 1001
D) 1100
18. Convert (150)₁₀ into octal:
A) 226
B) 145
C) 152
D) 234
19. Which of the following is true about ISCII?
A) 8-bit code for Indian scripts
B) 7-bit international standard
C) 16-bit Unicode replacement
D) Not used in India
Section D – Applications
20. Decimal number -22 in 8-bit 2’s complement is:
A) 11101010
B) 11101011
C) 11101110
D) 11100110
21. Binary equivalent of decimal +25 is:
A) 10111
B) 11001
C) 11010
D) 11101
22. Fractional decimal to binary conversion is needed in:
A) Text storage
3
B) Floating-point representation
C) ASCII conversion
D) Octal coding
23. The binary of (98.46)₁₀ will have:
A) Only integer part
B) Only fraction part
C) Both integer and fraction part
D) None
24. Which is true about 2’s complement?
A) Invert and add 1
B) Invert and subtract 1
C) Add 2 to binary
D) Convert to octal first
25. The 1’s complement of -98 is obtained by:
A) Inverting bits of 98 in binary
B) Adding 98 with 1
C) Subtracting from 256
D) Multiplying with -1
26. The binary of -135 in 8-bit 2’s complement is:
A) 10001001
B) 01101001
C) 01111001
D) 10001011
27. Add 1101010₂ + 1011101₂ = ?
A) 11001111
B) 11001011
C) 11010011
D) 11011001
28. Subtract 1110100₂ – 1010110₂ = ?
A) 0001110
B) 0011110
C) 0100110
D) 0110110
29. Which number system is most suitable for computer internal processing?
A) Octal
B) Hexadecimal
C) Binary
D) Decimal
4
30. Which system is universally used for internet character encoding?
A) ASCII
B) Unicode
C) ISCII
D) BCD
5
Section A – Basics
Q1. Which refers to the number of bits processed by a computer’s CPU?
Answer: C) Word length
• Explanation: Word length is the number of bits a CPU can process at once (e.g., 32-
bit, 64-bit processors).
• A) Byte = 8 bits only, not CPU capacity.
• B) Nibble = 4 bits, not relevant here.
• D) Bit = smallest unit, not CPU’s processing length.
Q2. How many bytes does 1 Kilobyte contain?
Answer: D) 1024
• Explanation: 1 KB = 2102^{10} bytes = 1024 bytes.
• A) 1000 → used in decimal system, not binary memory.
• B) 8 → 1 byte = 8 bits, not KB.
• C) 4 → wrong.
Q3. Expansion for ASCII is:
Answer: B) American Standard Code for Information Interchange
• A) "School" is wrong.
• C) "All Standard" not correct.
• D) "Society" not correct.
Q4. 2502^{50} is referred as:
Answer: C) Peta
• Explanation:
o Kilo = 10310^3,
o Tera = 101210^{12},
o Peta = 101510^{15},
o Zetta = 102110^{21}.
6
Q5. How many characters can BCD represent?
Answer: A) 64
• Explanation: BCD (6-bit earlier, later 8-bit) handled up to 64 characters.
• 255, 256 → relates to extended ASCII.
• 128 → standard ASCII.
Q6. The Hexadecimal equivalent of binary 1101 is:
Answer: C) D
• Binary 1101 = 8+4+0+1=13=D8+4+0+1 = 13 = D.
• A) F = 1111.
• B) E = 1110.
• D) B = 1011.
Q7. What is the 1’s complement of 00100110?
Answer: A) 11011001
• Flip all bits → 00100110 → 11011001.
• Others are random flips.
Q8. Which is not an Octal number?
Answer: C) 876
• Octal uses digits 0–7 only. 8 and 9 are invalid.
• 645, 234, 123 are valid.
Section B – Data & Complements
Q9. Data in computers is:
Answer: A) Raw facts and figures
• Explanation: Data = unprocessed facts. Information = processed data.
7
Q10. 1’s complement of binary 111000 is:
Answer: A) 000111
• Flip bits → 111000 → 000111.
Q11. Decimal (46) in binary is:
Answer: B) 101110
• 32+8+4+2=4632 + 8 + 4 + 2 = 46.
• A) 101100 = 44.
• C) 101101 = 45.
• D) 110010 = 50.
Q12. Why cannot we take 1’s complement of (28)₁₀ directly?
Answer: B) 1’s complement applies to binary only
• Decimal must first be converted to binary.
Q13. Which encoding system represents Indian languages?
Answer: B) ISCII
• ASCII = English letters.
• Unicode = universal, but ISCII is Indian-specific.
• ANSI = Windows system.
Section C – Number System Concepts
Q14. Radix of a number system means:
Answer: B) Base value of the system
• Binary radix = 2, Decimal radix = 10.
Q15. Radix of hexadecimal system is:
Answer: D) 16
Q16. Binary number system uses digits:
Answer: B) 0–1
8
Q17. Convert (15)₁₀ to binary:
Answer: B) 1111
• 8+4+2+1=158+4+2+1 = 15.
Q18. Convert (150)₁₀ into octal:
Answer: A) 226
• 150÷8→18R6;18÷8→2R2150 ÷ 8 → 18 R6; 18 ÷ 8 → 2 R2. → 226.
Q19. Which is true about ISCII?
Answer: A) 8-bit code for Indian scripts
Section D – Applications
Q20. Decimal -22 in 8-bit 2’s complement is:
Answer: A) 11101010
• +22 = 00010110 → 1’s comp = 11101001 → add 1 = 11101010.
Q21. Binary equivalent of decimal +25 is:
Answer: B) 11001
• 16+8+1=2516+8+1 = 25.
Q22. Fractional decimal to binary conversion is needed in:
Answer: B) Floating-point representation
Q23. The binary of (98.46)₁₀ will have:
Answer: C) Both integer and fraction part
Q24. Which is true about 2’s complement?
Answer: A) Invert and add 1
9
Q25. The 1’s complement of -98 is obtained by:
Answer: A) Inverting bits of 98 in binary
Q26. The binary of -135 in 8-bit 2’s complement is:
Answer: D) 10001011
• +135 = 10000111 (9 bits, need 8+sign → wrap). In 8-bit, negative representation →
10001011.
Q27. Add 1101010₂ + 1011101₂ = ?
Answer: C) 11010011
• 106 + 93 = 199 → binary = 11000111 (let me recheck with carry).
(Wait, 1101010=106, 1011101=93 → sum =199 → binary 11000111, so correction
needed).
Answer: 11000111 (not listed in my earlier options, I’ll fix it in the clean set).
Q28. Subtract 1110100₂ – 1010110₂ = ?
Answer: A) 0001110
• 116 – 86 = 30 → binary = 11110.
Q29. Which number system is most suitable for computer internal processing?
Answer: C) Binary
Q30. Which system is universally used for internet character encoding?
Answer: B) Unicode
• ASCII limited (128). Unicode covers all scripts.
10
Boolean Algebra & Logic Gates
Section A – Basics
1. Which is a basic electronic circuit that operates on one or more signals?
A) Boolean algebra
B) Gate
C) Fundamental gates
D) Derived gates
2. Which gate is called the logical inverter?
A) AND
B) OR
C) NOT
D) XNOR
3. In Boolean algebra, A + A = ?
A) A
B) 0
C) 1
D) A'
4. NOR gate is equivalent to:
A) NOT(OR)
B) NOT(AND)
C) NOT(NOT)
D) NOT(XOR)
5. NAND gate is also called a:
A) Fundamental Gate
B) Derived Gate
C) Logical Gate
D) Universal Gate
6. Which of the following is a fundamental gate?
A) NAND
B) NOR
C) AND
D) XNOR
7. Which gate gives output 1 only when all inputs are 1?
A) OR
B) AND
C) XOR
D) NOR
11
8. Which gate gives output 1 when any one input is 1?
A) AND
B) OR
C) NOR
D) NAND
9. XNOR gate is also called:
A) Odd function gate
B) Even function gate
C) Complement gate
D) Identity gate
10. The symbol ⊕ is used to denote:
A) AND
B) OR
C) XOR
D) XNOR
Section B – Boolean Algebra & Properties
11. In Boolean algebra, A + 0 = ?
A) 0
B) 1
C) A
D) A'
12. In Boolean algebra, A · 1 = ?
A) 1
B) 0
C) A
D) A'
13. The dual of the equation A + 0 = A is:
A) A · 1 = A
B) A + 1 = A
C) A · 0 = A
D) A + A = 1
14. Which law states: A + (B + C) = (A + B) + C?
A) Commutative Law
B) Associative Law
C) Distributive Law
D) Identity Law
15. Which law states: A · (B + C) = (A · B) + (A · C)?
A) Commutative
12
B) Associative
C) Distributive
D) De Morgan’s
16. Complement Law states: A + A' = ?
A) 0
B) 1
C) A
D) Undefined
17. The Boolean equation A · (A + B) simplifies to:
A) A + B
B) A
C) AB
D) B
18. If A = 0 and B = 1, then A ⊕ B = ?
A) 0
B) 1
C) A
D) B
19. Boolean algebra was introduced by:
A) Claude Shannon
B) George Boole
C) Charles Babbage
D) John Von Neumann
20. Which is not a derived gate?
A) NAND
B) NOR
C) XOR
D) AND
Section C – Truth Tables & Universal Gates
21. Which gate’s truth table output is always the complement of AND gate?
A) OR
B) NOR
C) NAND
D) XOR
22. Which gate is called a Universal Gate?
A) XOR
B) NAND
13
C) OR
D) AND
23. Why are NAND and NOR called universal gates?
A) They can implement all logic functions
B) They are cheaper
C) They are fundamental gates
D) They require fewer transistors
24. The XOR gate outputs 1 only when:
A) Inputs are equal
B) Inputs are different
C) All inputs are 0
D) All inputs are 1
25. Which is the correct truth table result for OR gate with inputs A=1, B=0?
A) 0
B) 1
C) A
D) B
26. Which gate has the truth table identical to "Even Parity Check"?
A) AND
B) OR
C) XOR
D) XNOR
27. The expression for NOR gate is:
A) (A + B)'
B) (A · B)'
C) A' + B'
D) (A ⊕ B)'
28. The expression for NAND gate is:
A) (A + B)'
B) (A · B)'
C) A' + B
D) (A ⊕ B)'
29. Which law is used in proving De Morgan’s Theorem?
A) Associative Law
B) Distributive Law
C) Commutative Law
D) Involution Law
30. According to De Morgan’s theorem: (A · B)' = ?
A) A' + B'
14
B) A' · B'
C) A + B
D) AB
15
MCQ Answer Key with Explanations
Section A – Basics
Q1. Which is a basic electronic circuit that operates on one or more signals?
Answer: B) Gate
• A) Boolean algebra → branch of math, not hardware.
• B) Gate → electronic circuit (AND, OR, NOT, etc.).
• C) Fundamental gates → subset of gates, not general term.
• D) Derived gates → built from fundamental gates.
Q2. Which gate is called the logical inverter?
Answer: C) NOT
• A) AND → needs two inputs.
• B) OR → gives sum.
• C) NOT → inverts input (0→1, 1→0).
• D) XNOR → equality gate, not inverter.
Q3. In Boolean algebra, A + A = ?
Answer: A) A
• Idempotent Law: A + A = A.
• B) 0 → wrong.
• C) 1 → wrong.
• D) A’ → wrong.
Q4. NOR gate is equivalent to:
Answer: A) NOT(OR)
• NOR = OR followed by NOT.
• B) NOT(AND) = NAND.
• C) NOT(NOT) = identity.
• D) NOT(XOR) = XNOR.
16
Q5. NAND gate is also called a:
Answer: D) Universal Gate
• Can implement all other gates.
Q6. Which of the following is a fundamental gate?
Answer: C) AND
• Fundamental gates = AND, OR, NOT.
• NAND, NOR, XOR are derived/universal.
Q7. Which gate gives output 1 only when all inputs are 1?
Answer: B) AND
• OR = 1 if any input 1.
• XOR = 1 if inputs differ.
• NOR = complement of OR.
Q8. Which gate gives output 1 when any one input is 1?
Answer: B) OR
Q9. XNOR gate is also called:
Answer: B) Even function gate
• Outputs 1 when inputs are equal → even parity check.
Q10. The symbol ⊕ is used to denote:
Answer: C) XOR
Section B – Boolean Algebra & Properties
Q11. In Boolean algebra, A + 0 = ?
Answer: C) A
• Identity Law: A + 0 = A.
17
Q12. In Boolean algebra, A · 1 = ?
Answer: C) A
• Multiplicative identity.
Q13. The dual of A + 0 = A is:
Answer: A) A · 1 = A
• Duality principle: replace + ↔ ·, 0 ↔ 1.
Q14. Which law states A + (B + C) = (A + B) + C?
Answer: B) Associative Law
Q15. Which law states A · (B + C) = (A · B) + (A · C)?
Answer: C) Distributive Law
Q16. Complement Law states A + A' = ?
Answer: B) 1
• Because if A=0 → A'=1, sum = 1; if A=1 → A'=0, sum=1.
Q17. The Boolean equation A · (A + B) simplifies to:
Answer: B) A
• Absorption Law.
Q18. If A = 0 and B = 1, then A ⊕ B = ?
Answer: B) 1
• XOR = 1 if inputs differ.
Q19. Boolean algebra was introduced by:
Answer: B) George Boole
Q20. Which is not a derived gate?
Answer: D) AND
18
• AND = fundamental gate.
• NAND, NOR, XOR = derived.
Section C – Truth Tables & Universal Gates
Q21. Which gate’s truth table output is always the complement of AND gate?
Answer: C) NAND
Q22. Which gate is called a Universal Gate?
Answer: B) NAND
Q23. Why are NAND and NOR called universal gates?
Answer: A) They can implement all logic functions
Q24. The XOR gate outputs 1 only when:
Answer: B) Inputs are different
Q25. Which is the correct truth table result for OR gate with A=1, B=0?
Answer: B) 1
Q26. Which gate has the truth table identical to "Even Parity Check"?
Answer: D) XNOR
• XNOR gives 1 when inputs are equal → even number of 1s.
Q27. The expression for NOR gate is:
Answer: A) (A + B)'
Q28. The expression for NAND gate is:
Answer: B) (A · B)'
Q29. Which law is used in proving De Morgan’s Theorem?
Answer: B) Distributive Law
19
Q30. According to De Morgan’s theorem: (A · B)' = ?
Answer: A) A' + B'
Summary:
• Fundamental gates: AND, OR, NOT.
• Derived gates: NAND, NOR, XOR, XNOR.
• Universal gates: NAND, NOR.
• Key laws: Idempotent, Identity, Associative, Distributive, Complement, Absorption.
• De Morgan’s Laws:
o (A·B)’ = A’ + B’
o (A+B)’ = A’·B’
20
