Shared Flashcard Set

Details

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

Additional Computer Science Flashcards

 


 

Cards

Term
FIFO
Definition
first-in, first-out: describes the ordering of a queue.
Term
filter
Definition
a process that removes unwanted elements from a collection.
Term
first-child/next-sibling
Definition
a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
Term
fold
Definition
to process a set of items using a specified function; another term for reduce.
Term
garbage
Definition
storage that is no longer pointed to by any variable and therefore can no longer be accessed.
Term
garbage collection
Definition
 the process of collecting garbage for recycling.
Term
gedanken
Definition
describes a thought experiment or view of an entity.
Term
geometric series
Definition
a series in which each successive term is multiplied by a constant less than 1, e.g. 1 + 1/2 + 1/4 + 1/8 + ...
Term
goal
Definition
an item (or description of items) being sought in a search.
Term
grammar
Definition
a formal description of a language in terms of vocabulary and rules for writing phrases and sentences.
Term
graph
Definition
a set of nodes and arcs connecting the nodes.
Term
greedy algorithm
Definition
an algorithm that always tries the solution path that appears to be the best.
Term
hash function
Definition
a function that is deterministic but randomizing, i.e. whose output is a relatively small integer that appears to be a random function of the key value.
Term
heuristic
Definition
a function that estimates the distance from a given node to the goal in A* search. More generally, a method that generally gives good advice about which direction to go or how to approach a problem.
Term
heuristic search
Definition
A* search
Term
immutable
Definition
describes a data structure that cannot be changed once it has been created, such as Integer or String in Java.
Term
in-place
Definition
describes a sort that does not require any additional memory.
Term
injective
Definition
describes a mapping in which each element of the domain maps to a single element of the range. Also, one-to-one.
Term
inorder
Definition
an order of processing a tree in which the parent node is processed in between its children.
Term
interior node
Definition
a node of a tree that has children.
Supporting users have an ad free experience!