This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: F.2 Chapter 2 Solutions 2.1 The answer is 2 n 2.2 For 26 characters, we need at least 5 bits. For 52 characters, we need at least 6 bits. 2.3 (a) For 400 students, we need at least 9 bits. (b) 2 9 = 512 , so 112 more students could enter. 2.4 2 n integers can be represented. The range would be 0 to ( 2 n )  1. 2.5 If each number is represented with 5 bits, 7 = 00111 in all three systems7 = 11000 (1s complement) = 10111 (signed magnitude) = 11001 (2s complement) 2.6 100000. 2.7 Refer the following table: 0000 0001 1 0010 2 0011 3 0100 4 0101 5 0110 6 0111 7 10008 10017 10106 10115 11004 11013 11102 11111 2.8 The answers are: (a) 127 in decimal, 01111111 in binary. (b) 128 in decimal, 10000000 in binary. (c) ( 2 n 1 )1 (d) ( 2 n 1 ) 1 2 2.9 Avogadros number (6.02 x 10 23 ) requires 80 bits to be represented in twos complement binary representation. 2.10 The answers are: (a) 6 (b) 90 (c) 2 (d) 14803 2.11 (a) 01100110 (b) 01000000 (c) 00100001 (d) 10000000 (e) 01111111 2.12 It is a multiple of 4. 2.13 (a) 11111010 (b) 00011001 (c) 11111000 (d) 00000001 2.14 (a) 1100 (b) 1010 (c) 1111 (d) 01011 (e) 10000 2.15 Dividing the number by two. 2.16 (a) 11111111 (binary) or 0 (decimal) (b) 10001110 (binary) or 14(decimal) (c) 00000000 (binary) or 0 (decimal) 2.17 (a) 1100 (binary) or 4 (decimal)...
View
Full
Document
This homework help was uploaded on 04/07/2008 for the course ECE 495K taught by Professor Vijaykumar during the Spring '08 term at Purdue UniversityWest Lafayette.
 Spring '08
 Vijaykumar

Click to edit the document details