code

A ________ algorithm is a method of locating a specific item of information in a larger collection of data.

 

• Linear

• Search

• binary

• sort

• sequential

The advantage of a binary search is its ________.

• simplicity

• readability

• complexity

• efficiency

• usability

Array elements must be ________ before a binary search can be performed.

• none

•  

  saved to a file

• randomized

•  

  copied to another array

• sorted

Using Binary Search, which elements in the following array are compared to the target when target = 50?

12,   23,   34,   42,   55,   61,   78,   80,   85,   93,   97,   99

•  

  61, 34, 42, 55

• 5, 2, 3, 4

• 61, 34, 55, 42

• 5, 2, 4, 3

• 78, 42, 61, 55

Using Binary Search, which elements in the following array are compared to the target when target = 93?

12,   23,   34,   42,   55,   61,   78,   80,   85,   93,   97,   99

• 5, 9, 7, 8

• 61, 80, 93

• 5, 8, 10, 9

• 61, 85, 97, 93

• 61, 93, 80, 85

When an array is sorted from highest to lowest, it is said to be in ________ order.

• ascending

• sequential

• descending

• forward

• reverse

________ algorithms are used to arrange random data into some order.

• Standard search

• Linear

• Sorting

• Binary search

• Efficient

After 5 passes of the Insertion Sort Algorithm, an array contains the elements shown below. Show the contents of the array after one more pass of the Insertion Sort algorithm:

12,   23,   34,   42,   55,   61,   18,   10,  25

• The array does not change

• 10, 12, 23, 34, 42, 55, 61, 18, 25

• 12, 23, 25, 34, 42, 55, 61, 18, 10

• 12, 18, 23, 34, 42, 55, 61, 10, 25

• 10, 12, 18, 23, 25, 34, 42, 55, 61

Which one of the following calls for the insertion sort algorithm is correct?

void sort( int list[], int size);

int main()
{
    int a[] = {10, 90, 30, 50, 20, 70, 30};
    int size = 7;

    // calling statement for sort:
   
    return 0;
}

• sort( int list[], int size);

• sort(a[], size);

• sort( int a[], int size);

• sort list[], size);

• sort(a, 7);

Which one of the following calls for the binary search algorithm is correct?

int binSearch( const int list[], int size, int target);

int main()
{
    int a[] = {10, 20, 30, 40, 50, 60, 70, 80};
    int size = 8, target = 65, pos;

    // calling statement for biSearch

    return 0;
}

• pos = binSearch( a, target, size);

• pos = binSearch(a, size, target);

• binSearch(a, size, target);

• pos = binSearch( const int list[], int size, int target);

• pos = binSearch(a, 8);