o Function - A subroutine that contains one or
It
more statements and performs a single well-
defined task.
o Pre-defined Function - A function was written
by another programmer that is already available
for use. Examples include printf(), pow(), and
sqrt().
o User-defined Function - A function that is
written or implemented by the programmer. It
is customized to fit the specific requirements of
the program.
o Main Program - The main function where
program execution begins.
o Subprogram - A function is a subprogram that
has the same life cycle as a program.
o Parameter - A variable that is passed to a
function when it is called. The function then
operates on the parameter.
o Return Statement - A statement used in
functions to return a value or cause an
immediate exit from the function.
o Function Declaration/Prototype - A declaration
that is read by the compiler when a function is
called to check whether the name exists and
whether the number of parameters and data
types are correct based on how it is declared.
o Function Definition/Implementation - A set of
statements that perform the task asked for by
the function.
o Function Call - The act of invoking a function.
is the only way a function exists.
o Argument - The value passed to a function
when it is called.
o Void - A keyword used to indicate that a
function does not require any input or output
parameters.
o Mathematical Operation - A process or
calculation that involves one or more numbers,
such as addition, subtraction, multiplication, or
division.
o Switch Statement - A control statement used in
programming languages to select one of many
possible code blocks to execute.
o Minuend - The number from which another
number is subtracted.
o Subtrahend - The number that is subtracted
from another number.
o Dividend - The number being divided in a
division operation.
o Divisor - The number by which the dividend is
divided in a division operation.
o Data Abstraction - is a process of providing only
the essential details to the outside world and
hiding the internal details, i.e., representing
only the essential details of the program. It is a
programming technique that depends on the
separation of the interface and implementation
details of the program.
o Base case - The simplest version of the problem
that can be solved directly without calling the
function again. It is also called the stopping
criterion or exit condition.
o Recursive case - The complex version of the
problem that requires the function to call itself
one or more times to solve the problem.
o Recursion depth - The number of times the
function calls itself before reaching the base
case. It is also called the call stack depth or
recursion level.
o Recursive function - A function that calls itself
to solve a problem.
o Direct recursion - When a function calls itself
directly.
o Indirect recursion - When a function calls
another function that eventually calls the
original function, creating a loop.
o Tail recursion - A special case of direct recursion
where the recursive call is the last statement in
the function. It allows some compilers to
optimize the code to use less memory.
o Recursive data structure - A data structure
containing a reference to itself creates a loop.
Examples include linked lists, trees, and graphs.
o Memorization - A technique of storing the
results of expensive function calls and returning
the cached result when the same inputs occur
again. This can improve the performance of
recursive functions, especially those with
overlapping subproblems.
o Dynamic programming - A technique of
breaking down a problem into smaller
subproblems and solving each subproblem only
once, storing the solutions in a table to avoid
redundant computation. This can improve the
performance of recursive functions, especially
those with optimal substructure and
overlapping subproblems.
o Recursion - is an alternative to iteration
(descending order). Because a recursive
function repeatedly calls itself, to terminate, the
base case should arrive. Thus in the complex
case, a part is an update to the parameter to
arrive at the base case.
o Pointer - A variable that stores the memory
address of another variable.
o Data type - indicates what type of variable the
pointer is allowed to point to. Thus, if a pointer
has to point to a character, the data type of the
pointer should be char. For the above example,
ptr can only point to an integer variable.
o Indirection - Referencing a value through a
pointer.
o Address Operator (&) - A unary operator that
returns the memory address of its operand.
o Indirection Operator \ Dereferencing operator
(*) - A unary operator that returns the value of
the object to which its operand, a pointer,
points.
o Pass by reference - A technique that uses
pointers to pass the address of a variable as a
parameter to a function instead of its value.
o Array - A variable that can store multiple values
of the same data type.

o Array subscript - An integer value used to

access an element in an array.

o Declaration - The process of defining an array in

C using its data type and size.

o Initialization - The process of assigning initial

values to the elements of an array during its
declaration.

o Index - A position in an array, starting from 0,

used to access its elements.

o Input/output - The process of reading from or

writing to an array. This can be done using a
loop and the standard input/output functions.