Question Details

MIS 505 Programming-Final-Exam-Review PART 16

21. Attaching structures end to end is called ____ structures.
A) linking
B) stacking
C) nesting
D) building
Points Earned:
1.0


22. The following pseudocode is an example of ____. if conditionA is true then do stepE else do stepB do stepC do stepD endif
A) nesting
B) stacking
C) a posttest
D) a pretest (incorrect)
Points Earned:



23. Placing a structure within another structure is called ____ structures.
A) nesting
B) stacking
C) shelling
D) selecting
Points Earned:
1.0


24. You can use an ____ statement to clearly show where the actions that depend on a decision end.
A) end
B) endstructure
C) endloop
D) endif
Points Earned:
1.0


25. The maximum number of entry points that any programming structure can have is ____.
A) zero
B) one
C) three
D) five
Points Earned:
1.0


26. 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
Points Earned:
1.0


27. 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
Points Earned:
1.0


28. A ____ read is an added statement that gets the first input value in a program.
A) nested
B) stacked
C) posttest
D) priming
Points Earned:
1.0


29. The priming read is an example of a(n) ____ task.
A) declaration
B) exit
C) housekeeping
D) selection
Points Earned:
1.0


30. 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
Points Earned:
1.0


31. 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
Points Earned:
1.0


32. One way to straighten out an unstructured flowchart segment is to use the ____ method.
A) spaghetti code
B) spaghetti bowl
C) restructuring
D) priming
Points Earned:
1.0


33. 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
Points Earned:
1.0


34. The do loop is a variation of the ____ loop.
A) if-then-else
B) while
C) case
D) sequence
Points Earned:
1.0


35. The case structure is a variation of the ____ structure.
A) selection
B) while
C) sequence
D) do (incorrect)
Points Earned:
0.0
Points Awarded
35.00
Points Missed
0.00
Percentage
100%