Programming Concepts and Procedures

A specific approach used to address a problem successfully.

The process of recognizing and defining an issue that needs a solution.

A series of steps taken to achieve a specific end or solve a problem.

The act of finding solutions to complex issues or challenges.

Choosing the most suitable method to solve a given problem.

A search algorithm that finds the position of a target value within a sorted array by comparing it to the middle element.

The process of comparing the search value with the middle element in binary search.

1. If the middle element matches the search value, found! 2. If less, search left. 3. If more, search right.

If the array is empty and the target is not found, it confirms the value isn't present.

A simple sorting algorithm that repeatedly steps through an array to sort it by comparing and swapping adjacent elements.

A simple sorting algorithm that divides the array into sorted and unsorted sections and continually selects the minimum from the unsorted section.

Data structures that can only hold elements of the same type, ensuring type safety.

Collections that allow specifications for different item types, enabling flexibility in data handling.

Collections that can hold elements of different data types and act like resizable arrays.

Method used to add an item to the collection.

Method returning the first item without removing it from the collection.

Method used to test if the collection is empty.

A measure of the efficiency of an algorithm based on its growth rate.

Amount of computer resources required to perform functions.

An algorithm's capability to maintain performance under stated conditions.

Effort required to modify an algorithm for different purposes.

Fundamental operations using AND, OR, XOR, NOT for programming.

Complex operations formed by combining fundamental computer operations.

Combination of semantics (meaning) and syntax (structure) in coding.

Low-level language of 0s and 1s understood directly by computers.

Tool that converts assembly language mnemonics to machine code.

Language that uses elements of natural language for easier programming.

Translator that converts entire source program into an object program at once.

Translator that processes translation each time the program runs.

Storage for a data element in programming that can change.

Represents values that do not change during program execution.

A data structure that combines data and actions.

Variables that store the current state of an object.

The visibility of a variable in the program's code.

A variable that is accessible throughout the entire program.

A variable with limited visibility, usually within a function or block.

A data structure that holds zero or more data elements and allows various operations.

A collection that can hold a specific number of items, not dynamically changeable.

A sequence of instructions designed to perform a specific task, can return values.

Utilizing existing code to speed up programming tasks and save resources.

The name of information used in a method, function, or procedure.

A strategy to break complex problems into smaller sub-problems.

A set of commands that perform a specific task when called.

Dividing a program into sub-procedures to manage complexity.

A unique name for variables, objects, or procedures in programming.

The process of repeating instructions within an algorithm.

Instructions that depend on a Boolean test to execute different actions.

A common conditional statement structure in programming.

Programming paradigm that uses objects to describe data and methods.

A data type defined by its operations and data structure.

A data structure that holds data and provides operations to manipulate it.

A collection of elements of the same data type, with a fixed size.

Multiple arrays storing different properties of the same entities.

A simple algorithm for finding an element in an array by checking each item.

Reproducing the behavior of a real system through a computer model.