Control Structures

Front 1

Define the control structure,

-Sequence

Back 1

sequence structure in a computer program directs the computer to process the program instructions, one after another in the order listed in the program.

Front 2

Define the control structure,

-Repetition

Back 2

Repetition structure, also called a "loop", directs the computer to repeat one or more instructions until some condition is met, st which time the computer should stop repeating the instructions.

Front 3

Define the control structure,

-Selection

Back 3

Selection structure, also called "decision" structure, makes a decision, and then takes an appropriate action based on that decision.

Front 4

Algorithm:

Back 4

the set of step by step instructions that accomplish a task

Front 5

Problem solving process:

Back 5

1. Analyze the problem
2. Plan the algorithm
3. Desk-check the algorithm
4. Code the algorithm into a program
5. Desk-check the program
6. Evaluate and modify (if necessary) the program

Front 6

Program:

Back 6

A coded algorithm

Front 7

Processing item:

Back 7

Represents and intermediate value that the algorithm uses when processing the input into the output

Front 8

Pseudocode:

Back 8

A tool programmers use to help them plan an algorithm. The statements represent the steps the computer must follow to solve the problem.

Front 9

Flowchart:

Back 9

Uses standardized symbols to show the steps the computer must take to accomplish the program's goal.

Front 10

Start/Stop symbol:

Back 10

The start oval indicates the beginning of the flowchart, and the stop oval indicates the end of the flowchart

Front 11

Input/Output symbol:

Back 11

The parallelogram is used to represent input tasks (such as getting info from the user) and output tasks (such as displaying or printing information)

Front 12

Flowline:

Back 12

Line that connects the flowchart symbols

Front 13

Process symbol:

Back 13

Rectangles used to represent tasks such as calculations

Front 14

Testing:

Back 14

Refers to running the program, along with sample data, on the computer.

Front 15

Debugging:

Back 15

Refers to the process of locating and removing any errors, called bugs, in a program

Front 16

Syntax error:

Back 16

created when you enter an instruction that violates the programming language's syntax, which is the set of rules that you must follow when using the language.

Front 17

Logic error:

Back 17

Created when you enter an instruction that does not give you the expected results

Front 18

Comment:

Back 18

A message to the person reading the program and is referred to as internal documentation.

Front 19

#include directive:

Back 19

provides a convenient way to merge the source code from one file with the source code in another file without having to retype the code

Front 20

Using statement:

Back 20

Tells the complier were it can find the definition of the keyword.

Front 21

Function:

Back 21

A block of code that performs a task.

Front 22

Void Function:

Back 22

does not return a value after completing the assigned task

Front 23

Value Returning Function:

Back 23

returns a value after completing the assigned task

Front 24

Function Header:

Back 24

Marks the beginning of a function.

Front 25

Function Body:

Back 25

Everything between the opening and closing braces of a function.

Front 26

Main Function:

Back 26

Every C++ program must have a main function because this is where the execution of a C++ program always begins.

Front 27

Variables and Named Constants:

Back 27

locations (within the computer's memory) where a program can temporarily store data.

Front 28

Declaring Variables:

Back 28

-Memory Allocated
-Data Type
-Named

Front 29

Identifier:

Back 29

The name of a variable, named constant, function, ect

Front 30

Initialization:

Back 30

Assigning an initial, or beginning, value

Front 31

Keyword:

Back 31

also referred to as a "reserved word", is a word that has a special meaning in a programming language.

Front 32

Fundamental Data Types:

Back 32

the basic data types built into the C++ language

Front 33

Floating Point Numbers:

Back 33

numbers with a decimal place.

Front 34

Integers:

Back 34

whole numbers

Front 35

Characters:

Back 35

letters, symbols, and numbers that will not be used in calculations

Front 36

Boolean Values:

Back 36

true and false

Front 37

Garbage:

Back 37

value of a variable that has not been initialized.

Front 38

Naming Rules:

Back 38

-Uppercase characters
-Lowercase characters
-Numeric (not first character)
-Underline

Front 39

Precedence:

Back 39

1.() override normal precedence rules
2. - negation
3. *, /, % multiplication, division, and modulus arithmetic
4. +, - addition and subtraction

Front 40

Integer Arithmetic:

Back 40

arithmetic operations between two integer values, result in an integer value.

Front 41

Floating-point Arithmetic:

Back 41

arithmetic operations between two floating-point values resulting in a floating-point value.

Front 42

Mixed Arithmetic:

Back 42

arithmetic operations between an integer and a floating-point value, results in a floating-point value

Front 43

Promoted Values:

Back 43

when a value is converted from one data type to another data type that can store larger numbers, the value is said to be "promoted".

Front 44

Demoted Values:

Back 44

when a value is converted from one data type to another data type that can store smaller numbers, the value is said to be "demoted".

Front 45

Truncation:

Back 45

when a floating-point number is assigned to an integer variable, the decimal portion of the number is truncated (dropped off).

Front 46

Modulus

Back 46

the remainder