C++

Part I (A) Identify a data structure that would be well-suited for each of the following data collections/application (be specific about data structure and the type of that data structure, e.g., doubly-linked list) (B) Briefly in one or two sentences explain why you have selected that data structure:

a) the 64 squares on a chess board to be used for processing and evaluating moves

b) a collection requiring quick adding, removing, and searching without any particular relationships or priorities among between the data elements

c) a collection of operations for undoing and redoing (such as with a word processor)

d) a concept map

f) a Morse Code processor for the data received in dits and dashes and determining letters transmitted

g) a collection of web addresses to be used for back and forward navigation (as with the back and forward buttons in a web browser)

e) a food web in nature

h) a collection of orders to be processed in the order in which they are received

i) a collection used to evaluate the best course of action through a sequence of moves such as in a chess game

j) a collection for cities and roads to be used to determine the best route between a starting city and a destination city

Part II After discussing each in your group, identify a specific and fitting collection/application for each of the following data structures (be specific about which type of that data structure as needed, e.g., binary search tree this should be an example that you think up).

Array/vector

Stack

Queue

Linked list (not stack or queue)

Tree

Hash table

Heap

Graph

Hypergraph

Part III Give a fitting and specific example from the web for each of the following data structure:

Array/vector

Stack

Queue

Linked list (not stack or queue)

Tree

Hash table

Heap

Graph

Hypergraph In chemistry, hypergraphs can be used to represent complex molecules such as organometallic compounds or benzenoid systems (see https://link.springer.com/chapter/10.1007%2F978-3-319-00080-0_7 ).