Student

Chapter1, Exercise1 The course take out : Int d2,count, Cause a compile-time conjury because the line ends in a comma and not semi-colon. there is a socio-economic class by nonentity error that causes a run-time error .In the two lines, D1 =(double)n/(double)i; D2=n/I; The chopine is dividing by zero when i=0 during the initial execution of the for loop. When rivulet the program label on a windows Vista system, employ the code blocks IDS version 8.02 , running the GCC compiler ,the line d1 =(double)n/(double); executes and assigns timelessness to d1. The program actually crashes when trying to perform the integer division . it appears that multiply can represent infinity ,but not integers . Chapter 2 ,Exercise 1 blaze c=35; Char g=D; prototype a =17.25; 1 universal gravitational constant0000011 0001 0100 0000 0000 0000 00000000 0000 0000 0000 0000 0000 0000 Chapter 2, Exercise 2 00101101 is 2^5 + 2^3 + 2^2 + 2^0 = 45 01011010 is 90. The in a higher place pattern is composition-shifted 1 bit to the left, multiplying 45 by 2. 10010001 is a cast out number. Complement it and tally 1 to deposit under ones skin its value 01101110+1=01101111= -111 11100011 is a negative number.

Complement it and hit 1 to stick its value 00011100+1=00011101 = - 29 0010 1000 1011 0110 = 2^13 + 2^11 + 2^7 + 2^5 + 2^4 + 2^2 + 2 = 10422 0110 1111 0010 1011 = 2^14 + 2^13 + 2^11 + 2^10 + 2^9 + 2^8 + 2^5 + 2^3 + 2^1 + 1 = 28459 1100 1011 1100 1000 is a negative number complement it and add 1 0011 0100 0011 0111 + 1= 0011 0100 0011 1000 = - 13368 1000 0000 1010 0011 is a negative numbe r 0111 1111 0101 1100 + 1 = 0111 1111 0101 ! 1101 = -32605 Chapter2, Exercise 9 The production is 79 3 122 Chapter2,Exercise 10 The payoff is 46 Chapter2 , Exercise 12 The program output is 10 22 46 8 14 16 14 32 46 64 100 Chapter 3 ,Exercise 1 The store Map enounce address value I 400 403 4 J 404 407 4 K 408- 411 3 Swap 412- 415 114 C[0] 416...If you want to get a full essay, baseball club it on our website: OrderCustomPaper.com

If you want to get a full essay, visit our page: write my paper