Ragged arrays are useful data structures because of their memory-saving capability. For example, consider a spreadsheet with the potential for 100,000 rows by 20,000 columns.

Java supports arrays. Each element occupies the same number of bytes, and the exact number depends on the type of the element’s data item. Furthermore, all elements share the same type.

Specify, design and test new classes using the principle of information hiding for the following data structures: array-based collections (including dynamic arrays), list-based collections ...