One form of this construct exhibits optimal performance with the impossible-to-implement Bélády’s algorithm. The valgrind utility is used to debug errors with this (10[1])construct. (10[2])Insufficient (10[1])locality (10[1]-5[1])of this construct leads (10[2])to thrashing, (10[1]-5[1])which involves (10[2])pages (10[1])of it constantly (10[1])swapping. (10[3]-5[2])Calling “free” twice can lead to (10[1])an incorrect (10[1])access of this construct (10[4]-5[1])called (10[1])a segfault. (10[5]-5[1])Pointers (10[2]-5[3])are so named (10[1])for “pointing” (10[3]-5[1])to this construct. (10[5]-5[2])A form of this construct (10[1])known as a cache (10[2])can be used to reduce the number (10[2])of reads (10[2])and writes to this construct’s “random-access” (10[1])form. (10[6]-5[1])For 10 points, (10[3])name this construct (10[1])whose size (10[1])is measured in gigabytes. (10[1])■END■ (10[6])