CS 159 Lab 12

The memory address represented by the name of an array is added to the index value specified to determine where in memory the desired element can be found.

True

All elements of one array can be assigned to another through the use of the assignment operator and the name of each array (example: x = y).

False

While the default technique of passing array elements is by value it is possible to pass elements by address using the & operator (and the * operator in the function being called).

True

If more than one element of an array is passed to a function in a single function call then those elements are passed by address.

False

Using the name of an array in the data list of a single printf function will result in the output of all elements of the array.

False

All arrays sent to a given function must be of the same defined size.

False

The selection sorting algorithm will complete at most one exchange involving two elements per pass.

True

The selection sorting algorithm can only be used to sort data in an ascending order (from smallest to largest).

False

On the final pass through the selection sorting algorithm TWO values are brought over from the unsorted list into the sorted list.

True

The bubble sorting algorithm compares neighboring elements in the unsorted list of the array and swaps their positions when they are not in the desired order.

True

The bubble sorting algorithm is optimized to stop the process when the array is detected as being sorted.

False

Once the insertion sort places a value in the sorted list that value will never move again in the remainder of the passes.

False

The insertion sorting algorithm begins with one value in the sorted list before the first pass.

True

To sort an array of SIZE elements a total of SIZE - 1 passes are required to guarantee that the data is sorted using the selection, bubble, or insertion sort.

True

When an array is not sorted and the data in the array is unique the linear searching algorithm requires every element to be compared with the target before it can be concluded that the target is not present in the array.

True

The binary searching algorithm will always find a target in an array faster than the linear searching algorithm.

False

The binary searching algorithm will terminate when the first variable is greater than the last.

True

The linear and binary searching algorithms perform in the same amount of time that a given value is not present in an array.

False

The binary searching algorithm should always be used for searching.

False