ITM 207 Midterm Review – Questions Answered
With Expert Insight
Save
Practice questions for this set
Learn 1/6 Study with Learn
negative(I) = 10^k - I, where k is the number of digits
Choose an answer
1 Natural Numbers 2 ASCII
3 Ten's Compelement 4 Byte
Don't know?
Terms in this set (50)
Zero and any number obtained by repeatedly adding
Natural Numbers
one to it.
Negative Numbers A value less than 0, with a - sign
Integers A natural number, a negative number
Rational Numbers An integer or the quotient of two integers
The number of bits in a word determines the word
Byte
length of the computer, which is usually a multiple of 8
, Reduction in the amount of space needed to store a
Data compression
piece of data or the bandwidth to transmit it
The size of the compressed data divided by the size of
Compression ratio
the original data
which means the data can be retrieved without any loss
lossless
of original information
which means some information may be lost in the
lossy
process of compression
A continuous representation, analogous to the actual
Analog Data
information it represents
A discrete representation, breaking the information up
Digital Data
into separate elements
Used by humans The sign represents the ordering (the
Signed-magnitude number negatives come before the positives in ascending
representation order) The digits represent the magnitude (the distance
from zero)
Ten's Compelement negative(I) = 10^k - I, where k is the number of digits
American Standard Code for Information Interchange,
ASCII
uses 7 bits
American Standard Code for Information Interchange,
Extended ASCII
uses 8 bits
Unicode uses 16 bits per character
Replace frequently used patterns of text with a single
Keyword Encoding
special character
In some types of data files, a single value may be
repeated over and over again in a long sequence
Run-Length Encoding
Replace a repeated sequence with -a flag -the
repeated value -the number of repetitions
an example of prefix coding: no character's bit string is
the prefix of any other character's bit string To decode
Huffman encoding Look for match left to right, bit by bit Record letter
when a match is found Begin where you left off, going
left to right
CDs store audio (or other) information digitally
Pits (reflect poorly)
With Expert Insight
Save
Practice questions for this set
Learn 1/6 Study with Learn
negative(I) = 10^k - I, where k is the number of digits
Choose an answer
1 Natural Numbers 2 ASCII
3 Ten's Compelement 4 Byte
Don't know?
Terms in this set (50)
Zero and any number obtained by repeatedly adding
Natural Numbers
one to it.
Negative Numbers A value less than 0, with a - sign
Integers A natural number, a negative number
Rational Numbers An integer or the quotient of two integers
The number of bits in a word determines the word
Byte
length of the computer, which is usually a multiple of 8
, Reduction in the amount of space needed to store a
Data compression
piece of data or the bandwidth to transmit it
The size of the compressed data divided by the size of
Compression ratio
the original data
which means the data can be retrieved without any loss
lossless
of original information
which means some information may be lost in the
lossy
process of compression
A continuous representation, analogous to the actual
Analog Data
information it represents
A discrete representation, breaking the information up
Digital Data
into separate elements
Used by humans The sign represents the ordering (the
Signed-magnitude number negatives come before the positives in ascending
representation order) The digits represent the magnitude (the distance
from zero)
Ten's Compelement negative(I) = 10^k - I, where k is the number of digits
American Standard Code for Information Interchange,
ASCII
uses 7 bits
American Standard Code for Information Interchange,
Extended ASCII
uses 8 bits
Unicode uses 16 bits per character
Replace frequently used patterns of text with a single
Keyword Encoding
special character
In some types of data files, a single value may be
repeated over and over again in a long sequence
Run-Length Encoding
Replace a repeated sequence with -a flag -the
repeated value -the number of repetitions
an example of prefix coding: no character's bit string is
the prefix of any other character's bit string To decode
Huffman encoding Look for match left to right, bit by bit Record letter
when a match is found Begin where you left off, going
left to right
CDs store audio (or other) information digitally
Pits (reflect poorly)
