## vknight33 2 years ago Consider the following algorithm. x ← 1 for i is in {1, 2, 3, 4} do for j is in {1, 2, 3} do x ← x + x for k is in {1, 2, 3, 4, 5, 6} do x ← x + 1 x ← x + 5 Count the number of + operations done by this algorithm.

• This Question is Open
1. chris00

not my style of question. haha

2. amistre64

it looks like some type of for/next looping but the syntax is hard to parse

3. vknight33

Its suppose to be discrete mathematics. I am not a math person at all.

4. amistre64

its countable ... but the syntax/notation is hard to read thru. without knowing what the format is trying to convey its difficult to understand the process that is being described

5. amistre64

6. vknight33

I will do a screenshot and paste it here hang on

7. vknight33

Here it is

8. amistre64

hmm, im guessing it follows as such: x = 1 for i = 1 to 4 for j = 1 to 3; x=x+x for k = 1 to 6; x=x+1, x=x+5 4(3(1)+6(2)) operations is what it looks like to me

9. amistre64

x=n [x = n+n x = (n+n)+(n+n) x = (n+n)+(n+n)+(n+n)+(n+n) = 8(n) ] [x = 8(n)+6] x = 1 x'= 8(1)+6 x'= 8(8(14)+6)+6 x'= 8(8(8(14)+6)+6)+6 x'= 8(8(8(8(14)+6)+6)+6)+6 x = 60854

10. amistre64

pfft, i left the 14 in there ... should be a 1 :)

11. amistre64

12. vknight33

Is that the answer for "Count the number of + operations done by this algorithm."

13. amistre64

of course not, i already surmised the results for that .... this was just an attempt to actually work the algorithm to see what the output would give us ...