University of Texas at Austin CS 314 Novak

### Abstract Data Type

A description of a operations on a data type that could have multiple possible implemations

### ASCII

American Standard Code for Information Interchange. A character code that maps 8-digit binary integers to characters.

### Big-O

an abstracted function that describes the time needed or space required for an algorithm, as a function of problem size.

### Binary Search Tree

a tree set up such that each node has contents, and all of it's left descendants are less than the contents, and all of it's right descendants are greater than the contents.

### Boxed Number

a number that is defined as an object, so that it has a runtime type and methods that can be used.

### Circular Queue

a queue implemented in an array, where the first element in the list logically follows the last.

### Cons

1.In Lisp, a function that constructs a pair of pointers, a basic list structure.

2. A cons data structure.

3. To make a cons data structure.

### Constructive

describes a function that creates a new data structure without modifying it's elements.

### Depth-First Search

a search in which a node's children are considered(recursively) before it's siblings.

### Divide and Conquer

a problem-solving strategy in which a problem is broken down into subproblems, until simple subproblems are reached.

### First-Child/Next-Sibling

a way of implementing a tree that uses to pointers per node, but can represent an arbitrary number of children of a node.

### Garbage

1. Data that is meaningless, useless, or random. Storage that is no longer being pointed to, and therefore cannot be accessed.