Back to marketplace

Chapter 10

No description yet. This curated deck is ready for daily study.

Total cards: 12•Content version: v3•Public deck•Updated: 8/1/2026

Card preview (12)

#1
Front (Question)

array

Back (Answer)

A data structure whose elements are accessed by means of index positions. (341)

#2
Front (Question)

element

Back (Answer)

A data item stored in an array. (342)

#3
Front (Question)

enhanced for loop

Back (Answer)

A special type of for loop that traverses an array or array list from beginning to end, binding a local variable to each element in the array or list. (354)

#4
Front (Question)

index

Back (Answer)

The relative position of the elements of an array. (342)

#5
Front (Question)

initializer list

Back (Answer)

A means of expressing a set of data that can be assigned to the cells of an array in one statement. (349)

#6
Front (Question)

logical size

Back (Answer)

The number of data items actually available in a data structure at a given time. (350)

#7
Front (Question)

parallel arrays

Back (Answer)

Arrays of the same length whose elements are paired in some logical relationship. (353)

#8
Front (Question)

physical size

Back (Answer)

The number of memory units available for storing data items in a data structure. (350)

#9
Front (Question)

procedural decomposition

Back (Answer)

The process of dividing a complex task into simpler tasks that can be solved with methods. (365)

#10
Front (Question)

range-bound error

Back (Answer)

The situation that occurs when an attempt is made to use an array index value that is less than 0 or greater than or equal to the size of the array. (343)

#11
Front (Question)

structure chart

Back (Answer)

A diagram that shows the dependencies among cooperating methods in a program. (365)

#12
Front (Question)

subscript

Back (Answer)

The relative position of the elements of an array. (342)