Question 1

A(n) ________ search uses a loop to sequentially step through an array.

Accepted Answer

A)  binary
B)  unary
C)  linear
D)  relative
E)  None of theseF) A) and E)
G) C) and D)

Question 2

The number of comparisons made by a binary search is expressed in powers of two.

Accepted Answer

A) True 
 B)False  True

Question 3

Data that is sorted in ascending order is ordered ________.

Accepted Answer

A)  from lowest to highest value
B)  from highest to lowest value
C)  always with a binary sort algorithm
D)  always with a linear sort algorithm
E)  None of theseF) B) and E)
G) All of the above

Question 4

The ________ sort usually performs fewer exchanges than the ________ sort.

Accepted Answer

A)  bubble, selection
B)  binary, linear
C)  selection, bubble
D)  ANSI, ASCII
E)  None of theseF) C) and D)
G) D) and E)

Question 5

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

Accepted Answer

A)  Standard search
B)  Linear
C)  Sorting
D)  Binary search
E)  None of theseF) A) and E)
G) A) and C)

Question 6

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

Accepted Answer

A)  sort
B)  search
C)  standard
D)  linear
E)  None of theseF) C) and E)
G) A) and E) B

Question 7

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

Accepted Answer

A)  summed
B)  set to zero
C)  sorted
D)  positive numbers
E)  None of theseF) B) and C)
G) B) and D)

Question 8

Using a binary search, you are more likely to find an item than if you use a linear search.

Accepted Answer

A) True 
 B)False

Question 9

The bubble sort is an easy way to arrange data into ascending order, but it cannot arrange data into descending order.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A)  reverse
B)  forward
C)  descending
D)  ascending
E)  None of theseF) A) and B)
G) B) and E)

Question 11

The advantage of a linear search is its ________.

Accepted Answer

A)  complexity
B)  efficiency
C)  simplicity
D)  speed
E)  None of theseF) A) and B)
G) A) and E)

Question 12

The ________ is adequate for searching through small arrays.

Accepted Answer

A)  binary search
B)  linear search
C)  unary search
D)  bubble sort
E)  None of theseF) A) and E)
G) C) and D)

Question 13

Regardless of the algorithm being used, a search through an array is always performed ________.

Accepted Answer

A)  from lowest to highest element
B)  from highest to lowest element
C)  beginning with the middle element
D)  using a binary search
E)  None of theseF) B) and E)
G) A) and C)

Question 14

Before you can perform a selection sort, the data must be stored in ascending order.

Accepted Answer

A) True 
 B)False

Question 15

Using a linear search to find a value that is stored in the last element of an array of 20,000 elements, ________ element(s) must be compared.

Accepted Answer

A)  20,000
B)  only the first
C)  only half
D)  2000
E)  None of theseF) A) and B)
G) B) and D)

Question 16

A linear search can only be implemented with integer values.

Accepted Answer

A) True 
 B)False

Question 17

In the average case, an item is just as likely to be found near the beginning of an array as near the end.

Accepted Answer

A) True 
 B)False  True

Question 18

Before you can perform a bubble sort, the data must be stored in descending order.

Accepted Answer

A) True 
 B)False

Question 19

A binary search begins with the ________ element of an array.

Accepted Answer

A)  first
B)  last
C)  largest
D)  middle
E)  None of theseF) C) and E)
G) All of the above

Question 20

A(n) ________ search is more efficient than a ________ search.

Accepted Answer

A)  character, string
B)  integer, double
C)  binary, linear
D)  linear, binary
E)  None of theseF) B) and D)
G) D) and E)

Exam 8: Searching and Sorting Arrays

A(n) ________ search uses a loop to sequentially step through an array.

Correct AnswerverifiedShow Answer

The number of comparisons made by a binary search is expressed in powers of two.

Correct AnswerverifiedTrue

Data that is sorted in ascending order is ordered ________.

Correct AnswerverifiedShow Answer

The ________ sort usually performs fewer exchanges than the ________ sort.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedB

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

Correct AnswerverifiedShow Answer

Using a binary search, you are more likely to find an item than if you use a linear search.

Correct AnswerverifiedShow Answer

The bubble sort is an easy way to arrange data into ascending order, but it cannot arrange data into descending order.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The advantage of a linear search is its ________.

Correct AnswerverifiedShow Answer

The ________ is adequate for searching through small arrays.

Correct AnswerverifiedShow Answer

Regardless of the algorithm being used, a search through an array is always performed ________.

Correct AnswerverifiedShow Answer

Before you can perform a selection sort, the data must be stored in ascending order.

Correct AnswerverifiedShow Answer

Using a linear search to find a value that is stored in the last element of an array of 20,000 elements, ________ element(s) must be compared.

Correct AnswerverifiedShow Answer

A linear search can only be implemented with integer values.

Correct AnswerverifiedShow Answer

In the average case, an item is just as likely to be found near the beginning of an array as near the end.

Correct AnswerverifiedTrue

Before you can perform a bubble sort, the data must be stored in descending order.

Correct AnswerverifiedShow Answer

A binary search begins with the ________ element of an array.

Correct AnswerverifiedShow Answer

A(n) ________ search is more efficient than a ________ search.

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified
True

Correct Answer
verified

The sort usually performs fewer exchanges than the sort.

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
True

Correct Answer
verified

Correct Answer
verified

A(n) search is more efficient than a search.

Correct Answer
verified