Deck 12: Manipulating Larger Quantities of Data

Full screen (f)
exit full mode
Question
The bubble sort is the only sorting algorithm that exists.
Use Space or
up arrow
down arrow
to flip the card.
Question
The ____ in a list is the value of the middle item when the values are listed in order.

A)mean value
C)average value
B)median value
D)mode value
Question
Swapping two values is a concept that is central to most sorting techniques.
Question
Two-dimensional arrays are never actually required in order to achieve a useful program.
Question
The greatest number of pair comparisons you need to make during each loop is ____ than the number of elements in the array.

A)one less
C)two less
B)one more
D)two more
Question
In a bubble sort, you use an outer loop to make the pair comparisons.
Question
You can use a bubble sort to arrange records in either ascending or descending order.
Question
When records are arranged in ____ order, it means that they are arranged from highest to lowest value.

A)ascending
C)descending
B)bubble
D)ordinal
Question
In every popular computer coding scheme, "B" is numerically one greater than "A," and "y" is numerically one less than "z."
Question
A(n) ____ is a list of instructions that accomplish a task.

A)algorithm
C)linked list
B)index
D)procedure
Question
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.
Question
You can think of the single dimension of a single-dimensional array as the height of the array.
Question
When records are arranged in ____ order, it means that they are arranged from lowest to highest value.

A)ascending
C)descending
B)bottom up
D)top down
Question
When records are in ____ order, it means that they are arranged one after another on the basis of the value in some field.

A)data
C)random
B)median
D)sequential
Question
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.

A)bubble
C)insertion
B)selection
D)linear
Question
A bubble sort is sometimes called a ____ sort.

A)raising
C)switch
B)sinking
D)match
Question
An arithmetic average is known as the ____.

A)mean
C)mode
B)median value
D)midpoint
Question
Insertion sort is an unintuitive sorting algorithm, and bears little resemblance to any real-world manual sorting method.
Question
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].

A)greater than or equal to
C)less than
B)equal to
D)greater than
Question
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.
Question
When you swap variables, you need to use a(n) ____________________ variable.
Question
You can use a(n) ____ to access data records in a logical order that differs from their physical order.

A)linked list
C)either a linked list or an index
B)index
D)neither a linked list nor an index
Question
The "real" order in which values are stored in memory is known as the ____ order.

A)ascending
C)physical
B)logical
D)descending
Question
____ arrays have both rows and columns of values.

A)Two-dimensional
C)One-dimensional
B)All
D)Multilateral
Question
A(n) ____ is a structure in memory that contains records with one extra field for each record.

A)logic list
C)index
B)linked list
D)array
Question
An array that you can picture as a column of values, and whose elements you can access using a single subscript, is a ____ array.

A)single
C)two-dimensional
B)unilateral
D)one-dimensional
Question
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 ____.

A)column
C)address
B)row
D)data type
Question
____________________ arrays are two or more arrays that contain related data that appear in the same relative position in each array.
Question
____ identify computer memory and storage locations.

A)Indexes
C)Linked lists
B)Addresses
D)Key fields
Question
In a ____ storage device, records can be accessed in any order.

A)null-access
C)linear-access
B)reverse-access
D)random-access
Question
In a bubble sort, you use a(n) ____ loop to make pair comparisons.

A)stacked
C)outer
B)sequential
D)inner
Question
The number of times you need to process the list of values is ____ than the number of elements in the array.

A)one less
C)two less
B)one more
D)two more
Question
When you ____ records, you store a list of key fields paired with the storage address for the corresponding data record.

A)index
C)access
B)sort
D)link
Question
Some languages access two-dimensional array elements with ____ separating the subscript values.

A)asterisks
C)commas
B)slashes
D)dashes
Question
A three-dimensional array's subscripts are often referred to as row, column, and ____.

A)floor
C)index
B)level
D)page
Question
When you declare a one-dimensional array, you type ____ after the array's type and name.

A)()
C){}
B)[]
D)**
Question
When computers sort data, the type of values being compared are always ____________________.
Question
When you are unsure how many values in an array will need to be sorted, that array is said to be of ____________________ size.
Question
A record's ____ field is the field whose contents make the record unique among all records in a file.

A)leading
C)primary
B)description
D)key
Question
The greatest number of pair ____________________ you need to make during each bubble sort loop is one less than the number of elements in the array.
Question
A(n) ____________________ array is defined as any array that has more then one dimension.
Question
When mathematicians use a two-dimensional array, they often call it a(n) ____________________.
Question
The maximum allowable number of array dimensions in many programming languages, including C# and Visual Basic, is ____________________.
Question
The ____________________ order imposes an order on elements based on any criterion you choose.
Question
The ____________________ of a record makes that record unique among all other records.
Question
The ____________________ is a data structure that contains the physical address of the next record in every logical record.
Question
If records are stored on a(n) ____________________, they can be accessed in any order.
Question
____________________ is an algorithm that sorts by looking at each list element one at a time.
Question
____________________ order refers to a "real" order for storage.
Question
____________________ arrays require two subscripts to reference the contained elements.
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/50
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 12: Manipulating Larger Quantities of Data
1
The bubble sort is the only sorting algorithm that exists.
False
2
The ____ in a list is the value of the middle item when the values are listed in order.

