comm

Terms in this set (28)

in the sequential search algorithm the worst case occurs when the value being searched for is the ? value in the list
last
there are ? stable states in a bistable environment
two
the study of the efficiency of algorithms is called the ? of algorithms
analysis
the ? of a sound wave is a measure of its loudness
amplitude
the number of comparisons done by the selection sort algorithm does not grow at the same rate as the problem size n instead it grows at approximately the ? of that rate
square
? are useful for rating one machine against another and for rating how sensitive a particular algorithm is with respect to variations in input on one particular machine
benchmarks
problems for which no known polynomial solution algorithm exists are sometimes approached via ? algorithms
approximate
the ? sort algorithm performs the task of sorting a list by growing a sorted subsection of the list from the back to the front
selection
ASCII uses ? bits to represent each character
8
the way information is represented by humans and the way it is entered at the keyboard is known as the ? of information
external representation
the two digits ? are frequently referred to as bits
0 and 1
UNICODE uses ? bits to represent each character
16
? is the algorithmic equivalence of style
elegance
? is the term to describe an algorithm's careful use of resources
efficiency
a multiplexor chooses on specific input by using an additional set of N lines called ? lines
selector
The ? is the number of bits used to encode each sample
bit depth
using the leftmost bit of a number to represent the sign with 0 meaning positive and 1 meaning negative is termed ? notation
sign/magnitude
a surprising number of problems fall into the ? category
approximation algorithm
the ? operation complements the value of a boolean expression
NOT
? schemes compress data in a way that does not guarantee that all of the information in the original data can be fully and completely recreated
lossy compression
in a ? the values of the outputs depend only on the current values of the inputs
circuit
placing a list of items into alphabetical or numerical order is called ?
sorting
? problems are solvable but the solution algorithms all require so much work as to be virtually useless
intractable
the outputs in the full adder are the sum digit and the new ? digit
carry
any whole number that can be represented in base 10 can also be represented in base 2 although it may take ? digits
more
a(n) ? is a distinct point located on an images surface
pixel
the ? case of an algorithm requires the least work
best
a ? is an electronic device that operates on a collection of binary inputs to produce a binary output
gate
YOU MIGHT ALSO LIKE...
;