This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 1 0b1 iii. 2 0b10 iv. 3 0b11 v. 4 0b100 vi. 10 0b1010 vii. 15 0b1111 viii. 16 0b10000 ix. 100 0b1100100 C. For each of the following tracing tables, write a single statement that would take you from the initial state to the corresponding final state. Assume the following declarations: object Natural_Number_1_C n1, n2; object Integer k; i. n1 = 123456 k = -42 what statement? n1 = 12345 k = 6 ii. n1 = 78 k = 9 what statement? n1.Clear(); n1 = 789 k = 9 iii. n1 = 865365765768 n2 = 9732457521 k = 62 what statement? n1 = 9732457521 n2 = 865365765768 k = 62...
View Full Document
This note was uploaded on 09/19/2008 for the course CSE 221 taught by Professor Mathias during the Spring '08 term at Ohio State.
- Spring '08