The Unsorted-Optimized array structure is used to store a data set.
Calculate its density if:
Each of the client's nodes contains 200 bytes of information and there
are 1,000,000 nodes in the data set.
(This was the previous problem, the problem I'm doing is based on it though, :)
Give the average number of memory accesses of the Unsorted-
Optimized array structure whose data set is described in part (b) of
the previous exercise:
a) Assuming all operations on the data set are equally probable.
The Attempt at a Solution
So I know the operations are: insert, fetch, update, and delete.
I'm just lost on where to even start on this problem. Could someone please give me a hint?