Deck 3: Understanding Structure

Full screen (f)
exit full mode
Question
In a selection structure, you perform an action or task, and then you perform the next action in order.
Use Space or
up arrow
down arrow
to flip the card.
Question
The following pseudocode is an example of a ____ structure. get firstNumber
Get secondNumber
Add firstNumber and secondNumber
Print result

A)sequence
B)decision
C)loop
D)nested
Question
In a structured program, any structure can be nested within another structure.
Question
The case structure is a variation of the sequence structure and the do loop is a variation of the while loop.
Question
No matter how complicated it is, any set of steps can always be reduced to combinations of the two basic structures of sequence and loop.
Question
Programs that use _____ code logic are unstructured programs that do not follow the rules of structured logic.

A)case
B)loop
C)spaghetti
D)nested
Question
if-else examples can also be called ____ because they contain the action taken when the tested condition is true and the action taken when it is false.

A)do loops
B)single-alternative selections
C)repetition
D)dual-alternative selections
Question
With a(n)____, you perform an action or task, and then you perform the next action, in order.

A)ordered structure
B)sequence problem
C)sequence structure
D)loop sequence
Question
The following pseudocode is an example of a ____ structure.
<strong>The following pseudocode is an example of a ____ structure.  </strong> A)sequence B)decision C)loop D)nested <div style=padding-top: 35px>

A)sequence
B)decision
C)loop
D)nested
Question
Fill in the blank in the following pseudocode: <strong>Fill in the blank in the following pseudocode:  </strong> A)then B)while C)do D)else <div style=padding-top: 35px>

A)then
B)while
C)do
D)else
Question
Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

A)end
B)endstructure
C)endloop
D)endif
Question
You may hear programmers refer to looping as ____.

A)execution
B)selection
C)iteration
D)case
Question
Structured programs use spaghetti code logic.
Question
The following pseudocode is an example of a ____ structure. <strong>The following pseudocode is an example of a ____ structure.  </strong> A)sequence B)decision C)loop D)nested <div style=padding-top: 35px>

A)sequence
B)decision
C)loop
D)nested
Question
The action or actions that occur within a loop are known as a(n)____.

A)loop body
B)action body
C)loop internals
D)structure body
Question
As a general rule, an eof question should always come immediately after an input statement because the end-of-file condition will be detected at input.
Question
Because you may stack and nest structures while retaining the overall structure, it might be difficult to determine whether a flowchart as a whole is structured.
Question
Structured programming is sometimes called goto-less programming.
Question
A structured program must contain a sequence, selection, and loop structure.
Question
Repetition and sequence are alternate names for a loop structure.
Question
The do loop is a variation of the ____ loop.

A)if-then-else
B)while
C)case
D)sequence
Question
A ____ read is an added statement that gets the first input value in a program.

A)nested
B)stacked
C)posttest
D)priming
Question
A group of statements that execute as a single unit are called a(n)____________________.
Question
Attaching structures end to end is called ____ structures.

A)linking
B)stacking
C)nesting
D)building
Question
The priming read is an example of a(n)____ task.

A)declaration
B)exit
C)housekeeping
D)selection
Question
Structured programming is sometimes called ____________________-less programming.
Question
One way to straighten out an unstructured flowchart segment is to use the ____ method.

A)spaghetti code
B)spaghetti bowl
C)restructuring
D)priming
Question
Some people call the selection structure a(n)____________________ statement.
Question
A loop must return to the ____ question at some later point in a structure.

A)start loop
B)loop-controlling
C)master loop
D)continue loop
Question
Structured programs can be easily broken down into routines or ____ that can be assigned to any number of programmers.

A)segments
B)modules
C)units
D)sequences
Question
When you ____________________ structures, the statements that start and end a structure are always on the same level and always in pairs.
Question
A(n)____________________ can contain any number of tasks, but there is no option to branch off and skip any of the tasks.
Question
Structures can be stacked or connected to one another at their ____.

A)entry points only
B)exit points only
C)entry or exit points
D)entry or combination points
Question
The following pseudocode is an example of ____. <strong>The following pseudocode is an example of ____.  </strong> A)nesting B)stacking C)single alternative structures D)a posttest <div style=padding-top: 35px>

