Digital

Boolean Algebra and Logic Gates.

50 MCQs with answers:

Boolean Algebra and Logic Gates – 50 MCQs with Answers

1. What is the binary equivalent of decimal 10?

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

2. Which logic gate gives output 1 when at least one input is 1?

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

3. What is the result of 1 AND 0?

A) 1 B) 0 C) -1 D) Undefined
Answer: B) 0

4. The output of a NOT gate is:

A) Always 1 B) Always 0 C) Complement of input D) Same as input
Answer: C) Complement of input

5. Which gate is known as an inverter?

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

6. What is the symbol for the XOR gate?

A) ⊕ B) ∧ C) ∨ D) ¬
Answer: A) ⊕

7. Which logic gate gives a HIGH output only when all inputs are HIGH?
A) OR B) NOR C) AND D) XOR
Answer: C) AND

8. The output of a NAND gate is:

A) Same as AND B) Complement of AND C) Same as OR D) Complement of OR
Answer: B) Complement of AND

9. Which gate has the output expression A + B’?

A) OR B) NAND C) NOR D) None
Answer: D) None

10. Which logic operation is commutative and associative?

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

1
Digital

11. DeMorgan’s First Theorem is:

A) (AB)’ = A’ + B’ B) (A + B)’ = A’B’ C) Both D) None
Answer: A) (AB)’ = A’ + B’

12. Which gate is a universal gate?

A) XOR B) NOR C) AND D) XNOR
Answer: B) NOR

13. What is the dual of A + AB?

A) A(B + 1) B) A(B • 0) C) A • (A + B) D) None
Answer: C) A • (A + B)

14. The identity law for Boolean addition is:

A) A + 0 = A B) A + A = 0 C) A + 1 = 0 D) A + A = 1
Answer: A) A + 0 = A

15. In Boolean algebra, 1 + 1 = ?

A) 0 B) 1 C) 2 D) Undefined
Answer: B) 1

16. Which gate is best suited to construct from NAND gates?

A) AND B) NOT C) NOR D) XOR
Answer: A) AND

17. How many entries are there in a 3-variable truth table?

A) 4 B) 6 C) 8 D) 16
Answer: C) 8

18. What is the simplified form of A + AB?

A) AB B) A + B C) A D) None
Answer: C) A

19. Which Boolean law is used in simplifying A + AB?

A) Distributive B) Absorption C) Demorgan D) Involution
Answer: B) Absorption

20. A variable ANDed with 1 gives:

A) 1 B) 0 C) Variable D) Inverse
Answer: C) Variable

21. A variable ORed with 1 gives:

A) 0 B) 1 C) Variable D) Inverse
Answer: B) 1

22. In Boolean algebra, A + A’ = ?

A) A B) 0 C) 1 D) A’
Answer: C) 1
2
Digital

23. In Boolean algebra, A • A’ = ?

A) 1 B) A C) A’ D) 0
Answer: D) 0

24. The complement of A + B is:

A) A’ + B’ B) A’B’ C) AB D) None
Answer: B) A’B’

25. The output of a NOR gate is:

A) Inverse of OR B) Inverse of AND C) Inverse of XOR D) None
Answer: A) Inverse of OR

26. The expression A ⊕ B is 1 when:

A) A = B B) A ≠ B C) A = 1 D) B = 1
Answer: B) A ≠ B

27. What is the Boolean expression for a 2-input AND gate?

A) A + B B) AB C) A ⊕ B D) A’B
Answer: B) AB

28. A 3-input OR gate gives 0 only when:

A) All inputs are 1 B) All inputs are 0 C) One is 0 D) Two are 0
Answer: B) All inputs are 0

29. Which of the following is not a basic logic gate?

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

30. Which gate gives high output when both inputs are different?
A) NOR B) NAND C) XOR D) XNOR
Answer: C) XOR

31. Which logic operation corresponds to multiplication?

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

32. Which of the following gates are used in adders?

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

33. Which gate is formed by combining XOR and NOT?

A) XNOR B) NAND C) NOR D) AND
Answer: A) XNOR

34. Which Boolean identity is used in A(A + B) = A?

A) Complement B) Absorption C) Involution D) Redundancy
Answer: B) Absorption
3
Digital

35. What is the expression for a NOT gate?

A) A’ B) A + B C) AB D) A ⊕ B
Answer: A) A’

36. Which logic gate is used for toggling?

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

37. The minimum number of gates required to realize A ⊕ B is:

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

38. Which Boolean law simplifies A + A’B?

A) Distributive B) Absorption C) Redundancy D) Covering
Answer: D) Covering

39. Which expression is equivalent to (A + B)(A + C)?

A) A + BC B) A + B + C C) AB + AC D) A + B(C)
Answer: A) A + BC

40. The gate with output 1 when inputs are all 0 is:
A) NOR B) OR C) XOR D) AND
Answer: A) NOR

41. Which law states that A + AB = A?

A) Distributive B) Absorption C) Associative D) Commutative
Answer: B) Absorption

42. The number of minterms for 3 variables is:

A) 4 B) 6 C) 8 D) 10
Answer: C) 8

43. Which of these is NOT an idempotent law?

A) A + A = A B) A . A = A C) A + A’ = 1 D) A . A’ = 0
Answer: C) A + A’ = 1

44. Which logic family uses CMOS technology?

A) TTL B) RTL C) ECL D) CMOS
Answer: D) CMOS

45. The output of A AND 1 is:

A) A B) A’ C) 0 D) 1
Answer: A) A

46. Which is not a fundamental gate?

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

47. XOR operation is equivalent to:

A) A’B + AB’ B) AB C) A + B D) A ⊕ B’
Answer: A) A’B + AB’

48. How many two-input logic gates are possible?

A) 16 B) 4 C) 2 D) 8
Answer: A) 16

49. A gate with one input and one output is:

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

50. Boolean algebra is based on:

A) Logical operations B) Arithmetic operations C) Differential equations D)
Probability
Answer: A) Logical operations

Great! Here's the next set:

Combinational Logic – 50 MCQs with Answers

1. Which of the following is a combinational circuit?

A) Flip-Flop B) Counter C) Multiplexer D) Shift Register
Answer: C) Multiplexer

2. A decoder is used to:

A) Encode data B) Perform arithmetic C) Convert binary to one-hot D) Store data
Answer: C) Convert binary to one-hot

3. A 3-to-8 decoder has how many output lines?

A) 3 B) 8 C) 6 D) 16
Answer: B) 8

4. Which of these is a data selector?

A) Decoder B) Demultiplexer C) Multiplexer D) Encoder
Answer: C) Multiplexer

5. The number of possible outputs for a 4-input AND gate is:

A) 4 B) 8 C) 2 D) 16
Answer: C) 2

6. Which circuit adds two binary digits and produces a sum and a carry?
A) Decoder B) Encoder C) Half Adder D) Multiplexer
Answer: C) Half Adder
5
Digital

7. Full Adder has how many inputs and outputs?

A) 2 inputs, 1 output B) 3 inputs, 2 outputs C) 2 inputs, 2 outputs D) 3 inputs, 3
outputs
Answer: B) 3 inputs, 2 outputs

