Array Elements
Index Array Size
Initialization Access
Traversal Search

 

The individual items or values stored within an array. A data structure that stores a fixed-size sequential collection of elements of the same type.
The total number of elements that can be stored in an array. A number that represents the position of an element in an array.
Retrieving the value of a specific element in an array using its index. The process of assigning initial values to the elements of an array.
Finding the presence or location of a specific element in an array. Visiting each element of an array in a sequential manner.

 

Insertion Deletion
Element Traverse
Update Sort
2D Array Rows

 

Removing an element from a specific position in an Array. Adding a new element at a specified position in an array.
Visiting each element of the array once. A single value stored in the array.
Rearranging the elements of the array in a specific order. Modifying the value of an element in the array.
The horizontal dimension of a 2-dimensional array. An array that is commonly represented as a grid of rows and columns.

 

Columns Array Length
Nested Arrays Row
Column Modification
Dictionary Key

 

The total number of elements in a 2-dimensional array. The vertical dimension of a 2-dimensional array.
The horizontal dimension of a 2-dimensional array. Arrays that are placed inside other arrays, creating multiple dimensions.
Changing the value of a specific element in a 2-dimensional array. The vertical dimension of a 2-dimensional array.
A unique identifier that is used to access the corresponding value in a dictionary. A collection of key-value pairs, where each key maps to a specific value.

 

Value Mutable
Immutable Length
Keys Values
Clear Pop

 

A type of object that can be changed after it has been created. The data associated with a key in a dictionary.
The number of key-value pairs in a dictionary. A type of object that cannot be changed after it has been created.
A method that returns all the elements within a dictionary. A method that retrieves all the identifiers present in a dictionary.
A method that removes and returns the value associated with the specified key. A method that removes all key-value pairs from a dictionary.

 

Nested Dictionary Hash Table
Dictionary Methods Items
Get In
Copy Dictionary Comprehension

 

A data structure that allows for efficient access using a hash function. A dictionary that contains other dictionaries as values for its keys.
A method that returns a view object of all the key-value pairs in a dictionary. Functions that can be called on a dictionary object to perform operations such as adding, removing, or modifying key-value pairs.
An operator that returns True if a key is present within a dictionary, and False otherwise. A method that returns the value associated with the specified key. If the key is not found, it returns None or a default value.
A concise way to create a dictionary from an iterable by defining the key-value pairs within curly braces {}. A technique that produces a replica of a dictionary with a limited depth.

 

Records Data Structure Record
Field Attribute
Linked List Binary Tree

 

A solitary entity encompassed in a data structure that encompasses numerous fields or attributes. A data structure that allows you to store and organize multiple pieces of related information in a single unit.
Another term for a field within a record in a records data structure. A specific piece of information within a record in a records data structure.
A hierarchical data structure where each record has at most two children. A data structure that connects individual records in a linear order.