PROBLEM BACKGROUND:

A table is an unordered group of $$records$$ or key$-$value pairs each of which has a designated field called the key field. Records within the table are identified by the value of the key field. The table is an appropriate ADT for information retrieval systems in which individual records must be accessed frequently $($ and quickly $)$ but the entire collection of records must never be processed sequentially.

Synonymous terms are lookup table and map. The latter stresses that a table is really a mapping.

PROBLEM STATEMENT:

Design a table ADT

Specifically write a table class.

It must be generic $($ i$.$e$.$ templated $)$ and contain all the necessary attributes and actions $($ data members and member functions $)$ for the table class to behave as expected.

You must write a table.t file that works for the provided files: tableSpecificOps$1.$h$,$ table.h pair.h pair.cpp driver.cpp$.$

$($ you will have to create tableSpecificOps$1.$cpp and table.cpp as well $)$

See the window captures below for a running program

DELIVERABLES:

hard: table.t$,$ tableSpecificOps$1.$cpp all stapled of course

soft

table.t $,$ table.cpp$,$ and tableSpecificOps$1.$cpp

grading will be based on:

$1.$ table class design consisting of all necessary components

$2.$ table class compiling

$3.$ the program running successfully with all the above mentioned files

Example working driver for the table class