Deck 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/50
Play
Full screen (f)
Deck 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates
1
Information is stored in the memory of a computer using the binary numbering system.
True
2
In an analog representation, objects can take on only specific values . _________________________
False
3
The binary-to-decimal algorithm is based on successive divisions by 2. _________________________
False
4
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
5
Two's complement representation is a signed integer representation that does not suffer from the problem of two zeros.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
6
The sum-of-products algorithm always produces a circuit, but it's not always optimal.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
7
Sequential circuits contain ____________________ loops.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
8
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
9
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
10
After we normalize a number, its first significant digit is immediately to the right of the binary point. _________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
11
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
12
Frequency is the measure of the ____________________, the highness or lowness of a sound.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
13
____________________ 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
14
A multiplexor is a circuit that has 2 N output lines.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
15
A strictly black-and-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
16
It is not currently feasible to build a reliable decimal computer due to the degradation and signal loss inherent in current electrical systems.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
17
The Boolean NOT is an unary operator. _________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
18
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
19
Two's complement will always have one more negative number than positive, which is less of a problem than two kinds of zeros.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
20
An integrated circuit, also known as a chip , is mounted on a circuit board. _________________________
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
21
The ____ is the number of bits used to encode each sample.
A)digital rate
B)pixel rate
C)bit rate
D)bit depth
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
22
There are ____ stable states in a bistable environment.
A)two
B)three
C)four
D)five
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
23
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
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
24
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
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
25
A(n)____ is a distinct point located on an image's surface.
A)pitch
B)amplitude
C)pixel
D)bit
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
26
UNICODE is able to encode a total of ____ different characters.
A)64
B)256
C)512
D)65,536
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
27
The way information is entered at a keyboard and displayed on a screen is known as the ____ of information.
A)external representation
B)internal representation
C)user input
D)user output
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
28
____ algorithm is a circuit construction algorithm.
A)Sum-of-products
B)Compare-for-equality
C)Full-adder
D)Circuit-optimizer
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
29
The True Color scheme uses ____ bits.
A)8
B)16
C)24
D)64
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
30
A multiplexor chooses one specific input by using an additional set of N lines called ____ lines.
A)control
B)decision
C)selector
D)feedback
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
31
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, and subexpression multiplication
B)Select input column, add inputs, multiply inputs, and select output column
C)Add subexpressions, multiply subexpressions, add gates, and repeat as necessary
D)Truth table construction, subexpression construction using AND and NOT gates, subexpression combination using OR gates, and circuit diagram production
A)Compare for equality, subexpression construction using AND and NOT gates, subexpression addition using OR gates, and subexpression multiplication
B)Select input column, add inputs, multiply inputs, and select output column
C)Add subexpressions, multiply subexpressions, add gates, and repeat as necessary
D)Truth table construction, subexpression construction using AND and NOT gates, subexpression combination using OR gates, and circuit diagram production
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
32
ASCII is able to encode a total of ____ different symbols.
A)64
B)256
C)512
D)65,536
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
33
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
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
34
The ____ operation complements the value of a Boolean expression.
A)NOR
B)OR
C)NOT
D)AND
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
35
A multiplexor is a circuit that has 2 N input lines and ____ output line(s).
A)1
B)2
C)N
D)2 N
A)1
B)2
C)N
D)2 N
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
36
____ 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
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
37
The amplitude of a sound wave is a measure of its ________.
A)loudness
B)frequency
C)period
D)wavelength
A)loudness
B)frequency
C)period
D)wavelength
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
38
In a ____, the values of the outputs depend only on the current values of the inputs.
A)multiplexor
B)decoder
C)circuit
D)transistor
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
39
The total number of ____ per second is called hertz.
A)bits
B)bytes
C)periods
D)cycles
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
40
Transistors are constructed from ____, such as silicon and gallium arsenide.
A)magnetic cores
B)semiconductors
C)ionic crystals
D)chips
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
41
What is code mapping?
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
42
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
43
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
44
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
45
Describe at length what a multiplexor is.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
46
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
47
What is sampling?
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
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
50
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