Chapter $1$: Overview and JAVA Review

$2.$ Define the term Data Structure.

$3.$ What is a built$-$in data structure?

$4.$ What three criteria are used to determine whether a data structure is acceptable for a particular application?

$7.$ Put the following terms in size order: node, field, data set.

$11.$ Give the four basic operations performed on data structures and tell what each operation does.

$16.$ Three algorithms A$,$ B$,$ and C are under consideration for the Insert operation of a particular data set. Through an analysis of these algorithms, their speed functions have been determined to be: Algorithm A: $23$n $+36$n $2$ ; Algorithm B: $6+$ n log$2($n $)+$ n ;

$($b$)$ Using Big$-$O analysis, calculate the value of each function.

$18.$ What is the maximum and minimum number of times the search loop will execute when searching through an array of $1,048,576$ integers if the search algorithm is

$($a$)$ the binary search?

$($b$)$ the sequential search?

$26.$ Two objects, objectA and objectB, are objects in the class Listing. The object objectA is copied to objectB. How many objects exist after the copy, if the copy is performed as:

$($a$)$ a deep copy?

$($b$)$ a shallow copy?

$27.$ Of the two types of copies discussed in the previous exercise, which one produces a clone $($an exact duplicate of an existing object$)?$