8. What does a 4-to-1 multiplexer do?

A) 4 outputs to 1 input B) 4 inputs to 1 output C) 1 input to 4 outputs D) Selects
4 outputs
Answer: B) 4 inputs to 1 output

9. A demultiplexer performs the reverse operation of a:

A) Adder B) Decoder C) Multiplexer D) Subtractor
Answer: C) Multiplexer

10. Which of these is not a combinational circuit?

A) Adder B) Subtractor C) Flip-Flop D) Multiplexer
Answer: C) Flip-Flop

11. The binary adder circuit uses:

A) Decoders B) Multiplexers C) XOR and AND gates D) Encoders
Answer: C) XOR and AND gates

12. Which component is used in digital computers to perform addition?

A) Multiplexer B) Adder C) Subtractor D) Decoder
Answer: B) Adder

13. A half-subtractor has how many outputs?

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

14. A logic circuit that converts binary to Gray code is a:

A) Encoder B) Converter C) Code converter D) Comparator
Answer: C) Code converter

15. A 2-to-4 line decoder uses how many select inputs?

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

16. Which of these can be used to implement any logic function?

A) Decoder B) Multiplexer C) Encoder D) Demultiplexer
Answer: B) Multiplexer

17. A 1-bit comparator compares:

A) Two 4-bit numbers B) Two 2-bit numbers C) Two 1-bit numbers D) Three 1-bit
numbers
Answer: C) Two 1-bit numbers

6
Digital

18. Which logic circuit detects whether two binary numbers are equal?
A) Comparator B) Encoder C) Decoder D) Adder
Answer: A) Comparator

19. In a full adder, the carry output is generated using:

A) OR gate only B) XOR gate only C) AND and OR gates D) NOT gate only
Answer: C) AND and OR gates

20. A 3-to-8 decoder requires how many input select lines?

A) 3 B) 4 C) 8 D) 2
Answer: A) 3

21. Which device encodes 2ⁿ inputs into n outputs?

A) Multiplexer B) Decoder C) Encoder D) Adder
Answer: C) Encoder

22. The output of a full adder is:

A) One sum bit only B) Sum and carry bits C) One carry bit only D) Difference bit
Answer: B) Sum and carry bits

23. A 4-bit adder can add two numbers of:

A) 8-bit B) 4-bit C) 2-bit D) 6-bit
Answer: B) 4-bit

24. Which logic circuit is used in arithmetic logic unit (ALU)?

A) Multiplexer B) Adder C) Comparator D) All
Answer: D) All

25. A subtractor circuit can be built using:

A) XOR and AND gates B) OR gates only C) Flip-flops D) Encoders
Answer: A) XOR and AND gates

26. Which of the following circuits can be used to detect parity?

A) Encoder B) Parity generator C) Decoder D) Adder
Answer: B) Parity generator

27. What is the maximum number of combinations in a 4-input truth table?

A) 8 B) 12 C) 16 D) 32
Answer: C) 16

28. The primary function of a multiplexer is:

A) Convert parallel to serial B) Select one input C) Store data D) Generate parity
Answer: B) Select one input

29. In combinational logic circuits, the output depends only on:

A) Previous state B) Clock C) Input values D) Timing
Answer: C) Input values
7
Digital

30. Which component can be used to build a priority encoder?

A) Flip-Flops B) Multiplexer C) OR gates D) None
Answer: C) OR gates

31. Which of the following is a one-to-many device?

A) Multiplexer B) Demultiplexer C) Encoder D) Decoder
Answer: B) Demultiplexer

32. Which circuit is used to implement Boolean expressions?

A) Arithmetic circuit B) Combinational circuit C) Sequential circuit D) Memory
circuit
Answer: B) Combinational circuit

33. Which combinational circuit can perform addition, subtraction, and logical
operations?
A) Decoder B) ALU C) Flip-Flop D) Comparator
Answer: B) ALU

34. Which of these has both enable and select inputs?

A) Encoder B) Decoder C) Multiplexer D) Counter
Answer: B) Decoder

35. Which of the following is a combination of logic gates that produce one or more
outputs?
A) Boolean expression B) Combinational circuit C) Flip-Flop D) Program
Answer: B) Combinational circuit

36. Which logic circuit is used in a calculator?

A) Decoder B) Encoder C) ALU D) Flip-Flop
Answer: C) ALU

37. An encoder is used to:

A) Select one input B) Convert analog to digital C) Convert input lines to binary
code D) Store data
Answer: C) Convert input lines to binary code

38. Which of these is a valid logic combination for a half adder?

A) Sum = A AND B B) Sum = A XOR B C) Sum = A + B D) Sum = A OR B
Answer: B) Sum = A XOR B

39. Which device is used to convert serial data to parallel data?

A) Shift Register B) Decoder C) Encoder D) Adder
Answer: A) Shift Register

8
Digital

40. What is the number of select lines in a 16-to-1 multiplexer?

A) 2 B) 4 C) 8 D) 16
Answer: B) 4

41. How many full adders are required to add two 4-bit binary numbers?
A) 2 B) 3 C) 4 D) 1
Answer: C) 4

42. A 1-to-4 demux has how many select lines?

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

43. A logic circuit which performs AND and XOR simultaneously is used in:
A) Comparator B) Half Adder C) Encoder D) Multiplexer
Answer: B) Half Adder

44. How many inputs are required for a 10-line to 4-line priority encoder?
A) 4 B) 10 C) 5 D) 6
Answer: B) 10

45. Which of the following is required for subtracting binary numbers?

A) Inverter B) Adder C) XOR D) All
Answer: D) All

46. A carry look-ahead adder is faster than:

A) Half adder B) Ripple carry adder C) Full adder D) BCD adder
Answer: B) Ripple carry adder

47. What does a parity bit do?

A) Stores data B) Detects errors C) Adds numbers D) Shifts bits
Answer: B) Detects errors

48. A 2-bit comparator will have how many outputs?

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

49. Which circuit helps to identify the highest priority input?

A) Decoder B) Encoder C) Priority encoder D) Comparator
Answer: C) Priority encoder

50. A circuit that has multiple inputs and single output is:
A) Decoder B) Multiplexer C) Demux D) Counter
Answer: B) Multiplexer

9
Digital

Sequential Logic – 50 MCQs with Answers

1. Which of the following is a sequential circuit?

A) Multiplexer B) Decoder C) Flip-Flop D) Adder
Answer: C) Flip-Flop

2. The main difference between combinational and sequential circuits is:

A) Type of gates used B) Clock usage C) Memory D) Size
Answer: C) Memory

3. A basic memory unit in a sequential circuit is a:

A) Register B) Flip-Flop C) Counter D) Decoder
Answer: B) Flip-Flop

4. A JK flip-flop avoids the invalid state of:

A) D flip-flop B) SR flip-flop C) T flip-flop D) Latch
Answer: B) SR flip-flop

5. A T flip-flop toggles its output when:

A) T=1 B) T=0 C) T=1 and Clock Edge D) T=0 and Clock Edge
Answer: C) T=1 and Clock Edge

6. What is the output of a D flip-flop when D = 1 and clock is triggered?

A) 0 B) 1 C) Toggle D) No change
Answer: B) 1

