we will be working with $$Table Abstractions$.$ A Table ADT allows us to search on the $$value$$ of the data without requiring a particular location to be known. It allows us to store the data using non$-$linear techniques. A hash table comes to mind as a good alternative for programs that require working by $$value$$ but that don$$t require that the data be sorted.