Chapter 4 Flashcards

1
Q

arithmetic overflow

A

an attempt to represent an integer that exceeds the maximum allowable value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

code mapping

A

representing textual material in binary by assigning to each printable letter of symbol in our alphabet a unique number

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

amplitude

A

the height of a sound wave is a measure of its loudness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

period

A

the time it takes for a wave to make one complete cycle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

frequency

A

the total number of cycles per unit time measured in cycles/second, also called hertz

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

pitch

A

the highness or lowness of a sound

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

sampling

A

at fixed time interva;s, the amplitude of a signal is measured and stored as an integer value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

scanning

A

measuring the intensity values of distinct points located at regular intervals across and image’s surface

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

lossless compression scheme

A

no information is lost during compression, and it is possible to exactly reproduce the original data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

lossy compression scheme

A

compress data in a way that does not guarantee that all of the information in the original data can be fully and completely recreated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Information is stored in the memory of a computer using the binary numbering system

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Two’s complement representation is a signed integer representation tat does not suffer from the problem of two zeros

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Two’s complement will always have one more negative number than positive, which less of a problem than two kinds of zeros

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

A strictly black-and-white image as greater storage requirements than an image represented using a gray scale

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

It is not currently feasible to build a reliable decimal computer due to the degradation and signal loss inherent in current electrical system.s

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The emitter and collecter are the two input lines of a transistor

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

To construct an AND gate, two transistors are connected in parallel

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Every Boolean expression algorithm can be represented pictorially as a circuit diagram, and every output value in a circuit diagram can be written as a Boolean expression

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

The sum-of-products algorithm always produces a circuit, but it is not always optimal

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

A multiplexer is a circuit that has 2^n output lines

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

The binary-to-decimal algorithm is based on successive divisions by 2

A

False

22
Q

After we normalize a number, its first significant digit is immediately to the right of the binary point

A

True

23
Q

In an analog representation, objects can take on only specific values

A

False

24
Q

An integrated circuit also known as a chip is mounted on a circuit board

A

True

25
Q

The Boolean NOT is an unary operator

A

True

26
Q

The way information is entered at a keyboard and displayed on a screen is known as the ______ of information

A

external representation

27
Q

Using the leftmost bit of a number to represent the sign, with 0 meaning positive and 1 meaning negative is termed _______ notation

A

sign/magnitude

28
Q

The amplitude of a sound wave is the measure of its _____

A

loud

29
Q

The total number of _____ per second is called hertz

A

cycles

30
Q

The _____is the number of bits used to encode each sample

A

bit depth

31
Q

A ____ is a distinct point located in an image’s surface

A

pixel

32
Q

____ schemes compress data in a way that does guarantee that all of the information in the original data can be fully and completely recreated

A

Lossy Compression

33
Q

There are _____ stable states in a bistable environment

A

two

34
Q

Transistors are constructed from ___, such as silicon and gallium arsenide

A

semiconductors

35
Q

The ___ operation complements the value of a Boolean expression

A

NOT

36
Q

In a ____, the values of the outputs depend only on the current values of the input

A

circuit

37
Q

____ algorithm is a circuit construction algorithm

A

Sum-of-products

38
Q

A _____ is a circuit that performs binary addition on two unsigned N-bit integers

A

full adder

39
Q

A multiplexer chooses one specific input by using an additional set of N lines called ___ lines

A

selector

40
Q

A multiplexer is a circuit that has 2^n input lines and ____ output line(s).

A

1

41
Q

An ______ is an error condition that occurs when an operation in a computer produces an integer that exceeds the maximum allowable value

A

Arithmetic Overflow

42
Q

Frequency is the measure of the ____, the highness or lowness of a sound

A

pitch

43
Q

____ signals must first be digitized to be stored in the computer

A

analog

44
Q

To construct an OR gate, 3 transistors are connected in ____.

A

parallel

45
Q

Sequential circuits contain ___ loops

A

feedback

46
Q

The _________ measures how many time per second the amplitude of a sound wave is sampled

A

sampling rate

47
Q

The bit ______ is the number of bits used to encode each sample

A

depth

48
Q

The most common format for storing color images is the _________ scheme

A

RGB encoding

49
Q

__________ algorithms attempt to represent information in ways that preserve accuracy while using significantly less space

A

Data Compression

50
Q

A ____________ measures how much compression schemes reduce the storage requirements of data

A

Compression Ratio