7. The output of a flip-flop depends on:

A) Current inputs only B) Previous states only C) Current inputs and previous states D)
Clock only
Answer: C) Current inputs and previous states

10
Digital

8. A ring counter is a type of:

A) Flip-Flop B) Shift Register C) Multiplexer D) Decoder
Answer: B) Shift Register

9. The number of states in a 3-bit counter is:

A) 6 B) 8 C) 4 D) 10
Answer: B) 8

10. Which flip-flop is best used as a toggle switch?

A) SR B) JK C) T D) D
Answer: C) T

11. In a synchronous counter, all flip-flops are triggered by:

A) Different clocks B) Same clock C) Alternating signals D) No clock
Answer: B) Same clock

12. Which type of counter counts up and down?

A) Binary Counter B) Ring Counter C) Up/Down Counter D) Mod-n Counter
Answer: C) Up/Down Counter

13. Which sequential device stores multiple bits?

A) Multiplexer B) Flip-Flop C) Register D) Decoder
Answer: C) Register

14. A register can be used to:

A) Store a bit B) Store multiple bits C) Perform logical operation D) Decode input
Answer: B) Store multiple bits

15. A race condition occurs in:

A) Combinational logic B) Synchronous circuits C) Asynchronous circuits D) Decoders
Answer: C) Asynchronous circuits

11
Digital

16. A modulo-n counter has how many states?

A) n B) 2n C) n/2 D) Infinite
Answer: A) n

17. A flip-flop that changes its state on every clock pulse is a:

A) JK B) T C) D D) SR
Answer: B) T

18. In SR flip-flop, what happens when S=1 and R=1?

A) Set B) Reset C) No change D) Invalid
Answer: D) Invalid

19. A master-slave flip-flop is used to:

A) Reduce clock usage B) Avoid race condition C) Store 2 bits D) Increase speed
Answer: B) Avoid race condition

20. Which flip-flop can be made using a D flip-flop?

A) T B) JK C) SR D) All
Answer: A) T

21. How many flip-flops are required for a mod-16 counter?

A) 2 B) 4 C) 8 D) 16
Answer: B) 4

22. What is the output of a ring counter with 4 flip-flops?

A) 4 states B) 5 states C) 6 states D) 8 states
Answer: A) 4 states

23. A Johnson counter is also called:

A) Ring counter B) Twisted ring counter C) Shift register D) Binary counter
Answer: B) Twisted ring counter

12
Digital

24. The setup time of a flip-flop refers to:

A) Clock frequency B) Minimum time input must be stable before clock C) Output delay
D) Propagation delay
Answer: B) Minimum time input must be stable before clock

25. A Moore machine’s output depends on:

A) State only B) Input only C) Both D) None
Answer: A) State only

26. A Mealy machine’s output depends on:

A) Input only B) State only C) Both input and state D) Clock
Answer: C) Both input and state

27. A sequential circuit that cycles through a fixed sequence of states is called a:
A) Counter B) Shift Register C) FSM D) Clock generator
Answer: A) Counter

28. Flip-Flops are edge triggered devices because:

A) Avoid glitches B) Work on level C) Avoid races D) Fast speed
Answer: A) Avoid glitches

29. In synchronous design, what synchronizes the components?

A) Inputs B) Outputs C) Clock D) Control signals
Answer: C) Clock

30. A shift register can be used for:

A) Addition B) Multiplexing C) Serial-to-parallel conversion D) Decoding
Answer: C) Serial-to-parallel conversion

31. A counter that resets after 10 counts is called:

A) Mod-10 B) Mod-8 C) Mod-16 D) Mod-6
Answer: A) Mod-10

13
Digital

32. In which type of sequential circuit are flip-flops not used?

A) Asynchronous B) Synchronous C) Combinational D) Clockless sequential
Answer: C) Combinational

33. The input of a D flip-flop is high. After the clock edge, the output becomes:
A) Low B) High C) Same as before D) Unknown
Answer: B) High

34. If a 3-bit shift register initially stores 101, after 1 right shift the value is:
A) 101 B) 010 C) 110 D) 001
Answer: B) 010

35. A synchronous counter differs from an asynchronous counter in:

A) Number of states B) Output C) Clock connection D) Logic gates used
Answer: C) Clock connection

36. In a synchronous sequential circuit, all flip-flops are:

A) Asynchronous B) Driven by same clock C) Independent D) Clockless
Answer: B) Driven by same clock

37. What is the output of a 3-bit binary up counter after 7 clock pulses from zero?
A) 111 B) 000 C) 101 D) 110
Answer: B) 000

38. What is meant by propagation delay in a flip-flop?

A) Input delay B) Time between input change and output change C) Clock delay D)
None
Answer: B) Time between input change and output change

39. The input that resets a flip-flop is called:

A) Clear B) Clock C) Toggle D) Set
Answer: A) Clear

14
Digital

40. A 4-bit shift register has how many flip-flops?

A) 2 B) 3 C) 4 D) 8
Answer: C) 4

41. Which is a self-starting counter?

A) Binary counter B) Ring counter C) Ripple counter D) Synchronous counter
Answer: B) Ring counter

42. Flip-flops can store:

A) Multiple bits B) A single bit C) No bit D) Two bits
Answer: B) A single bit

43. How many states does a 5-bit counter have?

A) 10 B) 32 C) 5 D) 20
Answer: B) 32

44. In asynchronous counter, flip-flops are triggered:

A) By common clock B) Sequentially by previous output C) By input D) Randomly
Answer: B) Sequentially by previous output

45. Which device stores data temporarily while transferring?

A) Counter B) Shift register C) Buffer register D) Decoder
Answer: C) Buffer register

46. A flip-flop with two stable states is known as:

A) Latch B) Bistable device C) Monostable D) Multivibrator
Answer: B) Bistable device

47. A mod-n counter resets when count reaches:

A) n B) n-1 C) n+1 D) 0
Answer: A) n

15
Digital

48. In serial-in parallel-out (SIPO), data is:

A) Parallel in and parallel out B) Serial in and parallel out C) Serial in and serial out D)
Parallel in and serial out
Answer: B) Serial in and parallel out

49. Edge triggering refers to:

A) Level change detection B) High-level input C) Transition detection (0 to 1 or 1 to 0) D)
Latching
Answer: C) Transition detection (0 to 1 or 1 to 0)

50. The initial state of a flip-flop is called:

A) Latched B) Cleared C) Reset D) Idle
Answer: C) Reset

Units of a Digital Computer:

1. The central processing unit (CPU) consists of the ALU and Control Unit.
Answer: True

2. The memory unit stores data and instructions.

Answer: True

3. The control unit directs the operation of the processor.

Answer: True

4. The arithmetic logic unit (ALU) performs arithmetic and logic operations.
Answer: True

5. Registers are small, fast storage units inside the CPU.

Answer: True

6. The program counter (PC) holds the address of the next instruction.
Answer: True

7. The instruction register (IR) holds the current instruction.

Answer: True

8. The memory data register (MDR) temporarily holds data read from or written to
memory.
Answer: True

16
Digital

9. The memory address register (MAR) holds the address of the memory location to
access.
Answer: True

