Deck 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates

Full screen (f)
exit full mode
Question
Two's complement representation is a signed integer representation that does not suffer from the problem of two zeros.
Use Space or
up arrow
down arrow
to flip the card.
Question
The sum-of-products algorithm always produces an optimal circuit.
Question
Information is stored in the memory of a computer using the decimal numbering system.
Question
After we normalize a number, its first significant digit is immediately to the left of the binary point._________________________
Question
A strictly black/white image has greater storage requirements than an image represented using a gray scale.
Question
An integrated circuit, also known as a(n) chip, is mounted on a circuit board._________________________
Question
Complex mapping is the process of assigning a printable letter in our alphabet a unique number.
Question
Every Boolean expression can be represented pictorially as a circuit diagram, and every output value in a circuit diagram can be written as a Boolean expression.
Question
A(n) ____________________ is an error condition that occurs when an operation in a computer produces an integer that exceeds the maximum allowable value.
Question
A multiplexor is a circuit that has 2N output lines.
Question
To construct an AND gate, two transistors are connected in parallel.
Question
In a(n) analog representation, objects can take on any value._________________________
Question
The binary-to-decimal algorithm is based on successive divisions by 2._________________________
Question
The Boolean AND is a(n) unary operator._________________________
Question
Sequential circuits contain ____________________ loops.
Question
The emitter and collector are the two input lines of a transistor.
Question
To construct an OR gate, two transistors are connected in ____________________.
Question
There is no theoretical reason why one could not build a "decimal" computer, but computers use binary representation for reasons of reliability.
Question
____________________ signals must first be digitized to be stored in the computer.
Question
____________________ is the highness or lowness of a sound.
Question
There are ____ stable states in a bistable environment.

A) two
B) three
C) four
D) five
Question
Any whole number that can be represented in base 10 can also be represented in base 2, although it may take ____ digits.

A) 2
B) 10
C) more
D) fewer
Question
The True Color scheme uses ____ bits.

A) 8
B) 16
C) 24
D) 64
Question
What are the four steps of the sum-of-products algorithm?

A) compare for equality, subexpression construction using AND and NOT gates, subexpression addition using OR gates, subexpression multiplication
B) select input column, add inputs, multiply inputs, select output column
C) add subexpressions, multiply subexpressions, add gates, repeat as necessary
D) truth table construction, subexpression construction using AND and NOT gates, subexpression combination using OR gates, circuit diagram production
Question
The ____ of a sound wave is a measure of its loudness.

A) amplitude
B) frequency
C) period
D) wavelength
Question
____ 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.

A) Randomized compression
B) Decompression
C) Lossy compression
D) Repeat sampling
Question
A(n) ____ is a circuit that performs binary addition on two unsigned N-bit integers.

A) adding circuit
B) compare-for-equality
C) full adder
D) calculator
Question
A(n) ____ is a distinct point located on an image's surface.

A) pitch
B) amplitude
C) pixel
D) bit
Question
The ____ is the number of bits used to encode each sample.

A) digital rate
B) pixel rate
C) bit rate
D) bit depth
Question
The way information is represented by humans and the way it is entered at the keyboard is known as the ____ of information.

A) external representation
B) internal representation
C) user input
D) user output
Question
ASCII is able to encode a total of ____ different characters.

A) 64
B) 256
C) 512
D) 65,536
Question
____ is a circuit construction algorithm.

A) Sum-of-products
B) Compare-for-equality
C) Full adder
D) Circuit optimizer
Question
UNICODE is able to encode a total of ____ different characters.

A) 64
B) 256
C) 512
D) 65,536
Question
A multiplexor chooses one specific input by using an additional set of N lines called ____ lines.

A) control
B) decision
C) selector
D) feedback
Question
Using the leftmost bit of a number to represent the sign, with 0 meaning positive and 1 meaning negative is termed ____ notation.

A) one's complement
B) two's complement
C) sign/magnitude
D) unsigned
Question
In a ____, the values of the outputs depend only on the current values of the inputs.

A) multiplexor
B) decoder
C) circuit
D) transistor
Question
Transistors are constructed from ____, such as silicon and gallium arsenide.

A) magnetic cores
B) semiconductors
C) ionic crystals
D) chips
Question
A multiplexor is a circuit that has 2N input lines and ____ output line(s).

A) 1
B) 2
C) N
D) 2N
Question
The ____ operation complements the value of a Boolean expression.

A) NOR
B) OR
C) NOT
D) AND
Question
The total number of ____ per second is called hertz.

