C Programming Concepts (Functions, Arrays, and Pointers)

Vocabulary terms and definitions covering Chapter 5 (Functions), Chapter 6 (Arrays), and Chapter 7 (Pointers) based on the lecture contents.

Modularization

The process of dividing a program into small, manageable pieces or modules to facilitate development and maintenance.

Math Library Functions

Pre-defined functions used in C for performing common mathematical calculations.

Function Prototype

A declaration that tells the compiler the function’s name, its return type, and the types of its parameters.

Function Call Stack

A data structure used to support the function call and return mechanism by maintaining the state of active functions.

Stack Frame

An entry on the function call stack that contains the local variables and return information for a specific function call.

Headers

Files that typically contain function prototypes for library functions and definitions of various data types and constants.

Passing Arguments by Value

A method of passing data to a function where a copy of Britain's value is made, protecting the original data from modification.

Passing Arguments by Reference

A method of passing data to a function where the function is given access to the original variable, allowing the function to modify it.

enum (Enumeration)

A user-defined data type consisting of a set of named integer constants.

Storage Classes

Attributes within C that determine the storage duration, scope, and linkage of identifiers.

Scope Rules

The set of rules that determine where in a program a specific identifier can be referenced.

Recursion

A programming technique where a function calls itself either directly or indirectly.

Fibonacci Series

A series of numbers often used to demonstrate recursion where each number is the sum of the two preceding ones.

Array

A consecutive group of memory locations that all have the same type and name.

Initializer List

A comma-separated list of values enclosed in braces used to initialize the elements of an array during definition.

Symbolic Constant

An identifier representing a constant value, often used to specify array sizes to make programs more maintainable.

Character Array

An array used for storing and manipulating strings in C.

Static Local Array

An array that retains its values between function calls and exists for the duration of the program.

Automatic Local Array

An array created each time the function in which it is defined is called and destroyed upon exit.

Linear Search

A technique for searching an array by comparing each element with a search key until the key is found or the end of the array is reached.

Binary Search

An efficient algorithm for searching a sorted array by repeatedly dividing the search interval in half.

Multidimensional Array

An array with more than one subscript, such as a double-subscripted array used to represent tables of values.

Variable-Length Array

An array whose size is determined by an expression evaluated at execution time rather than at compile time.

Pointer

A variable that contains the memory address of another variable as its value.

Pointer Operators

Operators such as the address operator (&) and the indirection/dereferencing operator (*) used to manipulate pointers.

const Qualifier

A keyword used to inform the compiler that the value of a particular variable should not be modified.

sizeof Operator

An operator used to determine the size of an array or any other data type in bytes during program execution.

Pointer Arithmetic

Operations such as addition, subtraction, incrementing, and decrementing that can be performed on pointer variables.

Pointer to void

A generic pointer type that can represent any pointer type but cannot be dereferenced directly.

Pointer/Offset Notation

A method of accessing array elements using a pointer and an integer offset to identify specific memory addresses.