• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 4 out of 257 pages
Exam (elaborations)

Computer Science An Overview, Brookshear - Exam Preparation Test Bank (Downloadable Doc)

Document preview thumbnail
Preview 4 out of 257 pages

Description: Test Bank for Computer Science An Overview, Brookshear, 11e prepares you efficiently for your upcoming exams. It contains practice test questions tailored for your textbook. Computer Science An Overview, Brookshear, 11e Test bank allow you to access quizzes and multiple choice questions written specifically for your course. The test bank will most likely cover the entire textbook. Thus, you will get exams for each chapter in the book. You can still take advatange of the test bank even though you are using newer or older edition of the book. Simply because the textbook content will not significantly change in ne editions. In fact, some test banks remain identical for all editions. Disclaimer: We take copyright seriously. While we do our best to adhere to all IP laws mistakes sometimes happen. Therefore, if you believe the document contains infringed material, please get in touch with us and provide your electronic signature. and upon verification the doc will be deleted.

Content preview

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?



A. ANDB. OR C. XOR



ANSWER: A



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



A. An XOR followed by a NOT B. An OR followed by a NOT

C. A NOT followed by a NOT C. An AND followed by a NOT



ANSWER: B



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



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



ANSWER: C



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

, A. 100.11 B. 10.011 C. 110.101 D. 100.101



ANSWER: D



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



A. 00011010 B. 11111011 C. 00000101 D. 11111011



ANSWER: C



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



A. 00011010 B. 11111011 C. 00000101 D. 11111011



ANSWER: D



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



00001111

+ 10101010



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



ANSWER: B

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



00001111

- 10101010



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



ANSWER: A



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



A. 0011 B. 0100 C. 1100

+ 1010 + 0100 + 1100



ANSWER: B



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



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



ANSWER: A



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

, A. 00000010 B. 11111111 C. 00000001 D. 11111100



ANSWER: D



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



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



ANSWER: C



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



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



ANSWER: A



14. 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?



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



ANSWER: B



15. 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?

Connected book
 image
J.Glenn Brookshear Computer Science
Publisher: januari 2011 ISBN: 9780132569033 Edition: 11

Document information

Uploaded on
May 18, 2022
Number of pages
257
Written in
2021/2022
Type
Exam (elaborations)
Contains
Questions & answers
$40.99

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
tb4u
4.0
(159)
Sold
1005
Followers
775
Items
2367
Last sold
1 week ago



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions