Array Data Structures Practice Flashcards

A set of vocabulary flashcards covering the definition, syntax, memory characteristics, and basic operations of the Array data structure based on the lecture by Dr. Maria Crystal E. Orozco.

Array

A type of linear data structure defined as a collection of elements with same or different data types, existing in both single and multiple dimensions.

Array Index

A key value used to label the elements in an array, acting as an identifier for each location.

Memory Address

The starting address of free memory available, distinct from an array index.

Element

Each individual item stored within an array.

Index

A numerical value assigned to each location of an element in an array, used to identify that specific element.

Array Declaration Syntax (C/C++)

\text{data_type array_name[array_size]={elements separated by commas}} or \text{data_type array_name[array_size];}

Linear Data Structure Memory Allocation

Memory is allocated sequentially, where each element occupies an entire memory block.

Space Complexity Optimization

Achieved by non-linear data structures which use memory more efficiently and reduce the wastage found in sequential allocation.

Array Index Start

In array representation, the index always starts with $0$.

Traverse

A basic operation that involves printing all the array elements one by one.

Insertion

A basic operation that adds an element at a specified index within the array.

Deletion

A basic operation that removes an element from a given index.

Search

A basic operation used to find an element either by its index or by its value.

Update

A basic operation that changes the value of an element at a given index.

Display

A basic operation that shows the entire contents of the array.