3. Extend any of the search schemes to access alt entries between a starting entry name, Name-lo, and an ending entry name, Name-hi. Develop a scheme which accesses data by entry name and attribute.
4. The initialization scheme for the binary search strategy implemented in Figure MCA-8 guides the search properly only if logv2(N) is an exact integer. Devise an initialization scheme that works for any N.
5. Design an M(content addressable) that uses a hash function. Implement the operations shown in Figure MCA-l. Predict the performance of your system as a function of the fullness of the memory.

292