A)nesting
B)stacking
C)single alternative structures
D)a posttest
Question
Placing a structure within another structure is called ____ structures.

A)nesting
B)stacking
C)shelling
D)selecting
Question
In older languages, you could leave a selection or loop before it was complete by using a ____ statement.

A)loop
B)go next
C)next
D)go to
Question
A structured program includes only combinations of the three basic structures: ____.

A)sequence, iteration, and loop
B)iteration, selection, and loop
C)sequence, selection, and loop
D)identification, selection, and loop
Question
The case structure is a variation of the ____ structure.

A)selection
B)while
C)sequence
D)do
Question
The maximum number of entry points that any programming structure can have is ____.

A)zero
B)one
C)three
D)five
Question
The following pseudocode is an example of ____. <strong>The following pseudocode is an example of ____.  </strong> A)nesting B)stacking C)a posttest D)a pretest <div style=padding-top: 35px>

A)nesting
B)stacking
C)a posttest
D)a pretest
Question
Match between columns
A variation of the selection structure
structure
A variation of the selection structure
priming read
A variation of the selection structure
module
A variation of the selection structure
decision structure
A variation of the selection structure
null case
A variation of the selection structure
stacking structures
A variation of the selection structure
spaghetti code
A variation of the selection structure
loop structure
A variation of the selection structure
case structure
A variation of the selection structure
nesting structures
Question
Describe how you can straighten out an unstructured flowchart segment.
Question
Explain the difference between the representation of a decision structure and a loop in a flowchart.
Question
Match between columns
Often can be used in multiple programs
structure
Often can be used in multiple programs
priming read
Often can be used in multiple programs
module
Often can be used in multiple programs
decision structure
Often can be used in multiple programs
null case
Often can be used in multiple programs
stacking structures
Often can be used in multiple programs
spaghetti code
Often can be used in multiple programs
loop structure
Often can be used in multiple programs
case structure
Often can be used in multiple programs
nesting structures
Question
Match between columns
Attaching structures end-to-end
structure
Attaching structures end-to-end
priming read
Attaching structures end-to-end
module
Attaching structures end-to-end
decision structure
Attaching structures end-to-end
null case
Attaching structures end-to-end
stacking structures
Attaching structures end-to-end
spaghetti code
Attaching structures end-to-end
loop structure
Attaching structures end-to-end
case structure
Attaching structures end-to-end
nesting structures
Question
Define the term structure as it relates to programming.
Question
Describe a loop structure.
Question
What are the characteristics of a structured program?
Question
Match between columns
A case in which no action is taken
structure
A case in which no action is taken
priming read
A case in which no action is taken
module
A case in which no action is taken
decision structure
A case in which no action is taken
null case
A case in which no action is taken
stacking structures
A case in which no action is taken
spaghetti code
A case in which no action is taken
loop structure
A case in which no action is taken
case structure
A case in which no action is taken
nesting structures
Question
All logic problems can be solved using only these three structures: sequence, selection, and loop. The three structures, of course, can be combined in an infinite number of ways. What are two general ways structures can be combined?
Question
Match between columns
Placing a structure within another structure
structure
Placing a structure within another structure
priming read
Placing a structure within another structure
module
Placing a structure within another structure
decision structure
Placing a structure within another structure
null case
Placing a structure within another structure
stacking structures
Placing a structure within another structure
spaghetti code
Placing a structure within another structure
loop structure
Placing a structure within another structure
case structure
Placing a structure within another structure
nesting structures
Question
Match between columns
An added statement that gets the first input value in a program
structure
An added statement that gets the first input value in a program
priming read
An added statement that gets the first input value in a program
module
An added statement that gets the first input value in a program
decision structure
An added statement that gets the first input value in a program
null case
An added statement that gets the first input value in a program
stacking structures
An added statement that gets the first input value in a program
spaghetti code
An added statement that gets the first input value in a program
loop structure
An added statement that gets the first input value in a program
case structure
An added statement that gets the first input value in a program
nesting structures
Question
Match between columns
Continue to repeat actions while a condition remains true
structure
Continue to repeat actions while a condition remains true
priming read
Continue to repeat actions while a condition remains true
module
Continue to repeat actions while a condition remains true
decision structure
Continue to repeat actions while a condition remains true
null case
Continue to repeat actions while a condition remains true
stacking structures
Continue to repeat actions while a condition remains true
spaghetti code
Continue to repeat actions while a condition remains true
loop structure
Continue to repeat actions while a condition remains true
case structure
Continue to repeat actions while a condition remains true
nesting structures
Question
Match between columns
With this, you ask a question, and, depending on the answer, you take one of two courses of action
structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
priming read
With this, you ask a question, and, depending on the answer, you take one of two courses of action
module
With this, you ask a question, and, depending on the answer, you take one of two courses of action
decision structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
null case
With this, you ask a question, and, depending on the answer, you take one of two courses of action
stacking structures
With this, you ask a question, and, depending on the answer, you take one of two courses of action
spaghetti code
With this, you ask a question, and, depending on the answer, you take one of two courses of action
loop structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
case structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
nesting structures
Question
Why does spaghetti code have a shorter shelf life than structured code?
Question
Why is it best to use only three programming structures?
Question
Match between columns
A basic unit of programming logic
structure
A basic unit of programming logic
priming read
A basic unit of programming logic
module
A basic unit of programming logic
decision structure
A basic unit of programming logic
null case
A basic unit of programming logic
stacking structures
A basic unit of programming logic
spaghetti code
A basic unit of programming logic
loop structure
A basic unit of programming logic
case structure
A basic unit of programming logic
nesting structures
Question
What are the three basic structures and how can they be used?
Question
Match between columns
Logically snarled program statements
structure
Logically snarled program statements
priming read
Logically snarled program statements
module
Logically snarled program statements
decision structure
Logically snarled program statements
null case
Logically snarled program statements
stacking structures
Logically snarled program statements
spaghetti code
Logically snarled program statements
loop structure
Logically snarled program statements
case structure
Logically snarled program statements
nesting structures
Question
Rewrite the following as a while loop:
do
pay bills
while more bills remain to be paid
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/60
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 3: Understanding Structure
1
In a selection structure, you perform an action or task, and then you perform the next action in order.
False
2
The following pseudocode is an example of a ____ structure. get firstNumber
Get secondNumber
Add firstNumber and secondNumber
Print result

