Question Details

MIS 505 Programming-Final-Exam-Review PART 10

21.
The true benefit of using an array lies in your ability to use a ____ as a subscript to the array.
A) constant
B) loop
C) command
D) variable
Points Earned:
1.0/1.0


22.
Named ____ hold values that do not change during a program- execution.
A) constants
B) variables
C) objects
D) items
Points Earned:
1.0/1.0


23.
Besides making your code easier to modify, using a ____ makes the code easier to understand.
A) standard constant
B) named constant
C) literal constant
D) named variable
Points Earned:
1.0/1.0


24.
One advantage to using a named constant is that the statement becomes ____.
A) self-perpetuating
B) self-documenting
C) self-referencing
D) self-mitigating
Points Earned:
1.0/1.0


25.
When you search through a list from one end to the other, you are performing a ____.
A) linear search
B) binary search
C) quadratic search
D) single lookup
Points Earned:
1.0/1.0


26.
If you declare a variable to be Boolean, you can set its value to ____.
A) any number
B) true or false
C) any integer
D) 1 or -1
Points Earned:
1.0/1.0


27.
Which statement is true of arrays?
A) Only whole numbers can be used as array subscripts.
B) Only whole numbers can be stored in arrays.
C) Arrays cause more work for the programmer, but allow faster program execution.
D) Array elements cannot be reset after the array is declared.
Points Earned:
1.0/1.0


28.
A ____ relates parallel arrays.
A) superscript
B) key
C) subscript
D) postscript
Points Earned:
1.0/1.0


29.
Parallel arrays are most useful when value pairs have a(n) ____ relationship.
A) direct
B) indirect
C) linked
D) tiered
Points Earned:
1.0/1.0


30.
A ____ search starts looking in the middle of a sorted list, and then determines whether it should continue higher or lower.
A) linear
B) binary
C) quadratic
D) single lookup
Points Earned:
1.0/1.0


31.
To search an array for a(n) ____ match, you can store either the highest or lowest value of each range for comparison.
A) flag
B) index
C) subscript
D) range
Points Earned:
1.0/1.0


32.
Every array has a(n) ____ size.
A) infinite
B) finite
C) variable
D) constant
Points Earned:
1.0/1.0


33.
The number of bytes in an array is always a multiple of the number of ____ in an array.
A) subscripts
B) elements
C) iterators
D) indexes
Points Earned:
1.0/1.0


34.
In every programming language, when you access data stored in an array, it is important to use a ____ containing a value that accesses memory occupied by the array.
A) superscript
B) subscript
C) key
D) condition
Points Earned:
1.0/1.0


35.
When a subscript is not within the range of acceptable subscripts, it is said to be ____.
A) a superscript
B) flagged
C) out of bounds
D) indexed Points Earned: 1.0/1.0


Points Awarded
34.00
Points Missed
1.00
Percentage
97.1%