Question

In: Computer Science

7.   __________________ representation of a binary number uses the bit following (after)       the most significant...

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)

Solutions

Expert Solution


Related Solutions

1) given the 8-bit binary number of 10111110 (two) a)what is the hex representation of this...
1) given the 8-bit binary number of 10111110 (two) a)what is the hex representation of this number/ b) what is the decimal value if this number which is an 8-bit number as a two complement signed number. all steps included c)what is the decimal value of this number as an 8-bit unsigned number, please write all steps 2) given the decimal number (-0.875) or (-7/8) convert it to single-precision floating-point. please show the easiest way to get to this,.
c) Using the 32-bit binary representation for floating point numbers, represent the number 1011100110011 as a...
c) Using the 32-bit binary representation for floating point numbers, represent the number 1011100110011 as a 32 bit floating point number. i) A digital camera processes the images images in the real-world and stores them in binary form. Using the principles of digital signal processing, practically explain how this phenomenon occurs.
Concern the following 16-bit floating point representation: The first bit is the sign of the number...
Concern the following 16-bit floating point representation: The first bit is the sign of the number (0 = +, 1 = -), the next nine bits are the mantissa, the next bit is the sign of the exponent, and the last five bits are the magnitude of the exponent. All numbers are normalized, i.e. the first bit of the mantissa is one, except for zero which is all zeros. 1. What's the smallest difference between two consecutive or adjacent numbers?...
Show the IEE 754 binary representation of the number 0.625 in: a. single precision. After you...
Show the IEE 754 binary representation of the number 0.625 in: a. single precision. After you show the calculations, create a table with 2 rows and 32 columns to show the binary representation of the number. b. double precision. After you show the calculations, create a table with 3 rows and 32 columns to show the binary representation of the number.
What is the 11 bit, binary representation of -108? What is the hexadecimal equivalent of this...
What is the 11 bit, binary representation of -108? What is the hexadecimal equivalent of this number?
1.convert the following numbers from decimal to binary assuming seven-bit twe's complement binary representation: a)49 b)...
1.convert the following numbers from decimal to binary assuming seven-bit twe's complement binary representation: a)49 b) -27 c)0 d) -64 e) -1 f) -2 g) what is the range for this computer as written in binary and in decimal? 2.convert the following numbers from decimal to binary assuming nine-bit twe's complement binary representation: a)51 b) -29 c) -2 d)0 e) -256 f) -1 g ) what is the range for this computer as written in binary and in decimal?
7-bit float to fraction Consider a 7-bit float representation with 3 exponent bits. that k is...
7-bit float to fraction Consider a 7-bit float representation with 3 exponent bits. that k is the number of exponent bits, and the bias is computed as 2k-1-1. For each problem, convert the given float value (provided as a series of bits) into the equivalent base 10 fraction. Simplify each fraction as much as possible. If there is a whole number part and a fractional part, put a space between them. Here are some example values in the correct format:...
Convert the following statement into the 8-bit unsigned binary ASCII representation: Bob’s laptop receives the frame...
Convert the following statement into the 8-bit unsigned binary ASCII representation: Bob’s laptop receives the frame containing the ARP reply message. First, convert each character into it's ASCII equivalents. Then, convert to a Binary number. For example: Bob's -> 066 111 098 039 115 -> 01000010 01101111 01100010 00100111 01110011 Remember, each Binary number has to be 8-bits.
Prove that every real number with a terminating binary representation (finite number
Prove that every real number with a terminating binary representation (finite number of digits to the right of the binary point) also has a terminating decimal representation (finite number of digits to the right of the decimal point).  
(1) Convert negative fractional decimal number to 8-bit binary number: – 6.625 Hint: –7 + 0.375...
(1) Convert negative fractional decimal number to 8-bit binary number: – 6.625 Hint: –7 + 0.375 Given the hint above, the fractional number will be divided into two parts, - Whole number, - Fractional part, must be positive (2) Use 2's complement binary format to convert negative fractional decimal number to 8-bit binary number: – 6.625 (3) Proof to check that your representation calculation for (1) & (2) is correct
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT