Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

Programming

memorize.ai (lvl 286)

(0)

36 cards

()

Section 1

Preview this deck

Random-access

Front

1 / 36

Programming

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (36)

Section 1

(36 cards)

Random-access

Front

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

Back

Selection

Front

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

Back

Algorithm

Front

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

Back

Sort records as a whole

Front

When you sort records, two possible approaches are to place related data items in paralell arrays and to _________

Back

Insertion sort

Front

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

Back

Linked list

Front

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) __________

Back

Ascending

Front

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 postion at the bottom of the list.

Back

Index

Front

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

Back

Algorithm

Front

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

Back

Sinking sort

Front

A bubble sort is sometimes called a ____________

Back

False

Front

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

Back

True

Front

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

Back

Logical

Front

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

Back

Index

Front

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

Back

Linked

Front

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

Back

Sequential

Front

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

Back

Some type of order

Front

When you store data records, they exist in _________

Back

False

Front

An insertion sort is another name for a bubble sort

Back

One dimensional

Front

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

Back

Temporary

Front

To correctly swap two values, you create a _______ variable to hold one of the values.

Back

True

Front

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

Back

Control break

Front

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

Back

True

Front

Some programming languages allow multidimensional arrays

Back

Numeric

Front

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

Back

False

Front

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

Back

Matrix

Front

When mathmeticians use a two dimensional array, they often call it a _________ or a table

Back

Mean

Front

The ___________ is skewed by a few very high or low values

Back

All elements in the array are already in the correct order

Front

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 occured. This indicates ____________

Back

Median

Front

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

Back

Two

Front

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

Back

Ascending

Front

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

Back

Addresses

Front

As pages in books have numbers, computer memory and storage locations have __________

Back

Key

Front

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

Back

Height and width

Front

A two dimensional array contains two dimensions: ____________

Back

Bubble sort

Front

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

Back

Swap

Front

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

Back