A) bits
B) bytes
C) periods
D) cycles
Question
What is code mapping?
Question
What is the function of a compare-for-equity circuit?
Question
Discuss at length the components of the sum-of-products algorithm.
Question
Explain what a color palette is and why it is significant in the storage of images.
Question
Briefly describe the two types of information representation.
Question
What is sampling?
Question
Explain what an arithmetic overflow is and what its significance in computer science is.
Question
What is the rule for evaluating the NOT operation?
Question
Describe at length what a multiplexor is.
Question
Discuss what a transistor is, how it is used, what it is made of, and how it works.
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/50
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates
1
Two's complement representation is a signed integer representation that does not suffer from the problem of two zeros.
True
2
The sum-of-products algorithm always produces an optimal circuit.
False
3
Information is stored in the memory of a computer using the decimal numbering system.
False
4
After we normalize a number, its first significant digit is immediately to the left of the binary point._________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
5
A strictly black/white image has greater storage requirements than an image represented using a gray scale.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
6
An integrated circuit, also known as a(n) chip, is mounted on a circuit board._________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
7
Complex mapping is the process of assigning a printable letter in our alphabet a unique number.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
8
Every Boolean expression can be represented pictorially as a circuit diagram, and every output value in a circuit diagram can be written as a Boolean expression.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
9
A(n) ____________________ is an error condition that occurs when an operation in a computer produces an integer that exceeds the maximum allowable value.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
10
A multiplexor is a circuit that has 2N output lines.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
11
To construct an AND gate, two transistors are connected in parallel.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
12
In a(n) analog representation, objects can take on any value._________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
13
The binary-to-decimal algorithm is based on successive divisions by 2._________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
14
The Boolean AND is a(n) unary operator._________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
15
Sequential circuits contain ____________________ loops.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
16
The emitter and collector are the two input lines of a transistor.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
17
To construct an OR gate, two transistors are connected in ____________________.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
18
There is no theoretical reason why one could not build a "decimal" computer, but computers use binary representation for reasons of reliability.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
19
____________________ signals must first be digitized to be stored in the computer.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
20
____________________ is the highness or lowness of a sound.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
21
There are ____ stable states in a bistable environment.

A) two
B) three
C) four
D) five
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
22
Any whole number that can be represented in base 10 can also be represented in base 2, although it may take ____ digits.

A) 2
B) 10
C) more
D) fewer
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
23
The True Color scheme uses ____ bits.

A) 8
B) 16
C) 24
D) 64
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
24
What are the four steps of the sum-of-products algorithm?

A) compare for equality, subexpression construction using AND and NOT gates, subexpression addition using OR gates, subexpression multiplication
B) select input column, add inputs, multiply inputs, select output column
C) add subexpressions, multiply subexpressions, add gates, repeat as necessary
D) truth table construction, subexpression construction using AND and NOT gates, subexpression combination using OR gates, circuit diagram production
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
25
The ____ of a sound wave is a measure of its loudness.

A) amplitude
B) frequency
C) period
D) wavelength
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
26
____ 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.

A) Randomized compression
B) Decompression
C) Lossy compression
D) Repeat sampling
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
27
A(n) ____ is a circuit that performs binary addition on two unsigned N-bit integers.

A) adding circuit
B) compare-for-equality
C) full adder
D) calculator
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
28
A(n) ____ is a distinct point located on an image's surface.

A) pitch
B) amplitude
C) pixel
D) bit
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
29
The ____ is the number of bits used to encode each sample.

A) digital rate
B) pixel rate
C) bit rate
D) bit depth
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
30
The way information is represented by humans and the way it is entered at the keyboard is known as the ____ of information.

A) external representation
B) internal representation
C) user input
D) user output
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
31
ASCII is able to encode a total of ____ different characters.

A) 64
B) 256
C) 512
D) 65,536
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
32
____ is a circuit construction algorithm.

A) Sum-of-products
B) Compare-for-equality
C) Full adder
D) Circuit optimizer
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
33
UNICODE is able to encode a total of ____ different characters.

A) 64
B) 256
C) 512
D) 65,536
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
34
A multiplexor chooses one specific input by using an additional set of N lines called ____ lines.

A) control
B) decision
C) selector
D) feedback
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
35
Using the leftmost bit of a number to represent the sign, with 0 meaning positive and 1 meaning negative is termed ____ notation.

A) one's complement
B) two's complement
C) sign/magnitude
D) unsigned
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
36
In a ____, the values of the outputs depend only on the current values of the inputs.

A) multiplexor
B) decoder
C) circuit
D) transistor
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
37
Transistors are constructed from ____, such as silicon and gallium arsenide.

A) magnetic cores
B) semiconductors
C) ionic crystals
D) chips
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
38
A multiplexor is a circuit that has 2N input lines and ____ output line(s).

A) 1
B) 2
C) N
D) 2N
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
39
The ____ operation complements the value of a Boolean expression.

A) NOR
B) OR
C) NOT
D) AND
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
40
The total number of ____ per second is called hertz.

A) bits
B) bytes
C) periods
D) cycles
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
41
What is code mapping?
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
42
What is the function of a compare-for-equity circuit?
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
43
Discuss at length the components of the sum-of-products algorithm.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
44
Explain what a color palette is and why it is significant in the storage of images.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
45
Briefly describe the two types of information representation.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
46
What is sampling?
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
47
Explain what an arithmetic overflow is and what its significance in computer science is.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
48
What is the rule for evaluating the NOT operation?
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
49
Describe at length what a multiplexor is.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
50
Discuss what a transistor is, how it is used, what it is made of, and how it works.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 50 flashcards in this deck.