170 likes | 295 Views
SI G CSEngers C# == D b. Teacher Please. With apologies to “ Lida Rose” Lyrics by Steve Bogaerts. Guys So here are my programs. I think they work fine. Teacher please, oh won’t you check mine? Check mine. Teacher please, oh won’t you check these, They all compile, except this one.
E N D
SIGCSEngers C# == Db
Teacher Please With apologies to “Lida Rose” Lyrics by Steve Bogaerts
Guys So here are my programs. I think they work fine. Teacher please, oh won’t you check mine? Check mine.
Teacher please, oh won’t you check these, They all compile, except this one. Teacher please, I’m down on my knees. I hope you’ll tell me I’m all done.
Type mismatch? Well, it never happened before. Out of bounds? Here I set n to 1. How’d it become 4?
Here’s a tree, a binary tree, if I could only find the root. Now a fault? Oh no, a seg fault! Well then I guess I’ll just reboot! So here are my programs, not fancy or fine. Teacher please, oh won’t you be kind? Teacher please, oh, teacher please, oh.
Gals Well, let’s see. Hmm, OK. I see the problem. It’s that array. Will I pass you? I guess I’ll pass you. But I’m going to tell you, you’ll have to do this one again.
Take your time, take it slow. Check out this loop here, how long it goes. Forever. Oh yes, forever. Will it ever finish? Ah, no.
Guys and Gals (Hang on to your hats for this part!)
The Longest Path Music by Billy Joel Lyrics by Daniel Barrett
Woh, oh-oh-oh Find the Longest Path Woh oh-oh Find the Longest Path
If you said P is NP tonight There would still be papers left to write. I have a weakness, I'm addicted to completeness And I keep searching for the Longest Path.
The algorithm I would like to see Is of Polynomial Degree. Buts its elusive, Nobody has found conclusive Evidence that we can find the Longest Path.
I have been hard working for so long. I swear its right, and he marks it wrong. Somehow I'll feel sorry when it's done. GPA 2.1 Is more than I hoped for.
Garey, Johnson, Karp and other men (and women) Try to make it Order n log n. Am I a math fool If I spend my life in grad school Forever following the Longest Path.
for ( int k = 0 ; k < 4 ; k++ ) { sing( "Woh, oh-oh-oh" ) ; sing( "Find the Longest Path" ) ; }
to Tracy and Paulfor inviting us, to you for listening, and to our T-shirtsponsor ...