1. In what sense are data structures such as arrays, lists, stacks, queues, and trees abstractions? 2. Describe an application that you would expect to involve a static data structure. Then describe...

1.
In what sense are data structures such as arrays, lists, stacks, queues, and trees abstractions?

2.
Describe an application that you would expect to involve a static data structure. Then describe an application that you would expect to involve a dynamic data structure.

3.
Describe contexts outside of computer science in which the pointer concept occurs.

4.
Give a formula for finding the entry in the
ith row and
jth column of a two-dimensional array if it is stored in column major order rather than row major order.

5.
In the Python, C, C++, Java, and C# programming languages, indices of arrays start at 0 rather than at 1. Thus the entry in the first row, fourth column of an array named Array is referenced by Array[0][3]. In this case, what address polynomial is used by the translator to convert references of the form Array[i][j] into memory addresses?