フリー問題

問題文

An engineer reads how the region-based next-hop selection is implemented. Which statement is correct?

選択肢

1. Because the regions of the key space are held to a single size, each boundary lies exactly one region width beyond the one before it starting from nought, so an implementation may leave the boundary values unstored, working out which region holds the key then comes down to a single lookup, and the algorithm itself leaves the choice of the ordering function to the implementation.
2. Because the regions of the key space are held to a single size, each boundary lies exactly one region width beyond the one before it starting from nought, so an implementation may leave the boundary offsets unstored, working out which region holds the key then comes down to a single division, and the algorithm itself leaves the choice of the ordering function to the implementation.
3. Because the regions of the key space are held to a single size, each boundary lies exactly one region width beyond the one before it starting from nought, so an implementation may leave the boundary offsets unstored, working out which region holds the key then comes down to a single lookup, and the algorithm itself leaves the choice of the hash function to the implementation.
4. Because the regions of the key space are held to a single size, each boundary lies exactly one region width beyond the one before it starting from nought, so an implementation may leave the boundary values unstored, working out which region holds the key then comes down to a single division, and the algorithm itself leaves the choice of the hash function to the implementation.