3 ms·
It is trivial to create a simple recursive problem without saying anything that would be a Google-able search term. The problem may be solved, but the students
by btilly 16y ago
It is trivial to create a simple recursive problem without saying anything that would be a Google-able search term. The problem may be solved, but the students won't know what to search for.
For example have them write a program that solves the game of Nim, but don't tell them the name of the game they are solving. Instead call it "pick up pennies" or something like that. Now Google won't help.
- Xk 16y agoVery true. However, there will be someone in the class who knows that "pick up pennies" is just the game of Nim, and will google it. Renaming makes it harder so fewer people will be able to cheat, but it doesn't make it impossible. (That said, it wouldn't be all that hard for the professor to create his own game which is similar to Nim in some respects, but different in others -- I believe this would be the best solution -- but unfortunately most professors would not put the time in to do this.) This problem multiplies tenfold when you try to do it with math. (Integrate _____ -> WolframAlpha. Prove ______ -> Google.)
- Steuard 16y agoThere's a big gap between "not all that hard" and "something you have time to create from scratch for every problem on every exam in all of your classes every term". In general, creating good, well-balanced problems isn't easy! And many of the "classic" examples are classic precisely because they incorporate just the right blend of concepts in an unusually simple package. That's not easy to duplicate, if it's possible at all. (I do my best to write exam problems that way, but it can be a tortuous process.)