Airsaylongcon's Posts
Nairaland Forum › Airsaylongcon's Profile › Airsaylongcon's Posts
1 2 3 4 5 6 7 8 ... 71 72 73 74 75 76 77 78 79 (of 139 pages)
seunthomas:Why you dey run mouth? How many hours e take you to ask me your own?. I will modify this post with the question so look out *modified* A data structure is "built" using nodes. Each node has exactly two pointers that point to other nodes. None of the pointers is null. A C program is written to count how many nodes are accessible from any of the nodes in th data structure. The code use an "indicator" field (initialized to zero for all nodes). Correct the following code so that it works properly as it will not work in its current state struct t (int i,m; struct t*b, *d) int count(struct t*a) { If (a->m) return 0; return count(a->b) + count(a->d)+1; } |
seunthomas:Tsung can be tweaked to get 100k requests. I am preparing your question. |
seunthomas:I wouldn't bother my head to write a script. There are loads of tools that can stress test a we server to breaking point Now you won that one. I can't write the script. Can I ask you my challenge question? |
dhtml18:Same thing I thought o! I know he is trying to stress test a web server probably. This xan be done with JMeter or Apache Bench. Seunthomas can you provide further explanation ? We are simulating 100k users doing what? |
seunthomas:Ask it |
seunthomas:My guy, you could have been a friend. Maybe draft you on a project. But your are like the proverbial wolf that huffed and puffed without the necessary jaz. Are you gonna ask your 20 year question ? |
seunthomas:I guess your cover has been blown. You are indeed olabode adebayo. You are d silliest rookie alive. Piece of shit. Now where's that 20year question ? |
dhtml18:Facebook and LinkedIn should verify this |
seunthomas:No one wants to know your identity. Just your skill and if it matches your mouth |
seunthomas:You are very correct. Appropriately mixed sef. Now I am ready for your 20 year question. Are you ready to drop it? The strong stand and rumble the weak fold and crumble. Which are you? Strong enough to drop the question? Or your usual weakling self |
seunthomas:Can you verify that that is your repo or not? |
dhtml18:Aswear if you have been able to dig out his repo than I'm sure you will be able to sniff out the appointed date of Christ return. |
seunthomas:Please mention your biggest project. Mine is driving one of the largest DCs (DIstribution Centre, big word for warehouse) in Nigeria. 10k pallets serving over 230 actively shipping FP, with clients numbering over 100 each ordering over 20 FP per order. I'm so bad I developed an excel macro to further optimise manual processes that weren't maximally optimized. Mind you I had never ever coded an excel macro but within an hour of combing the internet I had "hacked" a solution together. It wasn't optimal and I went further to refine it. And u wouldn't dare say I am an advanced excel programmer. Not even a beginner. Now what's is you say your biggest project was again? |
seunthomas:Loolz. I don't share laptops with anyone cos I'm a nerd. I work with CLI. A thousand folks will see a CLI and just jejely leave my laptop alone. Now have you got your question ready? |
seunthomas:See buffoon. I NEVER initiate contact with NL monikers. You aren't worthy to engage in email conversation with. |
seunthomas:Dude I contended with you, a mere warehouse manager contended with you and I killed it. You asked for a challenge and when I threw the gauntlet down you failed to respond. You got a misery stricken guru01 your apprentice abi guru and I slated his challenge in minutes. You had two pops at my challenge at guru01 and flunked it. You even went ahead to allege you will give me a question that will get my entire village thinking for 20years. I asked you to shoot and u still failed to shoot. And you wanna contend with dhtml18? U want him to slaughter u and hang your head at aso villa? Negro please! Uve been ethered on your battle thread so many times you are smoldering ashes. You talk of pinching/stealing code. Lemme give you an example, moodle is THE leading open source VLE yet totara lms forked them with all their code and comment and nobody not even moodle screamed that they are thieves. Totara closed source loads of their dev, reserving the code only for peeps that buy totara and nobody died. Same thing tryton did to openerp (now odoo). So what's your point? Well as your BOSS (you admitted it yourself) you have no case. Now run along and het that question that will get my village folks thinking. I have told my village witches and they are waiting to destroy your question. Pussyass negro |
asalimpo:Fixed |
excel101:Well said. Nuff respect. |
lonzo:Fair enough. If you never insulted GEJ, if you castigated everyone that insulted him then you have every right to hold your head high. Kudos |
Knuckles black like my nyash |
seunthomas:You can say that again. I will boss you forever. Bow down to someone greater than you |
seunthomas:You missed your chance long ago. I had challenged you to battle since 6:57 am this morning. You never picked up the challenge egging on your friend to battle me. He did and I crushed his challenge. You and he have still to correctly answer mine. So of what use is a question from you. For the benefit of doubt though. Drop your question. |
Guru01, seunthomas and larisoft do the three of agree that I am better than you? Guru01 you gave me a challenge and I smashed it. I gave you a challenge and you flunked it twice Seunthomas you initially dodged my challenge despite repeated posts and eventually got Guru01 to challenge me. After I smashed his challenge you were fault picking that I didn't declare variables making my code susceptible to hacking. This is still unproven. And you have still failed to answer my challenge posed more than 24 hours ago. You backed Guru01 that the answer was B and I have explained to you why it CANNOT be B. You both have become silent. So 2v1 I answered your question both both of you failed to answer my question posed over 25 hours ago. Verdict: I airsaylongcon, am greater than Guru01 and seunthomas put together. Larisoft your case is just simple. Over sabi killed the cat. You were asked to evaluate the worst case scenario for an insertion sort on a k-sorted array. You ended up evaluating the best case scenario which wasn't a question that was asked you. Verdict: I am greater than you Unfollowing this thread as I (a mere hobbyist programmer) have outshone professional coders coding since 1998 |
Hasn't NSG written this post before? |
seunthomas:Really?! Meanwhile is guru01 still game or does he concede defeat? Larisoft your man also failed my question. So I'm beginning to draw a conclusion about you and your homies |
seunthomas:I have just used this as an illustrative function as it meets the criteria: is recursive for some values and non-recursive for other values, and it definitely terminates irrespective of the value provided. The example you have provided WILL NEVER TERMINATE for at least one value provided |
Everyone screaming to defend Oliseh should take note of this. While he sat at supersports studio criticising and fantasising about how he would push a player into more attacking or shutdown a game, Keshi and all other Coaches were roasting. Going for months unpaid. But none of them ever ran in the face of battle. Keshi was owed months of salary and he didn't resign. Mr Oliseh please next time don't run your mouth if you know you can't stand the pressure. Only those in the kitchen know how hot d fire is |
seunthomas:Are you implying that for a recursive function to work and terminate it doesn't need a path to escape from the recursive call? |
seunthomas:Consider this factorial function. int factorial(int n) { if(n!=1) return n*factorial(n-1); } This function is 1)recursive for some values (all values apart from 1) 2) is not recursive for some values ọ́in this case the integer 1) 3) is guaranteed to terminate. Now can you explain your choice of answer using the above recursive function? |
seunthomas:The question was originally thrown at you. So feel free |
seunthomas:It's NOT a trick question. |
1 2 3 4 5 6 7 8 ... 71 72 73 74 75 76 77 78 79 (of 139 pages)
