Chapter 6 Flashcards

1
Q

Key

A

The attributes that are used to determine the logical order of the elements in a collection

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

List

A

A collection that exhibits a linear relationship among its elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Linear relationship

A

Each element except the first has a unique predecessor, and each element except the last has a unique successor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Size

A

The number of elements in a list; the size can vary over time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Unsorted list

A

A list in which elements are placed in no particular order; the only relationship between data elements is the predecessor and successor relationships

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Sorted list

A

A list that is sorted by some property of its elements; there is an ordered relationship among the elements in the list, reflected by their relative positions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Indexed list

A

A list in which each element has an index value associated with it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Iteration

A

A mechanism that allows us to process the elements of a data structure one at a time in a given element

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Iterator method

A

A method that return an element of a data structure and advances the current position to the next element

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

The attributes that are used to determine the logical order of the elements in a collection

A

Key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A collection that exhibits a linear relationship among its elements

A

List

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Each element except the first has a unique predecessor, and each element except the last has a unique successor

A

Linear relationship

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

The number of elements in a list; the size can vary over time

A

Size

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

A list in which elements are placed in no particular order; the only relationship between data elements is the predecessor and successor relationships

A

Unsorted list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

A list that is sorted by some property of its elements; there is an ordered relationship among the elements in the list, reflected by their relative positions

A

Sorted list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

A list in which each element has an index value associated with it

A

Indexed list

17
Q

A mechanism that allows us to process the elements of a data structure one at a time in a given element

18
Q

A method that return an element of a data structure and advances the current position to the next element

A

Iterator method