Term
|
Definition
| An ADT, or abstract data type, is a description of an object (or set of objects) together with a set of operations that can be performed on the object. |
|
|
Term
| What two operations are associated with a basic integer counter ADT? |
|
Definition
| Increment and get value (initialization is implicit in the definition of the ADT). |
|
|
Term
| What is a stack and what are its operations? |
|
Definition
| A stack is an ADT that is a type of list. The only part of the list that is accessibly by the user is the top of the list. Its operations include: pop, which deletes top element; top, which returns the top element; and push, which puts a new element on the top of the list. |
|
|
Term
| What is an object type and how is it designated? |
|
Definition
| An object type is a data type that has a pointer in memory that points to where the actual memory that stores the object is located. Whenever the object is referenced, it goes through this pointer first. You can create multiple pointers to one object without constructing any new objects. |
|
|
Term
| What does overloading refer to? |
|
Definition
| Overloading a class indicates that there are multiple constructors that are in the class. |
|
|
Term
| What are the defining properties of a bag ADT? |
|
Definition
| A bag is (usually) a collection of one type of object, and it is unordered and unindexed, and you can access any object in the bag if you know for which instance you are looking. |
|
|
Term
|
Definition
| When a node x is accessed, a splay operation is performed on x to move it to the root. To perform a splay operation we carry out a sequence of splay steps, each of which moves x closer to the root. By performing a splay operation on the node of interest after every access, the recently accessed nodes are kept near the root and the tree remains roughly balanced, so that we achieve the desired amortized time bounds. |
|
|
Term
|
Definition
| A way of organizing data in a computer so that it can be used efficiently, such as an array, linked list, stack, queue, or binary tree. |
|
|
Term
|
Definition
| A programming data structure that occupies contiguous memory, such as an array of values. |
|
|
Term
|
Definition
| An array of an arrays, characterized by rows and columns, arranged in a grid format, but still stored in contiguous, or side-by-side memory, accessed using two index values. |
|
|
Term
|
Definition
| A process used in stack and queue processing where a copy of the top or front value is acquired, without removing that item. |
|
|
Term
|
Definition
| A process used in stack and queue processing where a copy of the top or front value is acquired, and then removed from the stack or queue (Dequeue). |
|
|
Term
|
Definition
| A process used in stack and queue processing where a new value is inserted onto the top of the stack OR into the back of the queue (Enqueue). |
|
|
Term
|
Definition
| 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 last element that was added. LIFO - Last In First Out |
|
|
Term
|
Definition
| A FIFO (First In First Out) data structure, where the first element added will be the first to be removed, and where a new element is added to the back, much like a waiting line. |
|
|
Term
|
Definition
| A linear data structure, much like an array, that consists of nodes, where each node contains data as well as a link to the next node, but that does not use contiguous memory. |
|
|
Term
|
Definition
| Memory that is allocated as needed, and NOT contiguous (side-by-side), specifically during the implementation of a linked list style data structure, which also includes binary trees and graphs. |
|
|
Term
|
Definition
| A node is a basic unit of a data structure, such as a linked list or tree data structure. Nodes contain data and also may link to other nodes. Links between nodes are often implemented by pointers. |
|
|
Term
| Non-Linear Data Structure |
|
Definition
| A data structure that does not occupy contiguous memory, such as a linked list, graph, or tree. |
|
|
Term
|
Definition
| A node, including the root, which has one or more child nodes connected to it. |
|
|
Term
|
Definition
| A data structure that consists of nodes, with one root node at the base of the tree, and two nodes (left child and right child) extending from the root, and from each child node. |
|
|
Term
|
Definition
| The term used in trees to indicate a node that extends from another node, such as left child and right child in a binary tree. |
|
|
Term
|
Definition
| A tree in which there are no missing nodes when looking at each level of the tree. The lowest level of tree may not be completely full, but may not have any missing nodes. All other levels are full. |
|
|
Term
|
Definition
| the depth of node A is the length of the path from A to the root node. The root node is said to have depth 0. |
|
|
Term
|
Definition
| A child node is a node extending from another node. For example, a computer with internet access could be considered a child node of a node representing the internet. The inverse relationship is that of a parent node. If node C is a child of node A, then A is the parent node of C. |
|
|
Term
|
Definition
| the degree of a node is the number of children of the node. |
|
|
Term
|
Definition
| the connection between nodes. |
|
|
Term
|
Definition
|
|
Term
|
Definition
| the height of node A is the length of the longest path through children to a leaf node |
|
|
Term
|
Definition
| a node with at least one child. |
|
|
Term
|
Definition
|
|
Term
|
Definition
| a node distinguished from the rest of the tree nodes. Usually, it is depicted as the highest node of the tree |
|
|
Term
|
Definition
these are nodes connected to the same parent node.
Markup languages |
|
|
Term
|
Definition
| building structures that approximate concepts from a large set |
|
|
Term
|
Definition
| a graph-based system for image recognition. It uses wavelet transformations to encode incoming image data |
|
|
