Study essential data structures like arrays, lists, and trees.
A way of organizing and storing data so it can be accessed and modified efficiently.
A data structure that stores elements in a linear order and allows for efficient access and modif...
A data structure that stores key-value pairs and allows for fast data retrieval.
A collection of elements that follows the Last In, First Out (LIFO) principle.
A collection of elements that follows the First In, First Out (FIFO) principle.
Simple data types that include integers, floats, and characters.
Data types that combine primitive data types like arrays and structures.
A linear data structure where each element points to the next.
Looking to expand your skills in Programming? Look no further! These flashcards are designed to help you learn and retain information in a fun and engaging way.
Rememble is a free flashcard app that helps you learn and retain information in a fun and engaging way. With Rememble, you can create your own flashcards or choose from thousands of pre-made decks in a variety of subjects.
Whether you're studying for a test, learning a new language, or just want to expand your knowledge, Rememble has you covered. Sign up today and start learning!
A way of organizing and storing data so it can be accessed and modified efficiently.
Data Structure
A data structure that stores elements in a linear order and allows for efficient access and modification.
Array
A data structure that stores key-value pairs and allows for fast data retrieval.
Hash Table
A collection of elements that follows the Last In, First Out (LIFO) principle.
Stack
A collection of elements that follows the First In, First Out (FIFO) principle.
Queue
Simple data types that include integers, floats, and characters.
Primitive Data Types
Data types that combine primitive data types like arrays and structures.
Composite Data Types
A linear data structure where each element points to the next.
Linked List
A type of linked list where each node points only to the next node.
Singly Linked List
A type of linked list where each node has a reference to both the next node and the previous node.
Doubly Linked List
A type of linked list where the last node points to the first node.
Circular Linked List
A tree data structure in which each node has at most two children.
Binary Tree
A self-balancing binary search tree.
AVL Tree
A data structure that consists of a set of nodes and a set of edges that relate the nodes to each other.
Graph
A collection of distinct elements in no particular order.
Set
Refers to the computational complexity of an algorithm, in terms of time and space.
Algorithm Efficiency
A high-level type that hides detail about its implementation.
Abstract Data Types (ADTs)
A process in which a function calls itself as a subroutine.
Recursion
A special case of a binary tree where the key of each node is either greater than or equal to its child nodes.
Heap
The amount of memory space that an algorithm takes to run to completion.
Space Complexity
The computational complexity that describes the amount of time taken by an algorithm to run.
Time Complexity
An array containing one or more arrays.
Multidimensional Array
Continue your spaced-repetition or comprehensible input learning with these other flashcard decks related to Programming.
Understand basic programming concepts applicable to any language.
Learn the syntax and structure of the Rust programming language.
Master asynchronous programming in Rust.