A)sequence
B)decision
C)loop
D)nested
A
3
In a structured program, any structure can be nested within another structure.
True
4
The case structure is a variation of the sequence structure and the do loop is a variation of the while loop.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
5
No matter how complicated it is, any set of steps can always be reduced to combinations of the two basic structures of sequence and loop.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
6
Programs that use _____ code logic are unstructured programs that do not follow the rules of structured logic.

A)case
B)loop
C)spaghetti
D)nested
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
7
if-else examples can also be called ____ because they contain the action taken when the tested condition is true and the action taken when it is false.

A)do loops
B)single-alternative selections
C)repetition
D)dual-alternative selections
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
8
With a(n)____, you perform an action or task, and then you perform the next action, in order.

A)ordered structure
B)sequence problem
C)sequence structure
D)loop sequence
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
9
The following pseudocode is an example of a ____ structure.
<strong>The following pseudocode is an example of a ____ structure.  </strong> A)sequence B)decision C)loop D)nested

A)sequence
B)decision
C)loop
D)nested
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
10
Fill in the blank in the following pseudocode: <strong>Fill in the blank in the following pseudocode:  </strong> A)then B)while C)do D)else

A)then
B)while
C)do
D)else
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
11
Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

A)end
B)endstructure
C)endloop
D)endif
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
12
You may hear programmers refer to looping as ____.

A)execution
B)selection
C)iteration
D)case
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
13
Structured programs use spaghetti code logic.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
14
The following pseudocode is an example of a ____ structure. <strong>The following pseudocode is an example of a ____ structure.  </strong> A)sequence B)decision C)loop D)nested

A)sequence
B)decision
C)loop
D)nested
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
15
The action or actions that occur within a loop are known as a(n)____.

