Consider the following pseudo‑code where n and m are positive integers:

```
count = 0
for i = 1 to n
for j = i to n
if (i + j) mod 3 = 0
for k = 1 to m step 2
count = count + 1
```

How many times is the statement `count = count + 1` executed? Express your answer in terms of $n$ and $m$.

Question

Consider the following pseudo‑code where n and m are positive integers:

```
count = 0
for i = 1 to n
    for j = i to n
        if (i + j) mod 3 = 0
            for k = 1 to m step 2
                count = count + 1
```

How many times is the statement `count = count + 1` executed? Express your answer in terms of $n$ and $m$.

Accepted Answer

\left\lceil\frac{m}{2}\right\rceil\left(\frac{\lfloor n/3\rfloor\bigl(\lfloor n/3\rfloor+1\bigr)}{2}+\,\lfloor\frac{n+2}{3}\rfloor\cdot\lfloor\frac{n+1}{3}\rfloor\right)

Gce Model Questions Vol1 2022 Computer Studies Question 16

Consider the following pseudo‑code where n and m are positive integers: ``` count = 0 for i = 1 to n for j = i to n if (i + j) mod 3 = 0 for k = 1 to m step 2 count = count + 1 ``` How many times is the statement `count = count + 1` executed? Express your answer in terms of \(n\) and \(m\).

Answer Options

About This Question

Master the Exam!