Deck 8: Advanced Data Handling Techniques

Question 1

You can make additional improvements to a bubble sort to reduce unnecessary comparisons.

Answer 1

True

Question 2

In a ____, items in a list are compared with each other in pairs.

A) quick sort
B) shell sort
C) bubble sort
D) matrix sort

Answer 2

C

Question 3

You do not need to determine a record's exact physical address in order to use it.

Answer 3

True

Question 4

When a large data file needs to be processed in ascending or descending order based on a particular field, the most efficient approach is usually to store and access records based on their logical order.

Question 5

When you create a ____ report, the records must have been sorted in order by a key field.

A) summary
B) control break
C) detail
D) totals

Question 6

When you store data records, they exist in ____.

A) some type of order
B) the reverse order from how they were entered
C) the same default ordering for all systems
D) ascending order

Question 7

Because "A" is always less than "B", alphabetic sorts are ____ sorts.

A) descending
B) reversing
C) ascending
D) downward

Question 8

The ____ is often used as a statistic in many cases because it represents a more typical case.

A) mode
B) mean
C) average
D) median

Question 9

An insertion sort is another name for a bubble sort.

Question 10

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

Question 11

The most popular computer coding schemes include ASCII, Numeric, and EBCDIC.

Question 12

When you learn a method like sorting, programmers say you are learning a(n) ____.

A) matrix
B) addressed location
C) algorithm
D) linked list

Question 13

When records are in ____ order, they are arranged one after another on the basis of the value in a particular field.

A) random
B) sequential
C) binary
D) incremental

Question 14

It is relatively easy for people to keep track of arrays with more than three dimensions.

Question 15

When a record is removed from an indexed file, it has to be physically removed.

Question 16

The sorting process is usually reserved for a relatively large number of data items.

Question 17

Some programming languages allow multidimensional arrays.

Question 18

When computers sort data, they always use ____ values when making comparisons between values.

A) numeric
B) alphanumeric
C) alphabetic
D) ascending

Question 19

The ____ is skewed by a few very high or low values.

A) mode
B) median
C) mean
D) standard deviation

Question 20

A bubble sort is sometimes called a ____.

A) dropping sort
B) sinking sort
C) compare sort
D) pair sort

Question 21

Each element in a two-dimensional array requires ____ subscript(s) to reference it.

A) one
B) two
C) three
D) four

Question 22

Every time you add a new record to a linked list, you search through the list for the correct ____ location of the new record.

A) physical
B) spatial
C) logical
D) key

Question 23

A(n) ____________________ is a list of instructions that accomplishes a task.

Question 24

A common method of accessing records in logical order is to use a(n) ____________________.

Question 25

If you are performing a(n) ____________________ bubble sort, then after you have made one pass through the list, the largest value is guaranteed to be in its correct final position at the bottom of the list.

Question 26

In a(n) ____, if an element is out of order relative to any of the items earlier in the list, you move each earlier item down one position and then insert the tested element.

A) selection sort
B) bubble sort
C) sync sort
D) insertion sort

Question 27

When you ____________________ values stored in two variables, you exchange their values.

Question 28

When you use an index, you can store records on a ____ storage device.

A) linear-access
B) random-access
C) sequential-access
D) uniform-access

Question 29

A ____sort is a sorting algorithm in which list values are divided into sorted and unsorted sublists.

A) selection
B) insertion
C) bubble
D) sinking

Question 30

In its simplest form, creating a(n) ____________________ list involves creating one extra field in every record of stored data.

Question 31

To correctly swap two values, you create a(n) ____ variable to hold one of the values.

A) per-swap
B) inversion
C) conversion
D) temporary

Question 32

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

A) primary
B) column
C) secondary
D) key

Question 33

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

A) store
B) tab
C) reference
D) index

Question 34

An array whose elements you can access using a single subscript is a ____ array.

A) one-dimensional
B) multi-dimensional
C) non-dimensional
D) single-dimensional

Question 35

A two-dimensional array contains two dimensions: ____.

A) size and scope
B) breadth and height
C) height and width
D) depth and width

Question 36

When using a bubble sort to sort a 10-element array, on the fourth pass through the array list you detect that no swap has occurred. This indicates ____.

A) the elements in the array were badly out of order
B) all elements in the array are already in the correct order
C) you must make one more pass through the array
D) you must make a total of 10 passes through the array

Question 37

As pages in a book have numbers, computer memory and storage locations have ____.

A) positions
B) pointers
C) addresses
D) references

Question 38

When mathematicians use a two-dimensional array, they often call it a ____ or a table.

A) vector
B) matrix
C) square
D) grid

Question 39

One way to access records in a desired order, even though they might not be physically stored in that order, is to create a(n) ____.

A) linked list
B) array
C) matrix
D) table

Question 40

When you sort records, two possible approaches are to place related data items in parallel arrays and to ____.

A) sort records as a whole
B) sort fields in records individually
C) place unrelated data items in parallel arrays
D) sort data in spreadsheets

Question 42

Why might you never need to write a program that sorts data as a professional programmer?

Question 43

Discuss how you declare one-dimensional and two-dimensional arrays.

Question 44

List and describe the general rules for sorting an array with a bubble sort.

Question 45

Describe how you access a two-dimensional array value using two subscripts.

Question 46

Explain why you might want to use a two-dimensional array.

Question 47

Describe an insertion sort.

Question 48

Describe a bubble sort.

Question 49

Describe a two-dimensional array.

Question 50

Describe a one-dimensional array.

Question 51

Give an example of an occasion when you would need to sort records.