A)loop body
B)action body
C)loop internals
D)structure body
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
16
As a general rule, an eof question should always come immediately after an input statement because the end-of-file condition will be detected at input.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
17
Because you may stack and nest structures while retaining the overall structure, it might be difficult to determine whether a flowchart as a whole is structured.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
18
Structured programming is sometimes called goto-less programming.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
19
A structured program must contain a sequence, selection, and loop structure.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
20
Repetition and sequence are alternate names for a loop structure.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
21
The do loop is a variation of the ____ loop.

A)if-then-else
B)while
C)case
D)sequence
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
22
A ____ read is an added statement that gets the first input value in a program.

A)nested
B)stacked
C)posttest
D)priming
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
23
A group of statements that execute as a single unit are called a(n)____________________.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
24
Attaching structures end to end is called ____ structures.

A)linking
B)stacking
C)nesting
D)building
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
25
The priming read is an example of a(n)____ task.

A)declaration
B)exit
C)housekeeping
D)selection
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
26
Structured programming is sometimes called ____________________-less programming.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
27
One way to straighten out an unstructured flowchart segment is to use the ____ method.

A)spaghetti code
B)spaghetti bowl
C)restructuring
D)priming
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
28
Some people call the selection structure a(n)____________________ statement.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
29
A loop must return to the ____ question at some later point in a structure.

A)start loop
B)loop-controlling
C)master loop
D)continue loop
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
30
Structured programs can be easily broken down into routines or ____ that can be assigned to any number of programmers.

A)segments
B)modules
C)units
D)sequences
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
31
When you ____________________ structures, the statements that start and end a structure are always on the same level and always in pairs.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
32
A(n)____________________ can contain any number of tasks, but there is no option to branch off and skip any of the tasks.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
33
Structures can be stacked or connected to one another at their ____.

A)entry points only
B)exit points only
C)entry or exit points
D)entry or combination points
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
34
The following pseudocode is an example of ____. <strong>The following pseudocode is an example of ____.  </strong> A)nesting B)stacking C)single alternative structures D)a posttest

A)nesting
B)stacking
C)single alternative structures
D)a posttest
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
35
Placing a structure within another structure is called ____ structures.

A)nesting
B)stacking
C)shelling
D)selecting
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
36
In older languages, you could leave a selection or loop before it was complete by using a ____ statement.

A)loop
B)go next
C)next
D)go to
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
37
A structured program includes only combinations of the three basic structures: ____.

A)sequence, iteration, and loop
B)iteration, selection, and loop
C)sequence, selection, and loop
D)identification, selection, and loop
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
38
The case structure is a variation of the ____ structure.

A)selection
B)while
C)sequence
D)do
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
39
The maximum number of entry points that any programming structure can have is ____.

A)zero
B)one
C)three
D)five
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
40
The following pseudocode is an example of ____. <strong>The following pseudocode is an example of ____.  </strong> A)nesting B)stacking C)a posttest D)a pretest

