Question: 1. Compare and Contrast Dynamic vs Static memory and where in RAM memory each type of structure is placed. Describe Virtual Memory. 2. Compare and
1. Compare and Contrast Dynamic vs Static memory and where in RAM memory each type of structure is placed. Describe Virtual Memory.
2. Compare and contract Linked List data structure to Array data structure.
3. (a) Briefly describe Abstract Data Types (ADT) or Abstract Data structures in general.
3. (b) Describe the purpose of implementing a Queue, Stack, or Hashmap on an Array or Linked List. Describe why one would implement a Queue, Stack, or Hashmap.
4. Why is look-up faster for a Binary Tree then Linked List?
5. Why is it difficult to perform a binary search on a linked list?
6. Describe the process of analyzing the Big O Notation for a Stack or Queue.
7. Memory Allocation Analysis: Describe your process for calculating memory required for the following examples. Give an estimate in MB/GB of the amount of memory required.
(a) Array of Doubles that contains 100,000 elements.
(b) Linked List of chars contains 1,000,000 nodes.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
