Question 1

Why is it best to use only three programming structures?

Accepted Answer

The answer of Why is it best to use only...

Question 2

Structured programming is sometimes called goto-less programming.

Accepted Answer

A) True 
 B)False

Question 3

Describe how you can straighten out an unstructured flowchart segment.

Accepted Answer

The answer of Describe how you can straighten out an...

Question 4

Structured programs use spaghetti code logic.

Accepted Answer

A) True 
 B)False

Question 5

Attaching structures end to end is called ____ structures.

Accepted Answer

A)  linking 
B)  stacking 
C)  nesting 
D)  building

Question 6

Describe a loop structure.

Accepted Answer

The answer of Describe a loop structure....

Question 7

A structured program must contain a sequence, selection, and loop structure.

Accepted Answer

A) True 
 B)False

Question 8

Fill in the blank in the following pseudocode: if someCondition is true then
   do oneProcess
____
   do theOtherProcess
Endif

Accepted Answer

A)  then 
B)  while 
C)  do 
D)  else

Question 9

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.

Accepted Answer

A) True 
 B)False

Question 10

With a(n) ____, you perform an action or task, and then you perform the next action, in order.

Accepted Answer

A)  ordered structure 
B)  sequence problem 
C)  sequence structure 
D)  loop sequence

Question 11

In older languages, you could leave a selection or loop before it was complete by using a ____ statement.

Accepted Answer

A)  loop 
B)  go next 
C)  next 
D)  go to

Question 12

The maximum number of entry points that any programming structure can have is ____.

Accepted Answer

A)  zero 
B)  one 
C)  three 
D)  five

Question 13

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?

Accepted Answer

The answer of All logic problems can be solved using...

Question 14

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.

Accepted Answer

A) True 
 B)False

Question 15

The following pseudocode is an example of ____.

Accepted Answer

A)  nesting 
B)  stacking 
C)  single alternative structures 
D)  a posttest

Question 16

The action or actions that occur within a loop are known as a(n) ____.

Accepted Answer

A)  loop body 
B)  action body 
C)  loop internals 
D)  structure body

Question 17

One way to straighten out an unstructured flowchart segment is to use the ____ method.

Accepted Answer

A)  spaghetti code 
B)  spaghetti bowl 
C)  restructuring 
D)  priming

Question 18

The case structure is a variation of the ____ structure.

Accepted Answer

A)  selection 
B)  while 
C)  sequence 
D)  do

Question 19

Programs that use _____ code logic are unstructured programs that do not follow the rules of structured logic.

Accepted Answer

A)  case 
B)  loop 
C)  spaghetti 
D)  nested

Question 20

Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

Accepted Answer

A)  end 
B)  endstructure 
C)  endloop 
D)  endif

Exam 3: Understanding Structure

Why is it best to use only three programming structures?

Structured programming is sometimes called goto-less programming.

Describe how you can straighten out an unstructured flowchart segment.

Structured programs use spaghetti code logic.

Attaching structures end to end is called ____ structures.

Describe a loop structure.

A structured program must contain a sequence, selection, and loop structure.

Fill in the blank in the following pseudocode: if someCondition is true then do oneProcess ____ do theOtherProcess Endif

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.

With a(n) ____, you perform an action or task, and then you perform the next action, in order.

In older languages, you could leave a selection or loop before it was complete by using a ____ statement.

The maximum number of entry points that any programming structure can have is ____.

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?

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.

The following pseudocode is an example of ____.

The action or actions that occur within a loop are known as a(n) ____.

One way to straighten out an unstructured flowchart segment is to use the ____ method.

The case structure is a variation of the ____ structure.

Programs that use _____ code logic are unstructured programs that do not follow the rules of structured logic.

Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.