Deck 4: Algorithms

Question 1

Algorithms contain the steps necessary to complete a particular task or solve a particular problem.

Answer 1

True

Question 2

Methods are not algorithms.

Answer 2

False

Question 3

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

Answer 3

True

Question 4

Sequential logic forms patterns, which can be understood as the elements of logical structure.

Question 5

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

Question 6

In the 1980s, two Italian mathematicians, Corrado Böhm and Giuseppe Jacopini, showed that algorithms are composed of three major structures: linear sequences, branching routines, and threads.

Question 7

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.

Question 8

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

Question 9

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.

Question 10

Flowcharts are designed to show the possible paths through an algorithm.

Question 11

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

Question 12

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

Question 13

The most notable characteristic of a linear sequence is that it has one branching routine.

Question 14

It is possible to rewrite each multiple branching routine as a collection of binary branching routines.

Question 15

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

Question 16

A repetition sequence forms a loop in an algorithm, which can be represented on a flowchart.

Question 17

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.

Question 18

A counter causes a process to be repeated until a condition or marker is encountered.

Question 19

Alice has a special LOOP instruction for programming count-controlled loops.

Question 20

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.

Question 21

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

Question 22

The process of running multiple threads is called repetition.

Question 23

The LOOP instruction in Alice is really intended to be used only in situations where the programmer wants to make something happen a certain number of times, such as jumping five times.

Question 24

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.

Question 25

A count-controlled loop has a value or condition that tells a loop when to stop executing.

Question 26

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

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

Question 27

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

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

Question 28

The ____ symbol for a logical predicative is called a decision diamond, a decision box, or a conditional.

A) line
B) oval
C) diamond
D) rectangle

Question 29

On a flowchart, the ____ shape is called a terminator.

A) line
B) diamond
C) oval
D) rectangle

Question 30

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

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

Question 31

A ____ occurs whenever the path or flow of sequential logic in an algorithm splits into two or more paths.

A) branching routine
B) binary branch
C) binary bypass
D) parallel routine

Question 32

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

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

Question 33

Branching routines are also known as ____.

A) repetition sequences
B) loops
C) binary choices
D) selection sequences

Question 34

If there are two possible paths in an algorithm, then the routine is known as ____.

A) binary branching
B) double branching
C) multiple branching
D) parallel branching

Question 35

If there are more than two paths in an algorithm, then it is called ____.

A) multiple branching
B) parallel branching
C) repetitive branching
D) binary branching

Question 36

The question "What flavor ice cream would you like?," is an example of ____.

A) multiple branching
B) parallel branching
C) repetitive branching
D) binary branching

Question 37

The question"Would you like vanilla ice cream?" is an example of ____.

A) multiple branching
B) parallel branching
C) repetitive branching
D) binary branching

Question 38

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

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

Question 39

In a ____, one of two instructions is chosen.

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

Question 40

The term ____ comes from the fact that it looks something like the code in a computer programming language, but not quite.

A) pseudocode
B) pidgin code
C) machine code
D) interpretive code

Question 41

Sometimes computer programmers use a more formal language, called ____ to describe algorithms.

A) procedural language
B) modular language
C) structured language
D) machine language

Question 42

In pseudocode, a ____ is equivalent to an IF/THEN instruction of the form IF (condition) THEN (instruction).

A) sentinel loop
B) control variable
C) branch
D) bypass

Question 43

A ____ is equivalent to an IF (condition) THEN (instruction A) ELSE (instruction B).

A) sentinel loop
B) binary choice
C) control variable
D) posttest loop

Question 44

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

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

Question 45

A(n) ____ is a variable whose value controls whether or not a selection sequence will be executed.

A) local variable
B) thread
C) instance variable
D) control variable

Question 46

In a ____, the test to determine whether or not to go though the loop comes before the block of code to be executed.

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

Question 47

A(n) ____ causes a process to be repeated a specific number of times.

A) sentinel
B) thread
C) count-controlled loop
D) parallel algorithm

Question 48

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

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

Question 49

It is possible for one computer, or several computers working together, to work on several parts of an algorithm at the same time. Each path of logic that is being executed is called a(n) ____ of sequential logic.

A) thread
B) branch
C) bypass
D) algorithm

Question 50

Algorithms that run multiple threads at the same time are called ____.

A) posttest loops
B) count-controlled loops
C) parallel algorithms
D) sentinel loops