Structured Programming

C++

Procedure or Subroutine

A function is a name section of a program that performs a specific task, so a function is this

Void function

A function that does not return a value

Code block

Enclosed group of statements inside a set of braces

Function Definition

Contains the interface to the function as well as the statements that make up the function

A function call

A statement that causes a function to execute

A parameter

A special variable that holds a value being passed into a function

Function prototype

Eliminates the need to place a function definition before all calls to the function

Body of the function

The set of statements that perform the function’s operation

Modular Program

Several small functions to solve a specific parts of a problem

Static local variables

Exist for the life time of the program outside scope of function.

Function

A collection of statements that performs a specific task

Arguments

Values that are sent to a function

Function Overloading

A concept to define two or more functions with the same name with unique signatures.

Function Header

The very first line of a function definition

Default Arguments

Passed to parameters automatically if no argument is provided in function call

Global Variable

Defined outside all functions and is accessible to all functions

Flow of execution

The order in which statements are executed in a program

A library

A package of code that is meant to be reused by many programs

Passed by value

When a copy of an argument is passed to a function.

Driver code

A code that tests a function by simply calling it

A function, procedure, or subroutine

A programming construct that allows a programmer to associate a given set of instructions with a specific name

Incremental Development

Involves writing and testing small portions of a programs repeatedly until the program is complete.

Local Variable

Defined inside a function and is not accessible outside the function.

A stub

A dummy function that is called instead of the actual function it represents.

Library

A collection of precompiled routines that a program can use

Formal parameters

The list of parameters indicated in the functions definition

Dead or unreachable code

Is a part of the source code of a program which can never be executed because there exists no control flow path to the code

Return value

A function sends a value to the part of the program that executed it

Static variables

Variables that are defined inside a function that remain in memory after the function has finished executing.

Passed by Reference

When a reference variable is used as a parameter.

reference variables

Allow a function to access the parameter’s original argument

True

A problem can be solved with recursion of it can be broken down into successive smaller problems that are identical to the overall problem.

True

Any problem that can be solved recursively can also be solved iteratively, with a loop. In fact, recursive algorithms are usually less efficient than iterative algorithms. This is because a function call requires several actions to be performed by the C++ runtime system. These actions include allocating memory for parameters and local variables and storing the address of the program location where control returns after the function terminates. These actions, which are sometimes referred to as overhead, take place with each function call. Such overhead is not necessary with a loop

Recursive

A function is one that calls on itself

indirect recursion

occurs when function A calls function B, which in turn calls function A.

Base Case

The part of a calculation that can be solved without recursion. This stops the recursive function from continuing to call itself.

Direct recursion

When a recursive function calls itself

Subscript (index)

The number inside an array’s brackets in an assignment statement, or any other statement that works with contents of the array. Can also pinpoint a specific location in a array.

Size declarator

The number inside the brackets of an array definition

Iterator

An STL object that behaves like a pointer and is used to access the individual data elements in a container

Bounds Checking

C++ does not perform this, and means you can write programs with subscripts that go beyond the boundaries of a particular array.

Subscript operator

Data in a standard C++ array is accessible only via this

Array

Allows you to store and work with multiple values of the same data type.

Subscript operators (push_back())

Data can be stores in a vector via this member function.

Range-based for loop

Receives the value of a different container element during each iteration of this. During the first loop iteration, it receives the value of the first element; during the second iteration, it receives the value of the second element and so forth.

pop_back()

Removes the last element from a vector

Range Variable

Receives the value of a different container element during each iteration

Vector

Holds a sequence of values stored in contiguous memory locations

Algorithms

Provided by the STL are implemented as function templates

element

each storage location of an array

resize()

Member function increases the number of values that a vector may store by the number indicated by its first argument.

clear()

Completely delete the contents of a vector.

at()

Retrieve the value of an element in a vector

size()

Vectors can report the number of elements they contain

empty()

Returns true if no data is stored in the vector

containers

The data types that are defined in the STL are commonly called this.

Off-by-one error

Starts at 1 instead of 0

capacity()

To determine the number of values that may currently stored in a vector

Standard template library

A collection of data types and algorithms that you can use in your programs (programmer defined and not part of C++)

binary search

is a clever algorithm that is much more efficient than the sequential search. Its only requirement is that the values in the container be sorted in order. Instead of testing the container’s first element, this algorithm starts with the element in the middle. If that element happens to contain the desired value, then the search is over

ascending order

 arrange the data in a way such that each element is in some way “smaller than” its successor.

selection sort

The smallest value in the array is located and moved to element 0. Then, the next smallest value is located and moved to element 1. This process continues until all of the elements have been placed in their proper order.

linear search

 also known as the sequential search, uses a loop to sequentially step through a container, starting with the first element. It compares each element with the value being searched for, and stops when either the value is found or the end of the container is encountered. If the value being searched for is not in the container, the algorithm will unsuccessfully search to the end of the container.

Running Total

is a summation that is continually adjusted to take account of items as they are "seen" by a program; these summations are stored in a variable referred to as a(n) accumulator.

pretest loop

the loop's expression is tested prior to an iteration.

infinite loop.

A repeating sequence of instructions that has no way to stop repeating would be a(n)

Input validation

is the process of inspecting data given to a program by the user and determining if it is valid.

increment or decrement operator

placed before the variable

 loop body

The statement or block of statements that repeat

initialization expression

 is the first expression in a for loop header. It is normally used to initialize a counter variable to its starting value. This is the first action performed by the loop and it is only done once.

nested loop

A loop that is inside another loop

 iteration

A single pass through a loop

multiple assignment

 describes how a variable in a loop stores different values throughout the execution of the loop.

Event - controlled loop

The number of repetition is unknown before the loop begins executing.

Sentinel

Indicate the end of data. Also a special value that cannot be mistaken as a member of data.

posttest loop

The loops expression is tested after each iteration

Loop header

The first line of a while or for loop

Update

Common kind of reassignment, where a new value of the variable depends on the old

Counter

A variable that is regularly incremented or decremented each time a loop iterates.

Initialize a variable

To store a value in the variable for the first time

Iteration, repetition, and looping

Repeated execution of a set of statements

Priming read

The read operation that takes place just before an input validation loop

Repetition

Repeated execution of a set of statements: one execution of the set of statements is referred to as an iteration.

Postfix mode

The increment or decrement operator is placed after the variable.

Decrement

To decrease the value of a variable

Increment

To increase the value of the variable.

Flag

Is raised when a program detects that an event has occurred.

Update expression

Executes at the end of each iteration.

Count controlled loop

The number of repetitions is known before the loops begins executing.

Descending order

Means the value in the container are stored from highest to lowest.