It seems, to me that the program/function always terminates.
(Though it doesn't produce the intended result (the function is named 'mu' which I guess, is for multiplication) for a < 0).
And the 'Q' required is just the Loop Invariant (right?), which I think is "y=i*b".
Or am I missing something large, considering that this is for a post grad paper and I've just begun my college education(two weeks, to be exact).
(The whole question paper is here)
Last edited by manasij7479; 07-16-2012 at 10:42 AM.
I have a hunch that condition P is about finding/avoiding boundary conditions to get an infinite loop, but that is most likely wrong.
If the loop invariant were sayinstead ofi <= a, then we have an infinite loop ati < a.mu(INT_MAX,x)
For the given case though, I couldn't find any.
Not everything that can be counted counts, and not everything that counts can be counted
- Albert Einstein.
No programming language is perfect. There is not even a single best language; there are only languages well suited or perhaps poorly suited for particular purposes.
- Herbert Mayer
O_o
Yeah, I'm not getting it either; the instructions are crazy vague.
Does that insanity actually fit both roles?Code:if (0 = 0) do exit
Soma
Q should be some expression involving a,b,i,y (those things involved in the loop)
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
Bwahahaa!Q should be some expression involving a,b,i,y (those things involved in the loop)
Okay, so, just to confirm here, this isn't about writing code at all is it? It is about reasoning through existing code isn't it?
Soma
I think so.
Something conceptually similar to assert.
Thats why I think Q will be "y==i*b".
But I have no idea what P can be.
(W.r.t the first comment, shouldn't language/implementation based things like INT_MAX, be left out of consideration in algorithms? )
