Step 1: Convert the memory size into a byte count.
An 8K memory does not mean exactly 8000 bytes, it means $8 \times 1024 = 8192$ bytes, since memory sizes are always counted in powers of two.
Step 2: Figure out how many addresses that spans.
If the chip holds 8192 bytes, it needs 8192 distinct addresses, running from the given starting address up through 8191 more locations.
Step 3: Add the span to the starting address.
Starting at $1000_H$, the last address is $1000_H + (2000_H - 1) = 1000_H + 1FFF_H$.
Step 4: Do the hex addition.
Adding these hex values gives $1000_H + 1FFF_H = 2FFF_H$, which is the highest address in this memory block.
\[ \boxed{2FFF_H} \]