Provide trace tables for these loops. a. int i = 0; int j = 10; int n = 0; while (i < j) { i++; j--; n++; } b. int i = 0; int

Question

2 years ago

5

Provide trace tables for these loops. a. int i = 0; int j = 10; int n = 0; while (i < j) { i++; j--; n++; } b. int i = 0; int

j = 0; int n = 0; while (i < 10) { i++; n = n + i + j; j++; } c. int i = 10; int j = 0; int n = 0; while (i > 0) { i--; j++; n = n + i - j; } d. int i = 0; int j = 10; int n = 0; while (i != j) { i = i + 2; j = j - 2; n++; }

Computers and Technology

1 answer:

Eduardwww [97] · Answer 1 · 2022-04-03T10:30:28+03:00

Answer:

Following show the trace table.

Explanation:

a)

int i = 0; int j = 10; int n = 0;

while (i < j) { i++; j--; n++;

}

i j n

1 9 1

2 8 2

3 7 3

4 6 4

5 5 5

b)

int i = 0; int j = 0; int n = 0;

while (i < 10) { i++; n = n + i + j; j++;

}

i j n

1 1 2

2 2 4

3 3 9

4 4 16

5 5 25

6 6 36

7 7 49

8 8 64

9 9 81

10 10 100

c)

int i = 10; int j = 0; int n = 0;

while (i > 0) { i--; j++; n = n + i - j; }

i j n

9 1 8

8 2 14

7 3 18

6 4 20

5 5 18

4 6 14

3 7 8

2 8 0

1 9 -10

d)

int i = 0; int j = 10; int n = 0; while (i != j) { i = i + 2; j = j - 2; n++; }

i j n

2 8 1

4 6 2

6 4 3

8 2 4

10 0 5

12 -2 6

14 -4 7

... ... ...