quiz_01aae_binaryrepresentation(1)

quiz_01aae_binaryrepresentation(1) - To avoid overflow...

This preview shows pages 1–2. Sign up to view the full content.

01.04.1 Multiple-Choice Test Chapter 01.04 Binary Representation 1. ( ) ( ) 2 10 ? 25 = (A) 100110 (B) 10011 (C) 11001 (D) 110010 2. ( ) ( ) 10 2 ? 1101 = (A) 3 (B) 13 (C) 15 (D) 26 3. ( ) ( ) 2 10 ? . ? 375 . 25 = (A) 100110.011 (B) 11001.011 (C) 10011.0011 (D) 10011.110 4. Representing 2 in a fixed point register with 2 bits for the integer part and 3 bits for the fractional part gives a round-off error of most nearly (A) -0.085709 (B) 0.0392 (C) 0.1642 (D) 0.2892 5. An engineer working for the Department of Defense is writing a program that transfers non-negative real numbers to integer format.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: To avoid overflow problems, the maximum non-negative integer that can be represented in a 5-bit integer word is (A) 16 (B) 31 (C) 63 (D) 64 01.04.2 Chapter 01.04 6. For a numerically controlled machine, integers need to be stored in a memory location. The minimum number of bits needed for an integer word to represent all integers between 0 and 1024 is (A) 8 (B) 9 (C) 10 (D) 11 For a complete solution, refer to the links at the end of the book....
View Full Document

This note was uploaded on 06/12/2011 for the course EML 3041 taught by Professor Kaw,a during the Spring '08 term at University of South Florida.

Page1 / 2

quiz_01aae_binaryrepresentation(1) - To avoid overflow...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online