Live data from Hacker News

Algorithms, by Jeff Erickson

jeffe.cs.illinois.edu

241–245 of 245 posts

Re: Algorithms, by Jeff Erickson

#241

Earlier quoted context omitted.

Yeah no, you don't get to say students should care more about learning than grades when jobs, opportunities, and scholarships given by the very university that claims learning is more important are riding on grades. It is the professor's responsibility to grade accurately, and honestly if there is so much inconsistency in grading that there's a significant probability that the student will lose marks despite having p…

As long as we're getting all realpolitik about it, the reason is that lots of students are assholes who will run roughshod over any professor who shows weakness. Source: was a student, watched it happen routinely. Meanwhile, in a less politically charged situation, it's pretty normal, or at least smart, to go back over any area where you messed up with a fine-toothed comb. If, and this is a rather pessimistic assumpt…

That policy would make sense, but that involves major caveats that aren't clear from the original description. That works because it's specifically written with "generosity buffer" that (by design) only benefits your grade, and thus doesn't indicate the teacher was falsely labeling the answers as correct when they weren't.

That's not the same thing as the original, which implied "my grading is so random, hope you're lucky on the rescore".

Edit: I had a high school teacher with a policy where she’d add X points to every score from the get go, and you’dlose those if you objected to grading, so you’d only object for misgrades by more than X. But that’s not the same as the original “okay, let’s roll my truth-recognizer dice again!”

Re: Algorithms, by Jeff Erickson

#243

Jeff Erickson was my algorithms professor in 2012. He exemplifies the articulate, passionate educator that I wish I had for my other CS subjects. I recognize many of these notes having read them many times in preparation for quite difficult exams - a fun anecdote shared among people who've taken the class is the 25% credit given on any exam question just for writing "I don't know", effectively a reward for acknowledg…

making things difficult is easier, the opposite should be promoted.

Re: Algorithms, by Jeff Erickson

#244
post #219

What the heck is the trivial one liner to check who will win a chess game given both players play perfect?

I believe this is a trick question. The "standard" chess board is 8x8, with a 32 possible pieces. This gives you a constant (albeit absurdly large) number of configurations, which means that the one-line solution "Brute Force" is an O(1) algorithm.

Re: Algorithms, by Jeff Erickson

#245
post #233
post #213

Earlier quoted context omitted.

Super interesting! Do you happen to have an Italian translation/version of the paper?

Just remembered: in fact the work was a master thesis, and the final report is in Italian. http://aladdinsrv.di.unimi.it/archive/pdf/tesi-previtali.pdf Enjoy!

Amazing, thanks a lot!
Post reply on HN