When we use the linked list wasted memory formula, we may have to estimate the average size of the node because:
A. a pointer takes up a different amount of memory space in every node
B. we can never really be sure about how many bytes are used for integers, floats, etc. – it can vary from one line of code to another
C. if a node element has dynamic space, such as in a string data member, then the size of the node can vary
D. depending upon the amount of memory leak within a node, it may take up a different amount of memory space than other nodes without memory leak
C
You might also like to view...
What are relational operators?
What will be an ideal response?
What is Huffman coding?
a. Lossless data compression algorithm b. Sorting algorithm c. Data structure d. Programming language
A graph G has a spanning tree if and only if G is connected; from this it follows that to determine a spanning tree of a graph, the graph must be connected.
Answer the following statement true (T) or false (F)
Knowledge of a company’s formal and informal structures helps a systems analyst determine the people to interview during the systems analysis phase.
Answer the following statement true (T) or false (F)