Search

In Stock

Test Bank For Computer Science An Overview 11th Edition By J. Glenn Brookshear

$18.00

Test Bank For Computer Science An Overview 11th Edition By J. Glenn Brookshear

ISBN-10: 0132569035, ISBN-13: 978-0132569033

Test Bank—Chapter One (Data Representation)

 

Multiple Choice Questions

 

  1. Which of the following Boolean operations produces the output 1 for the fewest number of input patterns?

 

  1. AND B. OR C. XOR

 

ANSWER: A

 

  1. Which of the following best describes the NOR operation?

 

  1. An XOR followed by a NOT B. An OR followed by a NOT
  2. A NOT followed by a NOT C. An AND followed by a NOT

 

ANSWER: B

 

  1. Which of the following bit patterns cannot be expressed in hexadecimal notation?

 

  1. 11111111 B.  1001                 C.  110011            D.  100000000001

 

ANSWER: C

 

  1. Which of the following is the binary representation of 4 5/8?

 

  1. 100.11             B.  10.011             C.  110.101           D.  100.101

 

ANSWER: D

 

  1. Which of the following bit patterns represents the value 5 in two’s complement notation?

 

  1. 00011010 B. 11111011        C. 00000101        D. 11111011

 

ANSWER: C

 

  1. Which of the following bit patterns represents the value -5 in two’s complement notation?

 

  1. 00011010 B. 11111011        C. 00000101        D. 11111011

 

ANSWER: D

 

  1. What is the result of the following addition problem (using two’s compliment notation)?

 

00001111

10101010

 

  1. 011000101 B. 10111001        C. 01010101        D. 10110101

 

ANSWER: B

 

  1. What is the result of the following subtraction problem (using two’s compliment notation)?

 

00001111

–   10101010

 

  1. 011000101 B. 10111001        C. 01010101        D. 10110101

 

ANSWER: A

 

  1. In which of the following addition problems (using two’s complement notation) does an overflow error occur?

 

  1. 0011              B.    0100               C.    1100

+ 1010                  + 0100                   + 1100

 

ANSWER: B

 

  1. Which of the following representations in two’s complement notation represents the largest value?

 

  1. 00000010 B. 11111111        C. 00000001        D. 11111110

 

ANSWER: A

 

  1. Which of the following representations in two’s complement notation represents the smallest value?

 

  1. 00000010 B. 11111111        C. 00000001        D. 11111100

 

ANSWER: D

 

  1. Which of the following bit patterns (represented in hexadecimal notation) represents a negative number in two’s complement notation?

 

  1. 7F                     B.  55                     C.  A6                     D. 08

 

ANSWER: C

 

  1. Which of the following bit patterns (represented in hexadecimal notation) represents a positive number in two’s complement notation?

 

  1. 7F                     B.  F7                     C.  A8                     D. 8A

 

ANSWER: A

 

  1. What value is represented by the bit pattern 01011100 when interpreted using floating-point format in which the most significant bit is the sign bit, the next three bits represent the exponent field in excess notation, and the last four bits represent the mantissa?

 

  1. -1 1/2               B.  1 1/2                 C. -3/8                    D. 3/8

 

ANSWER: B

 

  1. Which of the following values cannot be stored accurately using a floating-point format in which the most significant bit is the sign bit, the next three bits represent the exponent field in excess notation, and the last four bits represent the mantissa?

 

  1. 2 1/2                 B.  3/16                  C.  7                        D.  6 1/4

ANSWER: D

Reviews

There are no reviews yet.

Write a review

Your email address will not be published. Required fields are marked *

 

 

Back to Top
Product has been added to your cart