Reference no: EM133216829

Question 1.

Develop an efficient approach/algorithm where your Vector data structure would store all data, including duplicated data, using as little memory as possible. Note that storing each duplicated data in its own memory location is not memory efficient. Your approach/algorithm must not change the Vector data structure itself (do not change Vector.h). Use numerical examples to explain your approach/algorithm.

Question 2.

Given n data items, suppose that the number of unique data items is represented by the letter u and the number of duplicates is represented by the letter d, derive an algebraic relationship between n, d and u that would specify the situation where the data structure is being used in a memory efficient way. Show your working with explanation.

Question 3.

Write a C++ program that uses your template Vector data structure in Vector.h to demonstrate your memory efficient approach. Use numerical data that comes from a data file called mumbers. txt. In the designated space below, write your answer. Build and run in Codeblocks first. Check indentation and capitalisation when copying here from Codeblocks. Keep source, data and Codeblocks build in the Q3 folder.