Quick Computer science questions

Perform the following calculations on 8-bit twos complement integers (Questions 22-through-26) and answer 27-30. Will rate positive if all answered

22. 00101101₂ + 01101111₂ (do addition)

A: 10011100₂ B: 00011100₂ C: 10011000₂ D: overflow occurs E: none of these

23. 00010000₂ * 00000011₂ (do multiplication)

A: 00011000₂ B: 00110011₂ C: 00110000₂ D: 11000000₂ E: none of these

24. 01011111₂ 00001000₂ (do integer division and disregard remainder)

A: 00001010₂ B: 00001011₂ C: 00000111₂ D: 00000101₂ E: none of these

25. (Continuing 24) What is the remainder?

A: 00001010₂ B: 00001011₂ C: 00000111₂ D: 00000101₂ E: none of these

26. T or F? 01111110₂ 11111111₂ = 01111111₂ (do subtraction)

27. What is the base 10 equivalent of 10101010₂ when the 8-bit code is interpreted as an unsigned 8-bit integer?

A: 160 B: 170 C: -86 D: -85 E: none of these

28. What is the base 10 equivalent of 10101010₂ if when 8-bit code is interpreted as a twos complement 8-bit integer?

A: 160 B: 170 C: -86 D: -85 E: none of these

29. Which one of the following is not a correct numeric representation of the ASCII character 'A'? Hint See pages 138-139 in our text book.

A: 65₁₀ B: 01000001₂ C: 41₁₆ D: 101₈ E: 231₅

30. What is 123₁₀ represented in base 9 (nonary)?

A: 641₉ B: 416₉ C: 164₉ D: 146₉ E: none of these