In: Computer Science
7. __________________ representation of a binary number uses the bit following (after)
the most significant bit as the sign bit, making it possible to determine whether an
integer is negative or positive.
A). 2’s complement
B). 1’s complement
C). bitwise complement
D). bitwise negation
8. To obtain the 2’s complement of a binary number, it is necessary to flip (reverse) the
bits and ___________________________.
A). subtract 1
B). divide by 1
C). complement by 1
D). add 1
9. An overflow condition in signed numbers has occurred when ___________________.
A). the carry into the sign bit is different from the carry out of the sign bit
B). the carry into the sign bit equals the carry out of the sign bit
C). the carry into the sign bit is a multiple of 10 of the bit value on the carry out of the
sign bit
D). the carry into the sign bit is a negative value
10. Expresed as a series of 8 bits, the binary number that results from the addition of the
decimal (base 10) numbers 120 and –132 is ___________________________.
A). 00010100
B). 01010000
C). 11110100
D). 00000011
11. The hexadecimal (base 16) equivalent of the binary (base 2) number 110111110111
is _________________________.
A). FE7
B). DF7
C). D0E
D). EAD
12. In the EBCDIC collating sequence, lower case alphabetic characters ‘a’ thru ‘z’ are
considered to _____________ in value than upper case alphabetic characters A
thru Z.
A). be lower
B). be higher
C). be equal
D). have more precision
13. One of the inherent problems with migrating code from EBCDIC-based systems to
ASCII-based systems is that ____________________________________________.
A). the executable code will run slower on an ASCII-based system than on an
EBCDIC-based system
B). output results from sort routines and SQL queries may differ between the two
systems depending on the specific database values being processed
C). system performance bottlenecks will occur when the executable code runs on the
ASCII-based system that did not exist when the executable code ran on the
EBCDIC-based system
D). executable code running on EBDCIC-based systems cannot be optimized to run
faster.
14. Three common Boolean operators are _________________________________.
A). ADD, SUBTRACT, and DIVIDE
B). NOT, DIVIDE, and EXCLUSIVE OR
C). NOT AND, NOT OR, and EXCLUSIVE OR
D). AND, OR and NOT
15. When the Boolean operator __________ is applied to a Boolean expression, the result
is the complement of the expression.
A). NOT
B). OR
C). AND
D). bitwise complement
16. The basic physical component of a computer is the __________________; the basic
logic element is the _______________.
A). motherboard, transistor
B). transistor, multiplexer
C). transistor, gate
D). gate, transistor
17. The rules of precedence of Boolean operations are __________________________.
A). the OR operator has highest precedence, followed by the NOT operator, then the
AND operator
B). the NOT operator has highest precedence, followed by the AND operator, then
the OR operator
C). the AND operator has the highest precedence, followed by the OR operator, then
the NOT operator
D). the NOT operator has highest precedence only when followed by the OR
operator
18. A(n) ______________ is an electronic device that produces a result based on two or
more input values.
A). gate
B). arithmetic logic unit
C). transistor
D). central processing unit
19. The output of the ________________ Boolean operation is true only when the values
of the inputs differ.
A). NOT AND (NAND)
B). NOT OR (NOR)
C). EXCLUSIVE OR (XOR)
D). ANDOR (AOR)