Data Structures & Algorithms: Array Operations

These flashcards cover key vocabulary terms and concepts related to array operations, retrieval, insertion, deletion, and searching in the context of data structures and algorithms.

Array

A data structure that stores multiple values of the same data type under one name.

Indexing

The method of accessing elements in an array, starting from zero.

Traversal

Visiting each element of the array once in order to perform operations.

Insertion

The process of adding an element into an array at a specified position.

Deletion

The operation of removing an element from a specific position in an array.

Linear Search

A method of searching for an element in an array by checking each element one by one until the desired value is found.

Fixed Size

A property of arrays that means their size cannot be changed once they are created.

2D Array

An array that holds data in a two-dimensional grid format, often used for storing tabular data.

Flowchart

A visual representation of a sequence of operations or decisions in a program.

Average

A calculated value representing the central point of a dataset, often computed by dividing the sum of all values by the number of values.