10. The accumulator is a register used to store intermediate arithmetic results.

Answer: True

11. The control unit generates control signals to coordinate operations.

Answer: True

12. The CPU communicates with I/O devices via the bus.
Answer: True

13. The system bus consists of data, address, and control buses.
Answer: True

14. Cache memory is faster than main memory.

Answer: True

15. The ALU includes a combinational logic circuit.

Answer: True

16. Instruction decoding is done in the control unit.

Answer: True

17. The stack pointer holds the address of the top of the stack.
Answer: True

18. The control unit can be implemented as hardwired or microprogrammed.

Answer: True

19. The arithmetic logic unit performs operations like add, subtract, AND, OR.
Answer: True

20. The program counter is incremented by 1 after each instruction fetch.

Answer: True

21. Registers in the CPU are typically built using flip-flops.

Answer: True

22. The instruction cycle consists of fetch, decode, execute steps.

Answer: True

23. The control unit uses the opcode to determine the operation.
Answer: True

24. The data bus transfers data between CPU, memory, and I/O.
Answer: True

17
Digital

25. The address bus transfers memory addresses only.

Answer: True

26. The control bus carries control and timing signals.

Answer: True

27. The CPU can execute instructions stored in RAM.

Answer: True

28. The ALU output is stored in the accumulator or a general-purpose register.

Answer: True

29. The CPU clock synchronizes all operations inside the processor.
Answer: True

30. The number of bits a CPU can process at a time is its word size.
Answer: True

31. The instruction register and decoder are part of the control unit.
Answer: True

32. The main memory is volatile.

Answer: True

33. Registers provide faster access than cache.

Answer: False

34. The MAR holds the memory address to be accessed next.

Answer: True

35. The MDR holds the data fetched from or to be written to memory.
Answer: True

36. The CPU is also called the brain of the computer.

Answer: True

37. Input devices send data to the CPU via the input interface.
Answer: True

38. Output devices receive data from the CPU via the output interface.
Answer: True

39. Control signals include read, write, interrupt, clock.

Answer: True

40. The CPU can execute arithmetic, logical, control, and data transfer instructions.
Answer: True

18
Digital

41. The CPU communicates with peripherals via I/O ports.

Answer: True

42. Registers are generally classified as general purpose and special purpose.
Answer: True

43. The instruction set architecture defines the CPU's instruction set.
Answer: True

44. The program counter can jump to any address during branching.
Answer: True

45. The ALU uses binary arithmetic.

Answer: True

46. The control unit generates timing signals.

Answer: True

47. The CPU fetches instructions from memory.

Answer: True

48. The accumulator is a type of general-purpose register.

Answer: False

49. The CPU's performance depends on clock speed and instruction set efficiency.
Answer: True

50. The CPU executes instructions in machine language.

Answer: True

19
Digital

Arithmetic Operations: Addition and Subtraction

1. What is the binary addition of 1010 and 1101?

Answer: 10111
Explanation:
Add bit by bit from right to left, carrying over when the sum exceeds 1:
0+1=1, 1+0=1, 0+1=1, 1+1=10 (carry 1), final carry adds 1 → 10111

2. How is subtraction performed in binary using two’s complement?

Answer: Add the two’s complement of the subtrahend to the minuend

Explanation:
Two’s complement represents the negative number, and adding it to the minuend performs
subtraction.

3. What is the two’s complement of the binary number 0110?

Answer: 1010
Explanation:
Invert the bits (1001) and add 1 → 1010.

4. What happens when an overflow occurs in binary addition?

Answer: The result exceeds the bit width and the carry out is ignored
Explanation:
In fixed-width binary arithmetic, if the sum requires more bits than available, overflow
occurs, leading to incorrect results.

5. How do you subtract 0101 from 1001 using two’s complement?

Answer: Add two’s complement of 0101 (1011) to 1001 → 0100

Explanation:
Two’s complement of 0101 is 1011; add to 1001 → 1 0100 (discard carry) → 0100.

6. What is the binary addition result of 1111 and 0001 in 4-bit arithmetic?

20
Digital

Answer: 0000 (with overflow)

Explanation:
1111 + 0001 = 10000; 4-bit result is 0000, overflow bit is discarded.

7. How can subtraction be implemented using the ALU?

Answer: By using addition with two’s complement of the subtrahend

Explanation:
ALU can perform subtraction by adding the two’s complement of the number to subtract.

8. What is the difference between signed and unsigned binary numbers in addition?

Answer: Signed numbers use two’s complement, unsigned do not

Explanation:
Signed numbers use two’s complement for negative values; overflow detection differs for
signed and unsigned.

9. What is the sum of 1101 and 1011 in binary?

Answer: 11000
Explanation:
Add bitwise: 1+1=0 carry 1, continue adding carry, final carry adds a new bit → 11000.

10. What is the result of subtracting 0011 from 1010 in binary?

Answer: 0111
Explanation:
Two’s complement of 0011 is 1101; add to 1010 → 0111 (7 decimal).

Arithmetic Operations: Addition and Subtraction:

11. Why is two’s complement preferred over sign-magnitude representation in binary

subtraction?

Answer: Because it simplifies hardware design and avoids two representations of zero
Explanation:
Two’s complement allows addition circuits to be used for subtraction and has a single zero
representation, making it efficient for arithmetic operations.

21
Digital

12. What is the two’s complement representation of -7 in 4-bit binary?

Answer: 1001
Explanation:
7 in binary is 0111; invert bits → 1000; add 1 → 1001.

13. What is the effect of adding a positive and a negative number in two’s complement?

Answer: The result is the algebraic sum of the two numbers

Explanation:
Two’s complement addition handles signed numbers correctly, combining positive and
negative values.

14. What happens when you subtract a larger number from a smaller number in unsigned
binary arithmetic?

Answer: Underflow occurs, and the result wraps around

Explanation:
Unsigned arithmetic cannot represent negative results, so subtraction of a larger from
smaller results in wrap-around (large positive value).

15. How do you detect overflow in signed binary addition?

Answer: Overflow occurs if the carry into the sign bit differs from the carry out
Explanation:
If carry into and out of the most significant bit differ, overflow has happened.

16. Perform the binary subtraction: 11010 - 1011 using two’s complement.

Answer: 01111
Explanation:
Take two’s complement of 1011 (4 bits: 01011 → invert 10100, add 1 → 10101), add to
11010 → 01111.

17. How is subtraction of multi-bit binary numbers implemented in a digital circuit?

Answer: Using an adder and inverter circuits to form two’s complement

Explanation:
Subtractor circuits use adders combined with two’s complement conversion of the
subtrahend.

22
Digital

18. What is the sum of the two’s complement numbers 1101 and 1011?

Answer: 10000 (overflow)

Explanation:
1101 (-3) + 1011 (-5) = 10000 (-8 but in 4 bits overflow occurs, so final 0000).

19. What is the importance of the carry flag in binary addition?

Answer: Indicates an overflow in unsigned addition

Explanation:
The carry flag signals if an addition has exceeded the maximum value of the bit width.

20. How can subtraction be performed without two’s complement?

Answer: By using borrow in subtraction circuits

