Question 1

A selection sort always starts with the middle element of the list.

Accepted Answer

A) True 
 B)False  False

Question 2

The insertion sort algorithm sorts a list by repeatedly inserting an element in its proper place into a sorted sublist.

Accepted Answer

A) True 
 B)False  True

Question 3

Consider the following list.list = {5, 11, 25, 28, 45, 78, 100, 120, 125};Suppose that binary search as discussed in the book is used to determine whether 28 is in list. Exactly how many key comparisons are executed by binary search?

Accepted Answer

A)  6 
B)  7 
C)  9 
D)  10 
A)  6 
B)  7 
C)  9 
D)  10 B

Question 4

Suppose that you have the following list.int[] list = {5, 10, 15, 20, 25, 30, 35, 40, 45};Further assume that binary search is used to determine whether 20 is in list. When the loop terminates, the value of the index variable first is 3.

Accepted Answer

A) True 
 B)False

Question 5

Consider the following list.list = {5, 11, 25, 28, 45, 78, 100, 120, 125};Suppose that binary search as discussed in the book is used to determine whether 110 is in list. What are the values of first and last when the while loop, in the body of the binarySearch method, terminates?

Accepted Answer

A)  first = 6, last = 6 
B)  first = 6, last = 7 
C)  first = 7, last = 6 
D)  None of these 
A)  first = 6, last = 6 
B)  first = 6, last = 7 
C)  first = 7, last = 6 
D)  None of these

Question 6

In selection sort, initially, the entire list, that is, list[0]...list[listLength], is the unsorted list.

Accepted Answer

A) True 
 B)False

Question 7

Why can't a binary search be used on the list as it appears in the accompanying figure?

Accepted Answer

A)  Because the list is too big 
B)  Because the list is not sorted 
C)  Because it is a list of integers 
D)  A binary search can be used on the list 
A)  Because the list is too big 
B)  Because the list is not sorted 
C)  Because it is a list of integers 
D)  A binary search can be used on the list

Question 8

In a selection sort, a list is sorted by selecting elements in the list, one at a time, and moving them to their proper positions.

Accepted Answer

A) True 
 B)False

Question 9

In a sequential search, how many key comparisons would have to be made on the list in the accompanying figure to find the number 5?

Accepted Answer

A)  4 
B)  5 
C)  7 
D)  8 
A)  4 
B)  5 
C)  7 
D)  8

Question 10

In insertion sort, during the sorting phase the array containing the list is divided into three sublists.

Accepted Answer

A) True 
 B)False

Question 11

A sequential search is most efficient for large lists.

Accepted Answer

A) True 
 B)False

Question 12

On average in a sequential search, how many comparisons would have to be made to find an element in the list in the accompanying figure?

Accepted Answer

A)  2 
B)  5 
C)  6 
D)  8 
A)  2 
B)  5 
C)  6 
D)  8

Question 13

If the list in the accompanying figure was to be searched for the number 44 using a binary search, how many key comparisons would have to be made?

Accepted Answer

A)  1 
B)  3 
C)  5 
D)  7 
A)  1 
B)  3 
C)  5 
D)  7

Question 14

Consider the following list.list = {24, 20, 10, 75, 70, 18, 60, 35}Suppose that list is sorted using the selection sort algorithm as discussed in the book. What is the resulting list after two passes of the sorting phase; that is, after two iterations of the outer for loop?

Accepted Answer

A)  list = {10, 18, 24, 20, 75, 70, 60, 35} 
B)  list = {10, 18, 20, 24, 75, 70, 60, 35} 
C)  list = {10, 18, 24, 75, 70, 20, 60, 35} 
D)  list = {10, 20, 24, 75, 70, 20, 60, 35} 
A)  list = {10, 18, 24, 20, 75, 70, 60, 35} 
B)  list = {10, 18, 20, 24, 75, 70, 60, 35} 
C)  list = {10, 18, 24, 75, 70, 20, 60, 35} 
D)  list = {10, 20, 24, 75, 70, 20, 60, 35}

Question 15

Suppose that you have the following list.int[] list = {2, 4, 6, 8, 10, 12, 14, 16};Further assume that binary search is used to determine whether 15 is in list. When the loop terminates, the value of the index variable last is 6.

Accepted Answer

A) True 
 B)False

Question 16

A list is a set of related values that do not necessarily have the same type.

Accepted Answer

A) True 
 B)False

Question 17

A sequential search is faster than a binary search on sorted lists.

Accepted Answer

A) True 
 B)False

Question 18

A binary search can be performed on both sorted and unsorted lists.

Accepted Answer

A) True 
 B)False

Question 19

In a sequential search, you search an array starting from the middle component.

Accepted Answer

A) True 
 B)False

Question 20

In the binary search algorithm, two key comparisons are made through every iteration of the loop.

Accepted Answer

A) True 
 B)False

A selection sort always starts with the middle element of the list.

The insertion sort algorithm sorts a list by repeatedly inserting an element in its proper place into a sorted sublist.

