1/26
Vocabulary flashcards covering key Data Structures and Algorithms terms, definitions, and concepts based on the prelim exam reviewer.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Algorithm
A step-by-step procedure used to solve a problem.
Array
A collection of elements stored in an ordered sequence.
Linear Data Structure
A data structure where elements are arranged one after another.
Linked List
A collection or sequence of nodes connected using pointers.
Index
The position of an element in an array, which usually starts at 0.
Iteration
The repetition of instructions using a loop.
Non-Linear Data Structure
A data structure where elements are not arranged in a single sequence.
ADT (Abstract Data Type)
Describes the operations that can be performed on a data structure without specifying how they are implemented.
Elements
The individual items stored in a data structure.
Length
The number of elements in a data structure.
Data Structure
A way of organizing and storing data so it can be used efficiently.
Public / External
Data or operations that can be accessed from outside a class or structure.
Pointer Field
A part of a node that stores the address or reference of another node.
Head
The pointer that refers to the first node of a linked list.
Simple Variable
A variable that stores one value.
Recursion
A process where a function calls itself to solve a problem.
Private / Internal
Data or operations that can only be accessed inside a class or structure.
Data Field
The part of a node that stores the actual data.
Recursive
A function or process that calls itself.
Stack
A linear data structure that follows LIFO (Last In, First Out).
Push
A stack operation that adds an element.
Pop
A stack operation that removes an element.
Peek / Top
A stack operation to view the top element.
Doubly Linked List
A linked list where each node has two pointers: Previous pointer and Next pointer.
Binary Recursion
A recursive function that makes two recursive calls.
Predecessor
The element or node that comes before another element or node.
Nodes
The individual parts of a linked list that commonly contain a data field and a pointer field.