CS 159: Lab #13 True/False (Sorting, Searching)***

To conserve memory, the sorting of data is completed within the array rather than creating a second array

T

Both the sorted and unsorted lists exist within the same array as the process of sorting data continues

T

The goal of each sorting algorithm is to move data from the unsorted list to the sorted list of an array

T

A sort pass is the process of moving an element from the unsorted list to the sorted list.

T

Several sort passes will be necessary to sort most data sets.

T

From an efficiency point of view, it makes no difference whether the data is ultimately sorted largest to smallest or smallest to largest in an array

T

The selection sort will identify one value in the unsorted sublist to move and become a part of the sorted sublist

T

The bubble sort operates faster when moving the larger values to the highest index than when moving the smaller values towards index zero

F

The number of exchanges that can potentially occur on a given pass of the bubble sort may be greater than 1

T

The insertion sort takes a value from the unsorted sublist and inserts it into the proper location of the sorted sublist based on the values currently present in the sorted sublist

T

To sort an array of N elements N - 1 sort passes are required to guarantee that data always ends in a sorted state

T

The outer loop in each of the three sorting algorithms is responsible for ensuring the number of passes required are completed

T

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

T

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

F

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

F

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

F

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

T

It is possible that during a single pass of the selection sorting algorithm that the order of the data in the array will be the same as it was after the previous pass

T

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

T

The bubble sorting algorithm is optimized to stop the sorting process when the array is detected as being in asorted state

F

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

T

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

T

Searching assumes (1) the data in the array is unique, (2) the amount of data in the array is equal to its capacity, (3) the use of the binary search is always applied to a sorted array

T

The goal of a searching algorithm is to find the location of a target element inside of an array

T

In general, the use of the sequential search is limited to small data sets or those that are not searched often

T

To determine a target value is not found in an unsorted list while using the sequential searching algorithm, every element must be examined

T

One motivation for making use of the binary search instead of the sequential search is the poor worst case performance of using the sequential search with a large data set

T

With each comparison made in the binary search approximately half of the remaining elements in the array are eliminated as possible locations of the target

T

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

T

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

T

When using the binary search, the first variable is only greater than the last variable when the target is not found within the array

F

If a target value is not present in a sorted list then every element of that list must be compared before that fact can be determined

T

The binary searching algorithm can be modified to work with an array that has been sorted from largest (at index zero) to smallest (at index SIZE of the array minus one)

T

The binary searching algorithm is not applicable to locate a target when the values found in the array are not unique

F