Consider the following list.list = {5, 11, 25, 28, 45, 78, 100, 120, 125};Suppose that binary search as discussed in the book is used to determine whether 28 is in list. Exactly how many key comparisons are executed by binary search?

Suppose that you have the following list.int[] list = {5, 10, 15, 20, 25, 30, 35, 40, 45};Further assume that binary search is used to determine whether 20 is in list. When the loop terminates, the value of the index variable first is 3.

Consider the following list.list = {5, 11, 25, 28, 45, 78, 100, 120, 125};Suppose that binary search as discussed in the book is used to determine whether 110 is in list. What are the values of first and last when the while loop, in the body of the binarySearch method, terminates?

In selection sort, initially, the entire list, that is, list[0]...list[listLength], is the unsorted list.

Why can't a binary search be used on the list as it appears in the accompanying figure?

In a selection sort, a list is sorted by selecting elements in the list, one at a time, and moving them to their proper positions.

In a sequential search, how many key comparisons would have to be made on the list in the accompanying figure to find the number 5?

In insertion sort, during the sorting phase the array containing the list is divided into three sublists.

A sequential search is most efficient for large lists.

On average in a sequential search, how many comparisons would have to be made to find an element in the list in the accompanying figure?

If the list in the accompanying figure was to be searched for the number 44 using a binary search, how many key comparisons would have to be made?

Consider the following list.list = {24, 20, 10, 75, 70, 18, 60, 35}Suppose that list is sorted using the selection sort algorithm as discussed in the book. What is the resulting list after two passes of the sorting phase; that is, after two iterations of the outer for loop?

Suppose that you have the following list.int[] list = {2, 4, 6, 8, 10, 12, 14, 16};Further assume that binary search is used to determine whether 15 is in list. When the loop terminates, the value of the index variable last is 6.

A list is a set of related values that do not necessarily have the same type.

A sequential search is faster than a binary search on sorted lists.

A binary search can be performed on both sorted and unsorted lists.

In a sequential search, you search an array starting from the middle component.

In the binary search algorithm, two key comparisons are made through every iteration of the loop.

An Overview of Computers and Programming Languages

Basic Elements of Java

Introduction to Objects and Input/output

Control Structures I: Selection

Control Structures II: Repetition

Graphical User Interface GUI and Object-Oriented Design OOD

User-Defined Methods

User-Defined Classes

Arrays

Inheritance and Polymorphism

Handling Exceptions and Events

Advanced Guis and Graphics

Recursion

Filters

Exam 14: Applications of Arrays Searching and Sorting and Strings

A selection sort always starts with the middle element of the list.

The insertion sort algorithm sorts a list by repeatedly inserting an element in its proper place into a sorted sublist.

Consider the following list.list = {5, 11, 25, 28, 45, 78, 100, 120, 125};Suppose that binary search as discussed in the book is used to determine whether 28 is in list. Exactly how many key comparisons are executed by binary search?

Suppose that you have the following list.int[] list = {5, 10, 15, 20, 25, 30, 35, 40, 45};Further assume that binary search is used to determine whether 20 is in list. When the loop terminates, the value of the index variable first is 3.

Consider the following list.list = {5, 11, 25, 28, 45, 78, 100, 120, 125};Suppose that binary search as discussed in the book is used to determine whether 110 is in list. What are the values of first and last when the while loop, in the body of the binarySearch method, terminates?

In selection sort, initially, the entire list, that is, list[0]...list[listLength], is the unsorted list.

Why can't a binary search be used on the list as it appears in the accompanying figure?

In a selection sort, a list is sorted by selecting elements in the list, one at a time, and moving them to their proper positions.

In a sequential search, how many key comparisons would have to be made on the list in the accompanying figure to find the number 5?

In insertion sort, during the sorting phase the array containing the list is divided into three sublists.

A sequential search is most efficient for large lists.

On average in a sequential search, how many comparisons would have to be made to find an element in the list in the accompanying figure?

If the list in the accompanying figure was to be searched for the number 44 using a binary search, how many key comparisons would have to be made?

Consider the following list.list = {24, 20, 10, 75, 70, 18, 60, 35}Suppose that list is sorted using the selection sort algorithm as discussed in the book. What is the resulting list after two passes of the sorting phase; that is, after two iterations of the outer for loop?

Suppose that you have the following list.int[] list = {2, 4, 6, 8, 10, 12, 14, 16};Further assume that binary search is used to determine whether 15 is in list. When the loop terminates, the value of the index variable last is 6.

A list is a set of related values that do not necessarily have the same type.

A sequential search is faster than a binary search on sorted lists.

A binary search can be performed on both sorted and unsorted lists.

In a sequential search, you search an array starting from the middle component.

In the binary search algorithm, two key comparisons are made through every iteration of the loop.

An Overview of Computers and Programming Languages

Basic Elements of Java

Introduction to Objects and Input/output

Control Structures I: Selection

Control Structures II: Repetition

Graphical User Interface GUI and Object-Oriented Design OOD

User-Defined Methods

User-Defined Classes

Arrays

Inheritance and Polymorphism

Handling Exceptions and Events

Advanced Guis and Graphics

Recursion

Filters