Explanation:
Subtraction can also be done by borrowing bits similar to decimal subtraction, but it's more
complex than two’s complement method.

21. What is the binary addition of 1110 and 0011?

Answer: 10001
Explanation:
Add bitwise, carry as needed: 0+1=1, 1+1=0 carry 1, 1+0+1=0 carry 1, 1+0+1=0 carry 1 →
extra carry gives 5-bit result.

22. What is the result when you add two binary numbers and get a carry out of the most
significant bit?

Answer: Overflow or carry out

Explanation:
Carry out beyond the fixed bit size indicates an overflow for unsigned numbers.

23. How do you perform subtraction using 1’s complement?

Answer: Add the 1’s complement of the subtrahend and add an end-around carry
Explanation:
1’s complement method requires adding the complement and adding the carry if any.

23
Digital

24. What is the 1’s complement of 1010?

Answer: 0101
Explanation:
Flip all bits from 1 to 0 and 0 to 1.

25. What is the sum of 10101 and 11011 in binary?

Answer: 110000
Explanation:
Add bitwise with carries: result is 6 bits.

26. How do you handle negative numbers in floating-point addition?

Answer: By aligning exponents and adding mantissas considering signs

Explanation:
Floating point addition requires exponent alignment, then add mantissas with sign
consideration.

27. What is the result of subtracting 111 from 1010 in binary?

Answer: 011
Explanation:
Convert 111 to two’s complement, add to 1010; result is 3 in decimal.

28. How do you detect borrow in binary subtraction?

Answer: When minuend bit is less than subtrahend bit

Explanation:
Borrow occurs if the current bit of the minuend is smaller than subtrahend.

29. What is the decimal equivalent of the binary two’s complement number 11111011?

Answer: -5
Explanation:
Invert bits and add 1 to find magnitude; negative sign due to MSB=1.

30. What is the result of adding 101 and 111 in binary?

24
Digital

Answer: 1100
Explanation:
Perform bitwise addition with carry.

31. Why are arithmetic operations in digital computers typically performed in binary?

Answer: Because binary is simple to implement with two voltage levels

Explanation:
Digital circuits can easily represent two states (0 and 1) with voltage levels.

32. What is the difference between ripple carry adder and carry look-ahead adder?

Answer: Carry look-ahead is faster due to parallel carry calculation

Explanation:
Ripple carry waits for each carry sequentially, carry look-ahead computes carries faster.

33. What is the binary addition of 1001 and 0110?

Answer: 1111
Explanation:
Bitwise addition with no overflow.

34. What is the function of the overflow flag in CPU?

Answer: Indicates arithmetic overflow in signed operations

Explanation:
Overflow flag alerts when result exceeds the representable range.

35. How does a half adder differ from a full adder?

Answer: Full adder adds carry input, half adder does not
Explanation:
Half adder adds two bits; full adder adds three bits (including carry).

25
Digital

36. How do you subtract binary numbers using borrow?

Answer: Borrow 1 from higher bit if current bit is insufficient

Explanation:
Similar to decimal subtraction, borrowing is required if minuend bit < subtrahend bit.

37. What is the two’s complement of 0001?

Answer: 1111 (in 4-bit)

Explanation:
Invert bits: 1110; add 1 → 1111.

38. What is the decimal equivalent of the binary number 1011 (unsigned)?

Answer: 11
Explanation:
Add place values of set bits.

39. What is the carry out of adding 1111 and 0001 in 4-bit binary?

Answer: 1
Explanation:
Sum is 10000, carry out is the leftmost bit.

40. What is the result of subtracting 1000 from 1101 in binary?

Answer: 0101
Explanation:
1101 - 1000 = 0101 (5 decimal).

41. What is the use of sign extension in binary arithmetic?

Answer: To preserve the sign of a number when increasing bit width

Explanation:
Sign extension fills new bits with the sign bit to maintain value.

26
Digital

42. What is the binary addition result of 111 and 001?

Answer: 1000
Explanation:
Perform bitwise addition with carry.

43. What is the difference between fixed-point and floating-point arithmetic?

Answer: Fixed-point has fixed decimal place, floating-point has exponent

Explanation:
Floating-point can represent a wider range of values.

44. What is the binary subtraction of 1010 and 0101?

Answer: 0101
Explanation:
Use two’s complement of 0101 (1011), add to 1010 → 0101.

45. What does the carry flag indicate after an addition operation?

Answer: Carry out of the most significant bit

Explanation:
Indicates overflow in unsigned arithmetic.

46. What is the result of adding binary numbers 110 and 101?

Answer: 1011
Explanation:
Add bitwise with carries.

47. How is subtraction implemented in an ALU?

Answer: Using addition with two’s complement of the subtrahend

Explanation:
Simplifies hardware design.

27
Digital

48. What is the decimal equivalent of two’s complement 1110 (4-bit)?

Answer: -2
Explanation:
Invert bits 0001, add 1 → 0010 = 2, sign negative.

49. How do you add binary fractions?

Answer: Align binary points and add bitwise

Explanation:
Same as decimal addition but with binary digits.

50. What is the result of subtracting 1110 from 1011 (unsigned)?

Answer: Underflow
Explanation:
1011 (11 decimal) - 1110 (14 decimal) is invalid in unsigned binary, causes underflow.

Binary Multiplication:

1. What is the binary multiplication of 101 and 11?

Answer: 1111
Explanation:
101 (5 decimal) × 11 (3 decimal) = 1111 (15 decimal).

2. How is binary multiplication similar to decimal multiplication?

Answer: Both use shift and add operations

Explanation:
Binary multiplication uses shifts and adds just like decimal multiplication uses place value
shifts and addition.

28
Digital

3. What is the product of 110 and 101 in binary?

Answer: 11110
Explanation:
6 × 5 = 30 decimal, which is 11110 in binary.

4. What operation replaces multiplication in binary hardware circuits?

Answer: Shift and add

Explanation:
Multiplication is done by shifting and adding partial products.

5. How do you multiply binary numbers using the shift-and-add method?

Answer: Shift the multiplicand and add it if the multiplier bit is 1

Explanation:
For each ‘1’ bit in multiplier, add shifted multiplicand to the result.

6. What is the result of multiplying 111 by 10 in binary?

Answer: 1110
Explanation:
7 × 2 = 14 decimal = 1110 binary.

7. What is the significance of the partial products in binary multiplication?

Answer: Intermediate sums based on multiplier bits

Explanation:
Partial products represent shifted multiplicands added according to multiplier bits.

8. What is the binary multiplication of 1001 and 11?

Answer: 11011
Explanation:
9 × 3 = 27 decimal = 11011 binary.

29
Digital

9. How does Booth’s algorithm improve binary multiplication?

Answer: Reduces the number of additions

Explanation:
Booth’s algorithm encodes multiplier bits to minimize adds and handle signed numbers.

10. What is the product of multiplying any binary number by 1?

Answer: The number itself

Explanation:
Multiplying by 1 doesn’t change the number.

11. How do you multiply a binary number by 2?

Answer: Shift left by one bit

Explanation:
Shifting left by 1 multiplies by 2.

12. What happens to the product if you multiply by 0 in binary?

Answer: The product is zero

Explanation:
Anything multiplied by zero results in zero.

