Airsaylongcon's Posts
Nairaland Forum › Airsaylongcon's Profile › Airsaylongcon's Posts
1 2 3 4 5 6 7 8 ... 72 73 74 75 76 77 78 79 80 (of 139 pages)
dhtml18:Funny thing is despite me allowing him have a second try and effectively reducing his choice to just A or C he has gone ahead to make B his final choice. The question asked for which of the following is NOT true. Is it not true that for a recursive procedure to work there must be a path that is not recursive? |
guru01:Your answer is very wrong. WRONG in capital letters. The question says which of the following IS NOT true. Every recursive function that terminates MUST have a path that is not recursive. |
guru01:Your answer is wrong. And it seems like you are guessing |
guru01:A procedure "CallBack" is recursive for *some* inputs. If this procedure is guaranteed to terminate, then which of the following is not true. a) CallBack has a local variable b) CallBack has an path of execution where it is not recursive (doesn't call itself) C) CallBack refers to a global variable or has one or more parameters The name of the procedure (or function if you like) is CALLBACK. This procedure is recursive if it gets certain values (eg 3 or 7 or 199 etc) For other values it is not recursive. Irrespective of whether it gets a value that makes it recursive or not recursive it WILL terminate. Which of the options in A-C is not true given the above qualities of the procedure |
FincoApps:He only gets one shot. He has tossed his shot. I get only one shot. I have tossed mine |
guru01:You *think*? Or B is your answer? And would you like me to explain the question better? |
seunthomas:When dhtml18 said you kept shifting the goal post I thought he was lying but this right here is proof. Initially you said I couldn't write the code. I wrote it and purposely chose C a rarely used language. Now your excuse is that the code is insecure. Where we talking about secure code? Or code that works? Who told u I don't want my system hacked? I want it hacked. Now yes or no does my code work? Is it functionally correct? |
Guru01 You gave me a question at 2:46pm and at 2:48pm I had a solution ready. I gave you mine at 3:14pm and 10mins after you are still silent. Is everything OK? |
seunthomas:Semantics. I have abundance of memory I don't care about segmentation fault or memory corruption. The koko is that the almighty problem he gave me was solved. Is this true or not? Wasn't he the same person that you alleged will kill me with an unanswerable question? |
Guru01 Here's you question A procedure "CallBack" is recursive for *some* inputs. If this procedure is guaranteed to terminate, then which of the following is not true. a) CallBack has a local variable b) CallBack has an path of execution where it is not recursive (doesn't call itself) C) CallBack refers to a global variable or has one or more parameters |
seunthomas:Hear what you master said when I asked him if my code was correct. guru01:So please critique my code |
guru01:You haven't told me if my answer is correct or not. |
seunthomas:Seunthomas you should learn to read before talking. Here it is again Off the top of my head #include <stdio.h> int main() { char str[100],i; printf("Enter a string: \n"wink ; scanf("%s",str); for(i=0; str[i]!='\0'; ++i); printf("\nLength of input string: %d",i); return 0; } I have assumed that the maximum length of any string entered is 100. This can be modified upwards or downwards. I have used '\0' to indicate end of the thread |
guru01:OK means what? That my code is incorrect? |
dhtml18:I've written mine in C. Let him come and scrutinise it. I even thought he was going to hit me with a very hard question. Anyway you only get one shot and he has had his shot. I am still gonna ask him the same question I asked seunthomas |
guru01:Duration? *modified* Off the top of my head #include <stdio.h> int main() { char str[100],i; printf( "Enter a string: \n" ) ; scanf("%s",str); for(i=0; str[i]!='\0'; ++i); printf("\nLength of input string: %d",i); return 0; } I have assumed that the maximum length of any string entered is 100. This can be modified upwards or downwards. I have also used '\0' to indicate the end of the string |
seunthomas:Go and Google it. That's what I expected you to have done since. |
seunthomas:I beat you once already. You alter ego will be no match. You ran your mouth asking me for a battle now you want your friend to battle me? I will give him the same question I gave you. |
guru01:I am a programmer. Let's battle |
seunthomas:Oh so guru01 is your boss. Cos you failed to beat me you think he can? Someone hiding under "I am Web programmer" wants to beat me? Guru01 please let's battle na |
seunthomas:Write the Prolog module. If you fit write am then you are good. I will agree that you have solved at least one challenge from me |
seunthomas:Why don't you take up my challenge and prove without reasonable doubt that I'm in your shadow? Or is it that you don't know the answer? I can give you a less difficult one of Dr. SEUNTHOMAS (PhD Programming 1998) |
guru01:Point of correction. Prolog is a language I'm using on a side project. As a hobby. My day job I project manage an ERP written in python and a WMS written in C# and ASAP. NET. I am not a day-by-day developer. So whether you develop in php or I develop in qbasic the underlying thing is that given a problem we should be able to solve it irrespective of the language we speak. I ask again are you interested in battling me? Yes or No? |
seunthomas:I'm still here. I ain't going anywhere. I'm you lifetime nightmare. |
dhtml18:Seunthomas your nemesis is here. Fresh from jail with hot pepper for u. 15 pages on a code battle thread and the op has not come out victorious. The challenge I gave seunthomas and his protégé were pinched from a question bank used to screen graduate recruit Trainees who want to work as software developers at a multinational software company. Shame how they have both underperformed despite their bragging. |
donjayzi:He put up a shitty code that you have made more operational. If he was the top coder that he was he would have seen that the question was for a generic range and as such he cannot assume a range of 1 to 1000 (actually 2 to 1000 as his loop started at i=2). Just like I asked his friend larisoft for the worst case scenario for an insertion sort on a k-sorted array and he hurriedly gave me the best case scenario. Programming is about problem solving and no matter how elegant your solution is if it doesn't completely solve the problem then it is a failed code and the coder is a Dundee United |
donjayzi:Better refinement of the code. However is say start of 20 and end of 5 not a valid range? Aren't there prime numbers in that range? Will your code be able to handle such a situation? Note: When we do QA validation this is how we pick code apart until we resolved issues |
guru01:See buffoon ó! Your master nor reach, na you minuscule ant? Do you want to challenge me too? |
seunthomas:See am as e dey run! Coward. Anyway you just conceded that u can't solve my challenge so I can understand your inability to handle basic stuff |
seunthomas:Thanks for conceding that you haven't got a solution to the problem I gave you. Case closed. Now can you throw your own challenge? |
donjayzi:You go break person head o! |
seunthomas:OK I'm not a gentleman. Are you gonna take up my challenge? Yes or No? |
1 2 3 4 5 6 7 8 ... 72 73 74 75 76 77 78 79 80 (of 139 pages)
. Or are you simply just purposely under estimating your opponent ?