CSS100 - CHAPTER 2

natural language

the language we speak and write in our everyday lives

pseudocode

A notation used to design algorithms. It uses English constructs, mathematical notation and an informal algorithmic structure designed to look like a high-level programming language.

three basic sequential operations

computation, input, output

computation operation

An algorithmic operation that carries out a single numeric computation and stores the result

variable

- A named storage location that can hold a data value

- simply a named storage location that can hold a data value.

input operation

An operation that causes data values from the outside world to be brought into the algorithm

output operation

An operation that causes computed values to be sent to the outside world for viewing or saving

sequential algorithm

An algorithm that executes its operations in a straight line, from top to bottom, without any branching

sequential algorithm

sometimes termed as a “straight-line algorithm”

iterative operations

Algorithmic operation that repeats a block of instructions

control operations

Operations that alter the normal sequential flow of control within an algorithm

conditional statements

Algorithmic operation that asks a question and selects the next step to carry out based on the answer to that question

conditional statements

“question-asking” operations of an algorithm

loop

the repetition of a block of instructions

iteration

The repetitive execution of a block of operations

continuation condition

The true/false condition in an iterative statement that will determine when the iteration has been completed

loop body

The block of statements/operations that are to be repetitively executed

pretest loop

the continuation condition is tested at the beginning of each pass through the loop, and therefore it is possible for the loop body never to be executed.

posttest loop

This type of iteration performs all the algorithmic operations contained in the loop body before it evaluates the true/false condition specified at the end of the loop.

pretest loop

uses a While/Do statement

posttest loop

uses a Do/While statement

primitive operations

An operation that can be directly understood by the computing agent executing the algorithm and which does not have to be further clarified or explained

algorithm discovery

The process of finding an algorithmic solution to a given problem

input data

The selection of an algorithm to solve a problem is greatly influenced by the way the ____ for that problem is organized.

sorting algorithm

puts an unordered list of numbers into ascending order

library

A collection of useful prewritten algorithms that can be used during problem solving

pattern matching

The process of searching for a special pattern of symbols within a larger collection of information

abstraction

The separation of the high-level view of an entity from the low-level details of its implementation

abstraction

allows us to understand and intellectually manage any large, complex system

top-down design

A problem solving strategy in which you begin at the highest level view of the problem and, in steps, address the lower-level details of how to accomplish each operation

variable

A(n) ____ is a named storage location that can hold a value.

input

When an algorithm reaches a(n) ____ operation, it waits until someone or something provides it with a value.

iteration

Another term for looping is ____.

animation

The concept of algorithm ____, is one in which you can observe an algorithm being executed and watch as data values are dynamically transformed into final results.

primitive

____ operations are instructions that a computing agent understands and is capable of executing without further explanation or simplification.

pseudocode

____ is a set of English language constructs designed to resemble statements in a programming language but that does not actually run on a computer.

matching

The process of searching for a special pattern of symbols within a larger collection of information is called pattern ____.

sequential

With a random collection of names, the most effective method of searching for a specific name is with a ____ search.

loop

If we need to do the same computation 1 million times, the power of the computer to ____, that is, to repetitively execute a block of statements, becomes quite apparent.

natural

We speak and write ____ language in our everyday lives.

sequential

A ____ algorithm executes its instructions in a straight line from top to bottom and then stops.

if/then/else

The ____ statement allows you to select exactly one of two alternatives—this or that.

one

If the condition in a do/while statement evaluates to false, the loop body is executed ____ time(s).

library

A ____ is a collection of useful, prewritten algorithms.

continuation

The true/false condition is called the ____ condition.

index

The sequential search technique might use a variable called a(n) ____ to search a list.