13. How many partial products are there in multiplying two n-bit binary numbers?

Answer: n
Explanation:
Each bit in multiplier produces one partial product.

14. What is the result of multiplying 1010 by 0 in binary?

Answer: 0
Explanation:
Any number times zero is zero.

30
Digital

15. What is the result of multiplying 101 by 0 in binary?

Answer: 0
Explanation:
Same as above.

16. What is the binary product of 1111 and 1111?

Answer: 11100001
Explanation:
15 × 15 = 225 decimal = 11100001 binary.

17. How does signed binary multiplication differ from unsigned?

Answer: It uses two’s complement and sign extension

Explanation:
Signed multiplication requires handling sign bits properly.

18. What is the two’s complement of a number used for in multiplication?

Answer: To represent negative numbers

Explanation:
Allows signed multiplication.

19. What is the product of 1101 (13 decimal) and 11 (3 decimal) in binary?

Answer: 1001111
Explanation:
13 × 3 = 39 decimal = 1001111 binary.

20. What is the minimum number of bits needed to store the product of two n-bit
numbers?

Answer: 2n bits
Explanation:
Multiplying two n-bit numbers can produce a result up to 2n bits.

31
Digital

21. What is the binary multiplication of 10 and 10?

Answer: 100
Explanation:
2 × 2 = 4 decimal = 100 binary.

22. How do you verify binary multiplication results?

Answer: By converting to decimal and multiplying

Explanation:
Check correctness by decimal equivalence.

23. What is the product of 101 and 100 in binary?

Answer: 10100
Explanation:
5 × 4 = 20 decimal = 10100 binary.

24. What is the binary multiplication of 1 and 1101?

Answer: 1101
Explanation:
Multiplying by 1 returns the same number.

25. What does the multiplier bit ‘0’ do in multiplication?

Answer: Skip adding the multiplicand

Explanation:
If multiplier bit is zero, partial product is zero.

26. How is multiplication handled in hardware?

Answer: Using shift registers and adders

Explanation:
Shift registers shift multiplicand, adders accumulate partial products.

32
Digital

27. What is the product of 1000 and 111?

Answer: 111000
Explanation:
8 × 7 = 56 decimal = 111000 binary.

28. What is the binary multiplication of 0 and any number?

Answer: 0
Explanation:
Anything multiplied by zero is zero.

29. What does shifting left by n bits do in binary?

Answer: Multiplies by 2^n

Explanation:
Each left shift multiplies by 2.

30. How is overflow detected in binary multiplication?

Answer: When product exceeds register size

Explanation:
If result bits exceed register size, overflow occurs.

31. What is the product of 1110 and 11 in binary?

Answer: 101010
Explanation:
14 × 3 = 42 decimal = 101010 binary.

32. What is the main disadvantage of shift-and-add multiplication?

Answer: It is slow for large bit-widths

Explanation:
Requires many sequential steps.

33
Digital

33. How do you multiply binary fractions?

Answer: Multiply normally, adjust binary point position

Explanation:
Treat bits as integers, then place binary point.

34. What is the binary product of 1010 and 10?

Answer: 10100
Explanation:
10 × 2 = 20 decimal = 10100 binary.

35. How many addition operations are needed in shift-and-add multiplication?

Answer: Equal to number of ‘1’ bits in multiplier

Explanation:
Add multiplicand only when multiplier bit is 1.

36. What is Booth’s algorithm used for?

Answer: Efficient signed multiplication

Explanation:
Handles signed numbers with fewer additions.

37. What is the product of 111 and 1 in binary?

Answer: 111
Explanation:
Multiplying by 1 returns the same number.

38. What is the product of 100 and 10 in binary?

Answer: 1000
Explanation:
4 × 2 = 8 decimal = 1000 binary.

34
Digital

39. How do you multiply negative binary numbers?

Answer: Convert to two’s complement and multiply

Explanation:
Use two’s complement for signed multiplication.

40. What is the result of multiplying 1011 and 1?

Answer: 1011
Explanation:
Multiplying by 1 returns the same number.

41. How do you perform multiplication of floating-point numbers?

Answer: Multiply mantissas and add exponents

Explanation:
Separate mantissa and exponent, multiply/add accordingly.

42. What is the binary product of 11 and 11?

Answer: 1001
Explanation:
3 × 3 = 9 decimal = 1001 binary.

43. What is the maximum product bit-length for two 8-bit numbers?

Answer: 16 bits
Explanation:
Multiplying two 8-bit numbers can produce up to 16-bit results.

44. How is hardware multiplier speed improved?

Answer: Using parallel multipliers or Booth’s algorithm

Explanation:
Parallelism and algorithm optimization improve speed.

35
Digital

45. What is the product of 101 and 0 in binary?

Answer: 0
Explanation:
Multiplying by zero yields zero.

46. What is the result of multiplying 1 by 1 in binary?

Answer: 1
Explanation:
1 × 1 = 1.

47. How does sign extension affect multiplication?

Answer: Ensures correct sign in signed multiplication

Explanation:
Extends sign bit to maintain value in larger bit-widths.

48. What is the binary multiplication of 10 and 11?

Answer: 110
Explanation:
2 × 3 = 6 decimal = 110 binary.

49. What is the advantage of Booth’s algorithm?

Answer: Reduces the number of additions/subtractions

Explanation:
Minimizes operations for faster multiplication.

50. What happens if you multiply by 1 shifted left by n bits?

Answer: Multiplies by 2^n

Explanation:
Shifting 1 left n times equals multiplying by 2^n.

36
Digital

Binary Division:

1. What is the quotient of 1100 ÷ 10 in binary?

Answer: 110
Explanation:
12 ÷ 2 = 6 decimal, which is 110 binary.

2. What is the remainder when 1011 is divided by 10 in binary?

Answer: 1
Explanation:
11 ÷ 2 = 5 remainder 1.

3. How do you perform binary division?

Answer: Repeated subtraction and shift

Explanation:
Similar to decimal long division, subtract divisor multiples and shift.

4. What is the result of dividing 1000 by 100 in binary?

Answer: 10
Explanation:
8 ÷ 4 = 2 decimal = 10 binary.

5. What does a remainder of zero indicate in binary division?

Answer: Exact division

Explanation:
The dividend is divisible by the divisor without remainder.

6. What is the binary division of 1110 ÷ 11?

Answer: 110
Explanation:
14 ÷ 3 = 4 remainder 2 (but remainder not asked here).

37
Digital

7. What is the quotient of 10101 ÷ 11 in binary?

Answer: 101
Explanation:
21 ÷ 3 = 7 decimal = 101 binary.

8. How do you handle division when the divisor is larger than dividend in binary?

Answer: Quotient is zero

Explanation:
Divisor > dividend means 0 quotient and remainder = dividend.

9. What is the result of dividing 1101 by 1 in binary?

Answer: 1101
Explanation:
Any number divided by 1 remains the same.

10. How do you verify the result of binary division?

Answer: Quotient × divisor + remainder = dividend

Explanation:
Use this formula to confirm correctness.

11. What is the binary remainder when dividing 110 by 101?

Answer: 1
Explanation:
6 ÷ 5 = 1 remainder 1.

