1/74
Flashcards in bold are HL content. Generated with GPT o3-mini using ThinkIB Notes.
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
Recursion
A programming technique where a procedure or function calls itself with a termination condition, processing successive iterations until a base case is reached.
Recursive Algorithms
Algorithms that use recursion for clarity and elegant problem-solving (e.g., tree traversal, factorial calculation) but may use more memory and risk stack overflow.
Factorial (Recursive)
A recursive method for computing factorial defined as n! = n * (n–1)! with a base case of 1! = 1.
Trace Recursive Algorithms
A technique using a stack model to follow and debug recursive calls, showing how each call is stored and then resolved from the base case upward.
Object Reference
A variable that stores the memory address of an object; it points to the actual object in RAM rather than containing the object itself.
Abstract Data Type (ADT)
A high-level description of a data structure defined by its behavior (operations) without specifying its implementation details.
Lists (ADT)
A collection of elements with defined operations (e.g., add, remove, search) that can be implemented as arrays or linked lists.
JETS
The Java Examination Tool Subset, a simplified version of Java's standard library used in IB exams with essential collection methods.
Stack
An ADT based on Last-In, First-Out (LIFO) principles, supporting operations like push, pop, peek, and isEmpty.
Queue
An ADT based on First-In, First-Out (FIFO) principles, with core operations including enqueue, dequeue, peek, and isEmpty.
Binary Tree
A hierarchical data structure where each node has at most two children; used in searching, sorting, and representing hierarchical data.
Code Conventions
Standardized rules for naming, formatting, and organizing code (e.g., class names, method names, indentations) that improve readability and maintainability.