Chapter 1 Flashcards

1
Q

The …….statement selects for execution a statement list having an associated label
that corresponds to the value of an expression

A

switch

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

The …….loop tests the condition at the bottom of the loop instead of at the top

A

do-while

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

The only operator that takes three arguments is the …… operator.

A

?:

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

The …. loop is the most compact way to iterate through the items in a collection.

A

foreach

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

On a 32-bit computer, a variable of int data type takes……. bytes of memory

A

four

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

To access the first element of an array, you use an index of ………

A

0

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

………is a programming technique that causes a method to call itself in order to compute a result

A

Recursion

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

……… are data fields or local variables whose value cannot be modified.

A

Constants

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

When an algorithm involves a large number of conditions, a(n)…….. is a compact
and readable format for presenting the algorithm.

A

decision table

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

A(n)……. is a graphical representation of an algorithm.

A

Flowchart

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