Question 1

The simplest element of logical structure in an algorithm is a ____, in which one instruction follows another as if in a straight line.

Accepted Answer

A)  repetition sequence 
B)  linear sequence 
C)  binary bypass 
D)  selection sequence

Question 2

The path through an algorithm each time it is executed is determined by the state of the true or false conditions in the algorithm at that time.

Accepted Answer

A) True 
 B)False

Question 3

A count-controlled loop is a special case of a sentinel loop, in which the sentinel involves a counter, but the term "sentinel loop" is generally used to refer only to loops that are not count-controlled.

Accepted Answer

A) True 
 B)False

Question 4

In a branching routine, each path is called a ____.

Accepted Answer

A)  sequence 
B)  breakpoint 
C)  branch 
D)  bypass

Question 5

A programmer who is familiar with the design patterns of logical structure can more easily create and edit software.

Accepted Answer

A) True 
 B)False

Question 6

Usually terminators are labeled with the words "start" or "stop," or sometimes "begin" or "end."

Accepted Answer

A) True 
 B)False

Question 7

Alice's LOOP instruction allows us to use a negative increment.

Accepted Answer

A) True 
 B)False

Question 8

There should only be one terminator at the beginning of an algorithm and one terminator at the end of an algorithm.

Accepted Answer

A) True 
 B)False

Question 9

The question "Which pair of shoes would you like?", is an example of a binary question.

Accepted Answer

A) True 
 B)False

Question 10

Algorithms are sequential in nature, forming a kind of sequential logic.

Accepted Answer

A) True 
 B)False

Question 11

Whenever a more sophisticated loop is called for, such as one that counts backward, it is best to create your own version of a count-controlled loop with a FOR instruction.

Accepted Answer

A) True 
 B)False

Question 12

In a ____, one of two instructions is chosen.

Accepted Answer

A)  posttest loop 
B)  binary bypass 
C)  binary choice 
D)  pretest loop

Question 13

A ____ occurs when an algorithm branches backward to a previous instruction, and then repeats part of the algorithm.

Accepted Answer

A)  repetition sequence 
B)  branching routine 
C)  linear sequence 
D)  selection sequence

Question 14

To say that one thing is "predicated" on another means that one thing is determined by another.

Accepted Answer

A) True 
 B)False

Question 15

Böhm and Jacopini used a system they called ____ to describe their work.

Accepted Answer

A)  UML 
B)  flow diagrams 
C)  data flow 
D)  ER diagrams

Question 16

In a count-controlled loop, the control variable is a called a ____.

Accepted Answer

A)  sentinel 
B)  thread 
C)  counter 
D)  final value

Question 17

A(n) ____ is a diagram that shows the structure of an algorithm.

Accepted Answer

A)  ER 
B)  UML 
C)  data chart 
D)  flowchart

Question 18

In a ____, an instruction is either executed or bypassed.

Accepted Answer

A)  structured language 
B)  binary bypass 
C)  binary choice 
D)  selection sequence

Question 19

Böhm and Jacopini used a simple system of flowcharting with two symbols: ovals to show each step in an algorithm, and diamond-shaped boxes to show what they called a logical predicative.

Accepted Answer

A) True 
 B)False

Question 20

In a posttest loop, the test to determine whether or not to continue executing the loop comes before any other instructions that are to be repeated.

Accepted Answer

A) True 
 B)False

Exam 4: Algorithms

The simplest element of logical structure in an algorithm is a ____, in which one instruction follows another as if in a straight line.

The path through an algorithm each time it is executed is determined by the state of the true or false conditions in the algorithm at that time.

A count-controlled loop is a special case of a sentinel loop, in which the sentinel involves a counter, but the term "sentinel loop" is generally used to refer only to loops that are not count-controlled.

In a branching routine, each path is called a ____.

A programmer who is familiar with the design patterns of logical structure can more easily create and edit software.

Usually terminators are labeled with the words "start" or "stop," or sometimes "begin" or "end."

Alice's LOOP instruction allows us to use a negative increment.

There should only be one terminator at the beginning of an algorithm and one terminator at the end of an algorithm.

The question "Which pair of shoes would you like?", is an example of a binary question.

Algorithms are sequential in nature, forming a kind of sequential logic.

Whenever a more sophisticated loop is called for, such as one that counts backward, it is best to create your own version of a count-controlled loop with a FOR instruction.

In a ____, one of two instructions is chosen.

A ____ occurs when an algorithm branches backward to a previous instruction, and then repeats part of the algorithm.

To say that one thing is "predicated" on another means that one thing is determined by another.

Böhm and Jacopini used a system they called ____ to describe their work.

In a count-controlled loop, the control variable is a called a ____.

A(n) ____ is a diagram that shows the structure of an algorithm.

In a ____, an instruction is either executed or bypassed.

Böhm and Jacopini used a simple system of flowcharting with two symbols: ovals to show each step in an algorithm, and diamond-shaped boxes to show what they called a logical predicative.

In a posttest loop, the test to determine whether or not to continue executing the loop comes before any other instructions that are to be repeated.