12. What is the quotient of 10011 ÷ 11?

Answer: 101
Explanation:
19 ÷ 3 = 6 remainder 1 (6 decimal = 110 binary, but 101 here means 5? Check carefully.)
Actually 19 / 3 = 6 remainder 1, quotient is 110. Correction:

Answer: 110
Explanation:
19 ÷ 3 = 6 decimal = 110 binary.

38
Digital

13. What is the significance of shifting in binary division?

Answer: Align bits for subtraction

Explanation:
Shifting helps align divisor bits with dividend bits.

14. What is the quotient of 1111 ÷ 11 in binary?

Answer: 101
Explanation:
15 ÷ 3 = 5 decimal = 101 binary.

15. What happens if the divisor is 0 in binary division?

Answer: Division undefined

Explanation:
Dividing by zero is undefined.

16. How many bits can the quotient have when dividing n-bit by m-bit binary numbers?

Answer: n - m + 1 bits
Explanation:
The quotient length depends on dividend and divisor bit-length difference.

17. What is the remainder when 1010 is divided by 11 in binary?

Answer: 1
Explanation:
10 ÷ 3 = 3 remainder 1.

18. What is the result of dividing 100 by 10 in binary?

Answer: 10
Explanation:
4 ÷ 2 = 2 decimal = 10 binary.

39
Digital

19. What is the main step in binary division?

Answer: Compare and subtract

Explanation:
Compare shifted divisor with dividend bits and subtract if larger.

20. How is division by powers of two done efficiently in binary?

Answer: Right shift

Explanation:
Dividing by 2^n is a right shift by n bits.

21. What is the quotient of 1010 ÷ 101?

Answer: 10
Explanation:
10 decimal ÷ 5 decimal = 2 decimal = 10 binary.

22. What is the remainder when 1010 is divided by 101?

Answer: 0
Explanation:
10 ÷ 5 = 2 with no remainder.

23. How do you find the next step in binary long division?

Answer: Shift divisor or bring down next bit

Explanation:
Like decimal long division, adjust bits accordingly.

24. What is the binary division result of 1110 ÷ 110?

