2nd 10 Flashcards
A blank is matching between inputs (the domain) and outputs (the range).
An input to a function may be single number, or a collection of information.
The values making up an input are called the BLANK of the function.
A particular input must always result in the BLANK output every time the function is computed.
function
parameters
same
blank is a method or a process followed to solve a problem/ a recipe.
NOTE: THIS takes the input to a problem (function) and transforms it to the output.
A mapping of input to output.
algorithm
A problem can have MANY algorithms
NOTE: One can often reduce time if one is willing to sacrifice space, or vice versa.
blank Principle: The smaller you make the disk storage requirements, the faster your program will run.
Disk-based Space/Time Tradeoff
blank can also be analyzed with blank analysis.
Space complexity , asymptotic complexity
is a finite, ordered sequence of data items.
list
blank is restricted form of list: Insert and remove only at front of list.
Notation used here are:
Insert: PUSH
Remove: POP
The accessible element is called blank
LIFO: Last In, First Out
TOP
blank is made up of a finite set of nodes that is either empty or consists of a node
called the BLANK together with two binary trees, called the BLANKKKKKK, which are disjoint from each other and from the root.
binary trees,
root,
left and right subtrees
NOTE: this means every node has two children, either or both of which can be empty. Technically, leaf nodes have two empty children.
blank Often want to insert records, delete records, search for records.
Dictionary
Leaf implementation is identical to blank implementation, resulting in much wasted space due to null pointers. In fact, we know from the full binary tree theorem that half of the pointers are null
internal node
blank is a variable that stores the memory address of an object
pointer
