The most recently asserted request

The first active request encountered along the priority chain

All active requests simultaneously

The highest-numbered active request

The logical/bitwise unit, because multiplication is implemented as repeated bit masking

The decimal/BCD adjustment unit used by DA A

A floating-point unit that converts A and B to floating point before multiplying

The integer arithmetic unit that performs binary multiplication and writes the 16-bit product into B:A

A=0x01C2 and B unchanged

A=0x01 and B=0xC2

A=0xC2 and B=0x01

A=0xC2 and B=0x18

Interrupt handlers execute faster than polling loops because they have priority

CPU time is not wasted checking for events that have not occurred

Polling cannot respond immediately

Interrupts reduce memory usage because they use an interrupt vector with specified priorities

Use DIV AB with B=16 because division and multiplication are symmetric

Use RRC A four times because rotating right by four positions equals times 16

Execute four consecutive left shifts (e.g., using RL A four times) to multiply by 2 four times

Execute one left shift and one SWAP to achieve times 16

It selects which interrupt has highest priority among the different interrupt service requests

It acts as a master gate that must be enabled for any interrupt to occur

It automatically enables all interrupts on reset

It replaces individual enable bits

Because ADD automatically clears the carry flag

Because ADD is faster than ADDC

Because the high-byte addition must include the carry generated by the low-byte addition

Because ADDC is only valid for signed arithmetic

0x9F

0x90

0x9A

0x0A

It eliminates the need for decoding logic

It enables limited parallelism while avoiding the size overhead of full horizontal encoding

It guarantees fastest possible execution

It allows unlimited signal activation per cycle