Programming Logic and Design 8th Edition Chapter 8 Review

1.Employee records stored in order from highest-paid to lowest-paid have been sorted in_____________order.

• a. recursive

• b. ascending

• c. staggered

• d. descending

2.Student records stored in alphabetical order by last name have been sorted in_____________order.

• a. recursive

• b.ascending

• c. staggered

• d. descending

3.When computers sort data,they always_____________order.

• a. place items in ascending order

• b. use a bubble sort

• c. use numeric values when making comparisons

• d. begin the process by locating the position of the lowest value

4. Which of the following code segments correctly wasps the players of variables named x and y?

• a. x = y, y = temp, x = temp

• b. temp = x, x = y, y = temp

• c. x = y , temp = x, y = temp

• d. temp = x, y = x, y = temp

5. Which type of sort compares list items in pairs, swapping any two adjacent values that are out of order?

• a. insertion sort

• b. indexed sort

• c. bubble sort

• d. selection sort

6. To sort a lost 15 values using a bubble sort, the great number of times you would have to pass through the list making comparisons is_____________

• a. 12

• b. 13

• c. 14

• d. 15

7. To completely sort a lost of eight values using a bubble sort, the greatest possible number of required pair comparisons is_____________.

• a. seven

• b. eight

• c.49

• d.64

8.When you do not know how many times need to be sorted in a program, you can create an array that has_______________.

• a. variable-sized elements

• b. at least as many elements as the number you predict you will need

• c.at least one element less than the number you predict you will need

• d.You cannot sort items if you do not know the number of items when you write the program.

9. In a bubble order, on each pass through the list that must be sorted, you can stop making pair comparison______________.

• a. one comparison sooner

• b. two comparisons sooner

• c. one comparison later

• d. two comparisons later

10. When performing a bubble sort on a list of 10 values, you can stop making passes through the list of values as soon as___________on a single pass through the list.

• a. no swaps are made

• b. exactly one swap is made

• c. no more than nine swaps are made

• d. no more than 10 swaps are made