A)nesting
B)stacking
C)a posttest
D)a pretest
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
41
Match between columns
A variation of the selection structure
structure
A variation of the selection structure
priming read
A variation of the selection structure
module
A variation of the selection structure
decision structure
A variation of the selection structure
null case
A variation of the selection structure
stacking structures
A variation of the selection structure
spaghetti code
A variation of the selection structure
loop structure
A variation of the selection structure
case structure
A variation of the selection structure
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
42
Describe how you can straighten out an unstructured flowchart segment.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
43
Explain the difference between the representation of a decision structure and a loop in a flowchart.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
44
Match between columns
Often can be used in multiple programs
structure
Often can be used in multiple programs
priming read
Often can be used in multiple programs
module
Often can be used in multiple programs
decision structure
Often can be used in multiple programs
null case
Often can be used in multiple programs
stacking structures
Often can be used in multiple programs
spaghetti code
Often can be used in multiple programs
loop structure
Often can be used in multiple programs
case structure
Often can be used in multiple programs
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
45
Match between columns
Attaching structures end-to-end
structure
Attaching structures end-to-end
priming read
Attaching structures end-to-end
module
Attaching structures end-to-end
decision structure
Attaching structures end-to-end
null case
Attaching structures end-to-end
stacking structures
Attaching structures end-to-end
spaghetti code
Attaching structures end-to-end
loop structure
Attaching structures end-to-end
case structure
Attaching structures end-to-end
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
46
Define the term structure as it relates to programming.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
47
Describe a loop structure.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
48
What are the characteristics of a structured program?
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
49
Match between columns
A case in which no action is taken
structure
A case in which no action is taken
priming read
A case in which no action is taken
module
A case in which no action is taken
decision structure
A case in which no action is taken
null case
A case in which no action is taken
stacking structures
A case in which no action is taken
spaghetti code
A case in which no action is taken
loop structure
A case in which no action is taken
case structure
A case in which no action is taken
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
50
All logic problems can be solved using only these three structures: sequence, selection, and loop. The three structures, of course, can be combined in an infinite number of ways. What are two general ways structures can be combined?
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
51
Match between columns
Placing a structure within another structure
structure
Placing a structure within another structure
priming read
Placing a structure within another structure
module
Placing a structure within another structure
decision structure
Placing a structure within another structure
null case
Placing a structure within another structure
stacking structures
Placing a structure within another structure
spaghetti code
Placing a structure within another structure
loop structure
Placing a structure within another structure
case structure
Placing a structure within another structure
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
52
Match between columns
An added statement that gets the first input value in a program
structure
An added statement that gets the first input value in a program
priming read
An added statement that gets the first input value in a program
module
An added statement that gets the first input value in a program
decision structure
An added statement that gets the first input value in a program
null case
An added statement that gets the first input value in a program
stacking structures
An added statement that gets the first input value in a program
spaghetti code
An added statement that gets the first input value in a program
loop structure
An added statement that gets the first input value in a program
case structure
An added statement that gets the first input value in a program
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
53
Match between columns
Continue to repeat actions while a condition remains true
structure
Continue to repeat actions while a condition remains true
priming read
Continue to repeat actions while a condition remains true
module
Continue to repeat actions while a condition remains true
decision structure
Continue to repeat actions while a condition remains true
null case
Continue to repeat actions while a condition remains true
stacking structures
Continue to repeat actions while a condition remains true
spaghetti code
Continue to repeat actions while a condition remains true
loop structure
Continue to repeat actions while a condition remains true
case structure
Continue to repeat actions while a condition remains true
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
54
Match between columns
With this, you ask a question, and, depending on the answer, you take one of two courses of action
structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
priming read
With this, you ask a question, and, depending on the answer, you take one of two courses of action
module
With this, you ask a question, and, depending on the answer, you take one of two courses of action
decision structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
null case
With this, you ask a question, and, depending on the answer, you take one of two courses of action
stacking structures
With this, you ask a question, and, depending on the answer, you take one of two courses of action
spaghetti code
With this, you ask a question, and, depending on the answer, you take one of two courses of action
loop structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
case structure
With this, you ask a question, and, depending on the answer, you take one of two courses of action
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
55
Why does spaghetti code have a shorter shelf life than structured code?
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
56
Why is it best to use only three programming structures?
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
57
Match between columns
A basic unit of programming logic
structure
A basic unit of programming logic
priming read
A basic unit of programming logic
module
A basic unit of programming logic
decision structure
A basic unit of programming logic
null case
A basic unit of programming logic
stacking structures
A basic unit of programming logic
spaghetti code
A basic unit of programming logic
loop structure
A basic unit of programming logic
case structure
A basic unit of programming logic
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
58
What are the three basic structures and how can they be used?
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
59
Match between columns
Logically snarled program statements
structure
Logically snarled program statements
priming read
Logically snarled program statements
module
Logically snarled program statements
decision structure
Logically snarled program statements
null case
Logically snarled program statements
stacking structures
Logically snarled program statements
spaghetti code
Logically snarled program statements
loop structure
Logically snarled program statements
case structure
Logically snarled program statements
nesting structures
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
60
Rewrite the following as a while loop:
do
pay bills
while more bills remain to be paid
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 60 flashcards in this deck.