A)mean value
C)average value
B)median value
D)mode value
B
3
Swapping two values is a concept that is central to most sorting techniques.
True
4
Two-dimensional arrays are never actually required in order to achieve a useful program.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
5
The greatest number of pair comparisons you need to make during each loop is ____ than the number of elements in the array.

A)one less
C)two less
B)one more
D)two more
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
6
In a bubble sort, you use an outer loop to make the pair comparisons.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
7
You can use a bubble sort to arrange records in either ascending or descending order.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
8
When records are arranged in ____ order, it means that they are arranged from highest to lowest value.

A)ascending
C)descending
B)bubble
D)ordinal
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
9
In every popular computer coding scheme, "B" is numerically one greater than "A," and "y" is numerically one less than "z."
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
10
A(n) ____ is a list of instructions that accomplish a task.

A)algorithm
C)linked list
B)index
D)procedure
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
11
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.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
12
You can think of the single dimension of a single-dimensional array as the height of the array.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
13
When records are arranged in ____ order, it means that they are arranged from lowest to highest value.

A)ascending
C)descending
B)bottom up
D)top down
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
14
When records are in ____ order, it means that they are arranged one after another on the basis of the value in some field.

A)data
C)random
B)median
D)sequential
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
15
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.

A)bubble
C)insertion
B)selection
D)linear
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
16
A bubble sort is sometimes called a ____ sort.

A)raising
C)switch
B)sinking
D)match
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
17
An arithmetic average is known as the ____.

A)mean
C)mode
B)median value
D)midpoint
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
18
Insertion sort is an unintuitive sorting algorithm, and bears little resemblance to any real-world manual sorting method.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
19
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].

A)greater than or equal to
C)less than
B)equal to
D)greater than
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
20
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.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
21
When you swap variables, you need to use a(n) ____________________ variable.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
22
You can use a(n) ____ to access data records in a logical order that differs from their physical order.

A)linked list
C)either a linked list or an index
B)index
D)neither a linked list nor an index
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
23
The "real" order in which values are stored in memory is known as the ____ order.

A)ascending
C)physical
B)logical
D)descending
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
24
____ arrays have both rows and columns of values.

A)Two-dimensional
C)One-dimensional
B)All
D)Multilateral
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
25
A(n) ____ is a structure in memory that contains records with one extra field for each record.

A)logic list
C)index
B)linked list
D)array
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
26
An array that you can picture as a column of values, and whose elements you can access using a single subscript, is a ____ array.

A)single
C)two-dimensional
B)unilateral
D)one-dimensional
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
27
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 ____.

A)column
C)address
B)row
D)data type
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
28
____________________ arrays are two or more arrays that contain related data that appear in the same relative position in each array.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
29
____ identify computer memory and storage locations.

A)Indexes
C)Linked lists
B)Addresses
D)Key fields
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
30
In a ____ storage device, records can be accessed in any order.

A)null-access
C)linear-access
B)reverse-access
D)random-access
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
31
In a bubble sort, you use a(n) ____ loop to make pair comparisons.

A)stacked
C)outer
B)sequential
D)inner
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
32
The number of times you need to process the list of values is ____ than the number of elements in the array.

A)one less
C)two less
B)one more
D)two more
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
33
When you ____ records, you store a list of key fields paired with the storage address for the corresponding data record.

A)index
C)access
B)sort
D)link
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
34
Some languages access two-dimensional array elements with ____ separating the subscript values.

A)asterisks
C)commas
B)slashes
D)dashes
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
35
A three-dimensional array's subscripts are often referred to as row, column, and ____.

A)floor
C)index
B)level
D)page
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
36
When you declare a one-dimensional array, you type ____ after the array's type and name.

A)()
C){}
B)[]
D)**
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
37
When computers sort data, the type of values being compared are always ____________________.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
38
When you are unsure how many values in an array will need to be sorted, that array is said to be of ____________________ size.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
39
A record's ____ field is the field whose contents make the record unique among all records in a file.

A)leading
C)primary
B)description
D)key
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
40
The greatest number of pair ____________________ you need to make during each bubble sort loop is one less than the number of elements in the array.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
41
A(n) ____________________ array is defined as any array that has more then one dimension.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
42
When mathematicians use a two-dimensional array, they often call it a(n) ____________________.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
43
The maximum allowable number of array dimensions in many programming languages, including C# and Visual Basic, is ____________________.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
44
The ____________________ order imposes an order on elements based on any criterion you choose.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
45
The ____________________ of a record makes that record unique among all other records.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
46
The ____________________ is a data structure that contains the physical address of the next record in every logical record.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
47
If records are stored on a(n) ____________________, they can be accessed in any order.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
48
____________________ is an algorithm that sorts by looking at each list element one at a time.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
49
____________________ order refers to a "real" order for storage.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
50
____________________ arrays require two subscripts to reference the contained elements.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 50 flashcards in this deck.