Why does finding the millionth item in a list cost the same as the first, and how does a hash function give dictionaries that speed too?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
A list of integers starts at memory address 2000, and each integer takes 4 bytes (one byte is 8 bits). Using the video's address arithmetic, assign the byte address where element 9 starts to address, and how many bits past the start of the block it lies to offset_bits.