Principles Of Object Oriented Design Chapter 12

Front 1

In a bubble sort, you use an outer loop to make the pair comparisons. Select one:

Back 1

False

Front 2

A three-dimensional array's subscripts are often referred to as row, column, and ____. Select one:

Back 2

page

Front 3

The ____ in a list is the value of the middle item when the values are listed in order. Select one:a. mean value

Back 3

median value

Front 4

Some languages access two-dimensional array elements with ____ separating the subscript values. Select one:

Back 4

commas

Front 5

In every popular computer coding scheme, "B" is numerically one greater than "A," and "y" is numerically one less than "z." Select one:

Back 5

True

Front 6

The bubble sort is the only sorting algorithm that exists. Select one:

Back 6

False

Front 7

When records are in ____ order, it means that they are arranged one after another on the basis of the value in some field. Select one:

Back 7

sequential

Front 8

You can think of the single dimension of a single-dimensional array as the height of the array. Select one:

Back 8

True

Front 9

A(n) ____ is a structure in memory that contains records with one extra field for each record.

Select one:

Back 9

linked list

Front 10

For an ascending sort, you need to perform the swap() method whenever any given element of the score array has a lower value than the next element. Select one:

Back 10

False

Front 11

The greatest number of pair comparisons you need to make during each loop is ____ than the number of elements in the array. Select one:

Back 11

one less

Front 12

____ arrays have both rows and columns of values. Select one:

Back 12

Two-dimensional

Front 13

In a(n) ____ sort, items in a list are compared with each other in pairs, and when an item is out of order, it swaps values with the item below it. Select one:

Back 13

bubble

Front 14

A bubble sort is sometimes called a ____ sort. Select one:

Back 14

sinking

Front 15

When records are arranged in ____ order, it means that they are arranged from highest to lowest value. Select one:

Back 15

descending

Front 16

In a ____ storage device, records can be accessed in any order.

Select one:

Back 16

random-access

Front 17

A record's ____ field is the field whose contents make the record unique among all records in a file. Select one:

Back 17

key

Front 18

Suppose the value of RENT_BY_FLOOR_AND_BDRMS[0][1] is 390. The value within the first pair of brackets following the array name refers to the ____. Select one:

Back 18

row

Front 19

When you ____ records, you store a list of key fields paired with the storage address for the corresponding data record.Select one:

Back 19

index

Front 20

An array that you can picture as a column of values, and whose elements you can access using a single subscript, is a ____ array. Select one:

Back 20

one-dimensional

Front 21

____ identify computer memory and storage locations. Select one:

Back 21

Addresses

Front 22

You can use a(n) ____ to access data records in a logical order that differs from their physical order. Select one:

Back 22

either a linked list or an index

Front 23

In a(n) ____ sort, items in a list are compared with each other in pairs, and when an item is out of order, it swaps values with the item below it. Select one:

Back 23

bubble

Front 24

For a descending sort in which you want to end up with the highest value first, write the decision so that you perform the switch when score[x] is ____ score[x + 1].

Select one:

Back 24

less than

Front 25

Swapping two values is a concept that is central to most sorting techniques. Select one:

Back 25

True

Front 26

When you declare a one-dimensional array, you type ____ after the array's type and name.

Select one:

Back 26

[ ]

Front 27

Two-dimensional arrays are never actually required in order to achieve a useful program.Select one:

Back 27

True

Front 28

With an ascending bubble sort, after each adjacent pair of items in a list has been compared once, the largest item in the list will have risen to the top. Select one:

Back 28

False

Front 29

In a bubble sort, you use a(n) ____ loop to make pair comparisons. Select one:

Back 29

inner

Front 30

Insertion sort is an unintuitive sorting algorithm, and bears little resemblance to any real-world manual sorting method. Select one:

Back 30

False

Front 31

The "real" order in which values are stored in memory is known as the ____ order

Back 31

physical