Machine-translated by Google. Questions are authored in English.
Top

Discussion

Ordering each hash chain with the most recent declaration first means that

  • A.entries can be removed only from the end of the chain
  • B.a lookup naturally finds the innermost visible declaration
  • C.collisions can no longer occur within that bucket
  • D.the chain never needs to be searched beyond its first entry

Answer: B

The most closely nested rule is realised by the chain order itself. No separate scope search is needed, which is what makes the combined design so efficient. One hash and one short chain walk resolve any name, however deeply nested.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.