IB Computer Science: Topic 5 - Abstract Data Structures
Terms in this set (24)
This is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed to iteration)
A recursive function has one or more of these. It is the point at which the process ends and recursve calls are popped of the method stack.
Abstract Data Type
This is a mathematical model for data types where a data type is defined by its behavior (semantics) from the point of view of a user of the data, specifically in terms of possible values, possible operations on data of this type, and the behavior of these operations.
This is a particular kind of abstract data type in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, and the removal of entities from the front.
This is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed
How the ADT stack may be described in acronym form.
How the ADT queue may be described in acronym form.
Dynamic data structure
This refers to an organization or collection of data in memory that has the flexibility to grow or shrink in size, enabling a programmer to control exactly how much memory is utilized.
Static data structure
This is an organization or collection of data in memory that is fixed in size.
The node at the beginning of a linked list
The node at the end of a linked list
A data structure in which a record is linked to two successor records, when greater and the right when less than the previous record.
The first node of a binary tree
A node in a binary tree above a node.
A node in a binary tree below another node
A node in a binary tree on the same level as another node.
A node in a binary tree with no children
In order traversal
Process all nodes of a tree by recursively processing the left subtree, then processing the root, and finally the right subtree.
Pre order traversal
Process all nodes of a tree by processing the root, then recursively processing all subtrees.
Post order traversal
Process all nodes of a tree by recursively processing all subtrees, then finally processing the root.
An operation on a stack to add elements to the stack
An operation on a stack to remove elements from the stack
An operation on a queue to add elements to the end.
An operation on a queue to remove elements from the front.
YOU MIGHT ALSO LIKE...
Accounting Information Systems
WJEC Computing A2
1.4.2 Data Structures
APCS Chapter 11
OTHER SETS BY THIS CREATOR
Topic 1 .1 System Fundamentals
HL P3 Case Study Vocabulary
HL P3 Case Study Vocabulary
Year 8 - Semester One Exam Review