Compete science chapter 3

Compete science chapter 3

memorize.aimemorize.ai (lvl 286)
Section 1

Preview this deck

approximation:

Front

Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

6 years ago

Date created

Mar 14, 2020

Cards (30)

Section 1

(30 cards)

approximation:

Front

digital copies are only approximations of the natural object.

Back

binary code:

Front

code represented with the two symbols of 1 and 0

Back

variable-width encoding:

Front

using codes of different lengths to encode a character set for representation (example: Morse Code)

Back

digital:

Front

how information is stored, accessed, transformed and used by computers state space: the space of potential possibilities

Back

bits:

Front

the foundation for digital computing (1s and 0s) - short for binary digits

Back

mapping:

Front

associating each element of a given set with one or more elements of a second set.

Back

floating-point numbers:

Front

numbers where the decimal point can float because there is no fixed number of digits before and after the decimal point. AKA: real numbers

Back

ASCII (American Standard Code for Information Interchange):

Front

a table that outlines a common set of conventions established for converting between binary values and alphanumeric (represents 128 different characters)

Back

scientific notation:

Front

the mathematical representation of a decimal number in

Back

data:

Front

characters, symbols or quantities on which operations are performed, stored and/or transmitted by a computer.

Back

Morse Code:

Front

a code where letters are represented by combinations of long and short signals of light or sound.

Back

continuous:

Front

unbroken, without interruption (analog)

Back

string

Front

a linear sequence of characters, words, or other data

Back

alphanumeric:

Front

the characters that consists of uppercase and lowercase letters in addition to numerals 0-9.

Back

discrete:

Front

separate or divided (digital)

Back

exponential growth:

Front

the rate of growth that rapidly increases in proportion to the growing total number or size.

Back

fixed-width encoding:

Front

using codes with a fixed width to encode a character set for representation (example: Baudot Code)

Back

Baudot Code:

Front

a binary code invented by Emile Baudot in 1870 that uses crosses and dots in order to encode 2^5 or 32 characters.

Back

linear search:

Front

a method for finding a target value within a list (whether presorted or not) by checking each value until a match is found or until all the elements have been searched.

Back

list:

Front

A list (also called an array) stores multiple pieces of information at once.

Back

real numbers:

Front

numbers approximated by floating-point representations that do not necessarily have infinite precision.

Back

index value:

Front

the representation of the location of each item in a list.

Back

digital noise:

Front

irrelevant or meaningless data that has found its way into otherwise meaningful code.

Back

data structure:

Front

a particular way of organizing and storing data such as an array, table, etc.

Back

unicode:

Front

a binary encoding system that can represent much more of the world's text than ASCII can (represents 65,536 different characters)

Back

dichotomous:

Front

in which something can only be one thing or another (yes or no

Back

bit string

Front

: a sequence of bits that can be used to represent sets or to manipulate binary data.

Back

abstraction:

Front

the process of removing or suppressing details to create a manageable level of complexity.

Back

fixed-point numbers:

Front

numbers where the decimal point is always in the same place.

Back

analog:

Front

non-digital signals or information represented by a continuously variable physical quantity such as spatial position or voltage.

Back