# Shared Flashcard Set

## Details

Data Structures Part 2
Vocab List for CS 315 at the University of Texas
20
Computer Science
05/17/2011

Term
 binding
Definition
 an association of a name with a value.
Term
 binding list
Definition
 a list structure that represents a set of bindings.
Term
 Boolean matrix
Definition
 a matrix whose elements are 0 or 1
Term
 boxed number
Definition
 a number that is defined as an object, so that it has a runtime type and methods that can be used, e.g. Integer in Java
Term
 branching factor
Definition
 in a search tree, the number of children of a given node. Often, the branching factors of individual nodes will vary, so an average value may be used.
Term
 bucket
Definition
 a collection, such as a linked list, of values that hash to the same value.
Term
 cache
Definition
 to save a value locally to save re-computing or transferring it in the future.
Term
 Cartesian product
Definition
 a set of pairs (x, y) of elements from two sets X and Y.
Term
 child
Definition
 in a tree, a node pointed to by a parent node.
Term
Definition
 a linked list in which the last element points back to the first element.
Term
 circular queue
Definition
 a queue implemented within an array, where the first element of the array logically follows the last element.
Term
 class
Definition
 in object-oriented programming, a description of a set of similar objects.
Term
 clustering
Definition
 a situation in which many elements has to the same hash value.
Term
 collision
Definition
 when two values to be stored in a hash table have the same hash value.
Term
 comparison
Definition
 the act of comparing two values to determine which is greater according to some ordering.
Term
 cons
Definition
 1. in Lisp, the function that constructs a pair of pointers, or basic element of list structure. 2. to make a cons data structure. 3. a cons data structure.
Term
 constructive
Definition
 describes a function that makes a new data structure but does not modify its arguments.
Term
 critical path
Definition
 in a PERT chart or scheduling graph, a path from the initial state to the goal such that any increase in time required along the critical path will increase the time to complete the whole project.
Term
 cycle
Definition
 a circular path in a graph.
Term
 DAG
Definition
 directed acyclic graph.
Supporting users have an ad free experience!