Question 1 options:

Given the following array of numbers:

Trace the Binary Search algorithm that follows, to find an item whose value is 10.

Notes: First/Last/Middle refer to indices, not values. Use integer division when calculating Middle. Fill unused cells with an x.

First

Last

Middle

Comparison

1.

2.

3.

Return Value (True/False):

Save

Question 2 (20 points)

Question 2 options:

Given the following array of numbers:

Trace the Binary Search algorithm that follows, to find an item whose value is 60.

Notes: First/Last/Middle refer to indices, not values. Use integer division when calculating Middle. Fill unused cells with an x.

First

Last

Middle

Comparison

1.

2.

3.

4.

Return Value (True/False):

Save

Question 3 (30 points)

Question 3 options:

Given the following array of numbers:

Sort the list using the Selection Sort algorithm that follows. Show each iteration using the following table.

Notes: firstUnsorted & indexOfSmallest refer to indices. smallest refers to a value. Fill unused cells with x.

firstUnsorted

smallest

indexOfSmallest

List (One number per box):

firstUnsorted

smallest

indexOfSmallest

List (One number per box):

firstUnsorted

smallest

indexOfSmallest

List (One number per box):

firstUnsorted

smallest

indexOfSmallest

List (One number per box):

firstUnsorted

smallest

indexOfSmallest

List (One number per box):

firstUnsorted

smallest

indexOfSmallest

List (One number per box):

Save

Question 4 (30 points)

Question 4 options:

Given the following array of numbers:

Sort the list using the Optimized Bubble Sort algorithm that follows. Show each iteration using the following table.

Note: firstUnsorted refers to an index. Fill unused cells with x.

firstUnsorted

swap (T/F)

List (Once the smallest item has bubbled-up to firstUnsorted) :

firstUnsorted

swap(T/F)

List (Once the smallest item has bubbled-up to firstUnsorted) :

firstUnsorted

swap(T/F)

List (Once the smallest item has bubbled-up to firstUnsorted) :

firstUnsorted

swap(T/F)

List (Once the smallest item has bubbled-up to firstUnsorted) :

firstUnsorted

swap(T/F)

List (Once the smallest item has bubbled-up to firstUnsorted) :

firstUnsorted

swap(T/F)

List (Once the smallest item has bubbled-up to firstUnsorted) :

Save