1

2

3

4

5

What information we need to compute how efficiently a data structure uses memory? A total bytes - the total amount of memory allocated to the structure, in bytes B. memory bytes - the amount of bytes available in memory nc information bytes - the amount of memory required to store the information stored in the structure, in bytes overhead bytes - the amount of memory required to maintain the structure, in bytes Which operations below are fundamental operations performed on data structures? A. Insert B. Update Oc Remove D. Fetch Which one of the term below is not a dominant term for the algorithm complexity? A. Structured OB. linear c. constant D. exponential When you select a data structure, which one are you going to use? OAThe one that is the fastest B. The one that uses least memory c. The one that cost the least - least expensive OD. A trade-off between A, B and C Which of the statements about copying objects are correct? After a Deep Copy, two different references to one object exist B. After a Deep Copy, two different objects exist After a Shallow Copy, two different references to one object exist OD. After a Shallow Copy, two different objects exist