Answer: 1
Explanation:
14 ÷ 6 = 2 remainder 2, quotient is 1 (since 6 × 2 = 12 which is less than 14, quotient should
be 10 (2 decimal). Correction:

Answer: 10
Explanation:
14 ÷ 6 = 2 decimal = 10 binary.

40
Digital

25. What is the binary remainder of 1110 ÷ 110?

Answer: 10
Explanation:
14 - (6 × 2) = 14 - 12 = 2 decimal = 10 binary.

26. What is the quotient of 1000 ÷ 11 in binary?

Answer: 11
Explanation:
8 ÷ 3 = 2 remainder 2, 2 decimal is 10 binary. Correction:

8 ÷ 3 = 2 remainder 2
Quotient = 10 (binary), remainder = 10 (binary).

27. What is the binary division of 1101 by 10?

Answer: 110
Explanation:
13 ÷ 2 = 6 decimal = 110 binary.

28. What is the quotient when dividing any number by itself in binary?

Answer: 1
Explanation:
Any number divided by itself is 1.

29. How is division implemented in computer hardware?

Answer: Using repeated subtraction or restoring division

Explanation:
Hardware uses algorithms like restoring or non-restoring division.

30. What is the result of dividing 1100 by 11 in binary?

Answer: 100
Explanation:
12 ÷ 3 = 4 decimal = 100 binary.

41
Digital

31. What is the remainder of 1100 ÷ 11?

Answer: 0
Explanation:
12 is exactly divisible by 3.

32. How do you handle division when dividend is zero?

Answer: Quotient is zero

Explanation:
0 divided by any non-zero number is 0.

33. What is the result of dividing 111 by 1 in binary?

Answer: 111
Explanation:
Any number divided by 1 remains the same.

34. What is the quotient of 10010 ÷ 10 in binary?

Answer: 1001
Explanation:
18 ÷ 2 = 9 decimal = 1001 binary.

35. What is the remainder of 10010 ÷ 10 in binary?

Answer: 0
Explanation:
18 ÷ 2 is exact division.

36. What does the divisor represent in binary division?

Answer: Number to divide by

Explanation:
The divisor is the number the dividend is divided by.

42
Digital

37. What is the binary quotient of 101100 ÷ 100?

Answer: 1011
Explanation:
44 ÷ 4 = 11 decimal = 1011 binary.

38. What is the remainder of 101100 ÷ 100?

Answer: 0
Explanation:
44 is divisible by 4 exactly.

39. How is the division algorithm in binary similar to decimal division?

Answer: Both use repeated subtraction and shifting

Explanation:
Long division principles apply similarly.

40. What is the quotient of 1111 ÷ 100 in binary?

Answer: 11
Explanation:
15 ÷ 4 = 3 decimal = 11 binary.

41. What is the remainder of 1111 ÷ 100 in binary?

Answer: 11
Explanation:
15 - (4 × 3) = 15 - 12 = 3 decimal = 11 binary.

42. What is the difference between restoring and non-restoring division?

Answer: Restoring restores dividend after negative subtraction

Explanation:
Restoring division corrects partial remainders, non-restoring does not.

43
Digital

43. What is the binary division result of 1011 ÷ 10?

Answer: 101
Explanation:
11 ÷ 2 = 5 decimal = 101 binary.

44. What is the remainder when 1011 is divided by 10?

Answer: 1
Explanation:
11 ÷ 2 = 5 remainder 1.

45. How can division by powers of two be optimized in hardware?

Answer: Use right shift

Explanation:
Right shift by n bits divides by 2^n.

46. What is the quotient of 100000 ÷ 10 in binary?

Answer: 10000
Explanation:
32 ÷ 2 = 16 decimal = 10000 binary.

47. What is the remainder

of 100000 ÷ 10 in binary?
Answer: 0
Explanation:
Exact division by 2.

48. How many bits does the quotient of 111000 ÷ 111 have?

Answer: 3 bits
Explanation:
56 ÷ 7 = 8 decimal = 1000 binary (4 bits) actually. Correction:

Quotient = 1000 (4 bits).

44
Digital

49. What is the quotient of 111000 ÷ 111?

Answer: 1000
Explanation:
56 ÷ 7 = 8 decimal = 1000 binary.

50. What is the remainder of 111000 ÷ 111?

Answer: 0
Explanation:
56 is divisible by 7 exactly.

Floating Point Numbers.

1. What is a floating point number?

Answer: A number representation that can support a wide range of values by using a fixed
number of bits divided into sign, exponent, and mantissa (or significand).
Explanation: It allows representation of very large or small real numbers approximately.

2. What are the main components of a floating point number?

Answer: Sign bit, exponent, and mantissa (or significand).

Explanation: Sign indicates positive/negative, exponent scales the number, mantissa holds
the precision digits.

3. What is the IEEE 754 standard?

Answer: A widely used standard for floating point arithmetic in computers.

Explanation: It defines formats for single precision (32-bit) and double precision (64-bit)
floating point numbers.

45
Digital

4. How many bits are in a single precision IEEE 754 float?

Answer: 32 bits.
Explanation: 1 sign bit + 8 exponent bits + 23 mantissa bits.

5. How many bits are in a double precision IEEE 754 float?

Answer: 64 bits.
Explanation: 1 sign bit + 11 exponent bits + 52 mantissa bits.

6. What does the exponent represent in floating point?

Answer: The power of two by which the mantissa is multiplied.

Explanation: It scales the mantissa to represent very large or small numbers.

7. What is the bias in IEEE 754 single precision exponent?

Answer: 127.
Explanation: The stored exponent is actual exponent + 127.

8. What is the bias in IEEE 754 double precision exponent?

Answer: 1023.
Explanation: The stored exponent is actual exponent + 1023.

9. How is zero represented in IEEE 754 floating point?

Answer: All exponent bits zero and mantissa zero, with sign bit 0 or 1 for +0 or -0.
Explanation: Special case in the standard.

10. What is a normalized floating point number?

Answer: A number where the mantissa is adjusted so the leading bit is 1 (implicit in IEEE
754).
Explanation: Normalization maximizes precision.

46
Digital

11. What is a denormalized (subnormal) number?

Answer: A number with exponent bits all zero but mantissa non-zero, representing very
small values.
Explanation: Allows gradual underflow near zero.

12. How does floating point addition handle different exponents?

Answer: The number with the smaller exponent is shifted right until exponents match
before addition.
Explanation: Ensures proper alignment of mantissas.

13. What is floating point rounding?

Answer: Approximation of a result to fit within mantissa bits.

Explanation: IEEE 754 defines rounding modes like round to nearest even.

14. What is overflow in floating point arithmetic?

Answer: When a result exceeds the largest representable number.

Explanation: Results in infinity or error.

15. What is underflow in floating point arithmetic?

Answer: When a result is smaller than the smallest representable normalized number.
Explanation: May result in subnormal numbers or zero.

16. How is infinity represented in IEEE 754?

Answer: Exponent all ones and mantissa all zeros.

Explanation: Indicates overflow or division by zero.

17. What is NaN in floating point?

Answer: Not a Number; special value representing undefined or unrepresentable results.

Explanation: Exponent all ones and mantissa non-zero.

47
Digital

18. How is the sign bit interpreted?

Answer: 0 means positive, 1 means negative.

Explanation: Simple sign encoding.

19. What is the difference between single and double precision floating point?

Answer: Double precision has more bits for exponent and mantissa, providing higher range
and precision.
Explanation: Trade-off between memory and accuracy.

20. Why is floating point arithmetic not exact?

Answer: Because of finite precision and rounding errors.

Explanation: Some decimal numbers cannot be represented exactly in binary.

21. What is machine epsilon?

Answer: The smallest difference between 1 and the next larger floating point number.
Explanation: Measures floating point precision.

22. How is floating point multiplication performed?

Answer: Multiply mantissas, add exponents, adjust sign.

Explanation: Follows the rules of exponents and significant digits.

23. What is denormalized number's purpose?

Answer: To fill the gap between zero and the smallest normalized number.
Explanation: Allows smooth underflow and gradual loss of precision.

24. What is the largest positive number in IEEE 754 single precision approximately?

Answer: About 3.4 × 10^38.

Explanation: Determined by max exponent and mantissa bits.

48
Digital

25. What is floating point precision?

Answer: Number of significant digits that can be accurately represented.

Explanation: Limited by mantissa bit length.

26. How does floating point subtraction work?

Answer: Similar to addition; align exponents, subtract mantissas.

Explanation: Can cause loss of significance for close values.

27. What is the representation of -0 in IEEE 754?

Answer: Sign bit 1, exponent and mantissa all zero.

Explanation: Distinguishable from +0.

28. How are special cases handled in floating point?

Answer: Using reserved exponent and mantissa patterns.

Explanation: For zero, infinity, NaN.

29. What is the significance of implicit leading 1 in mantissa?

Answer: It saves storage by not storing the leading 1 explicitly for normalized numbers.
Explanation: Improves precision.

30. Why do floating point numbers have limited accuracy?

Answer: Because only a fixed number of bits are used for mantissa.
Explanation: Causes rounding and representation errors.

31. What is the range of exponents in IEEE 754 single precision?

Answer: -126 to +127 (after bias adjustment).

Explanation: Due to 8-bit exponent and bias 127.

49
Digital

32. What does underflow mean?

Answer: Result is too small to be represented as normalized.

Explanation: May be represented as subnormal or zero.

33. How does floating point division work?

Answer: Divide mantissas, subtract exponents, adjust sign.

Explanation: Similar logic to multiplication.

34. What is a floating point exception?

Answer: An error condition like overflow, underflow, division by zero, invalid operation.
Explanation: May trigger special handling.

35. How is precision affected by exponent size?

Answer: Larger exponent range does not increase precision, only range.
Explanation: Precision depends on mantissa bits.

36. What happens if floating point addition involves very different magnitudes?

Answer: Smaller number may be lost (swallowed) due to limited mantissa bits.
Explanation: Called catastrophic cancellation.

37. What is a subnormal number?

Answer: A number with exponent zero and non-zero mantissa.

Explanation: Represents very small numbers near zero.

38. What is the floating point representation of 1.0 in IEEE 754 single precision?

Answer: Sign=0, exponent=127 (biased), mantissa=0.

Explanation: Normalized number with zero fractional part.

50
Digital

39. How do computers represent decimal fractions like 0.1 in binary floating point?

Answer: Approximately, often with repeating binary fractions.

Explanation: Causes rounding errors.

40. What is the smallest positive normalized number in IEEE 754 single precision?

Answer: About 1.17549435 × 10^-38.

Explanation: Determined by smallest exponent and implicit 1.

41. What is the role of the mantissa in floating point?

Answer: Represents the significant digits of the number.

Explanation: Determines precision.

42. How is the exponent stored in floating point?

Answer: As a biased unsigned integer.

Explanation: Allows representation of negative exponents.

43. What is the effect of rounding mode on floating point operations?

Answer: Determines how results are rounded when they cannot be represented exactly.
Explanation: Affects numerical accuracy and behavior.

44. How is negative zero useful in floating point?

Answer: Can represent direction of zero in some computations.

Explanation: Useful in certain mathematical functions.

45. What is the floating point representation of infinity?

Answer: Exponent all ones, mantissa zero.

Explanation: Represents overflow or division by zero.

51
Digital

46. Why is floating point comparison tricky?

Answer: Due to rounding errors, exact equality is unreliable.

Explanation: Use tolerance or epsilon comparisons.

47. What does NaN signify?

Answer: Result of undefined operations like 0/0 or sqrt(-1).

Explanation: Indicates invalid numeric results.

48. How can floating point precision loss affect algorithms?

Answer: Causes inaccuracies, instability, or failure in numerical computations.

Explanation: Care needed in algorithm design.

49. What is the difference between normalized and denormalized numbers?

Answer: Normalized have implicit leading 1; denormalized do not and allow representation
near zero.
Explanation: Denormalized handle gradual underflow.

50. How does floating point representation affect computer

graphics?
Answer: Limits precision of coordinates, colors, and calculations.
Explanation: Floating point artifacts can appear in rendering.

52