3 ms·
> It would probably be easy to cheat too. When I was in college a few years ago, one professor included this thing[1] in his (shell, spit and duct tape) auto-g
by livueta 8y ago
> It would probably be easy to cheat too.
When I was in college a few years ago, one professor included this thing[1] in his (shell, spit and duct tape) auto-grading system. It works by generating an AST of the input and comparing it against a bank, e.g. other submissions from the same class or prior years' classes. Apparently, it worked pretty well for flagging potentially problematic portions for manual review.
In a well-designed implementation of an auto-grading pipeline, I doubt that plagiarism is much more of a problem than in a purely manual grading scheme.
---
[1] http://theory.stanford.edu/~aiken/moss/ http://theory.stanford.edu/~aiken/moss/
- Scaevolus 8y agoMinor correction: moss operates at the lexical/token level, not the syntax tree. It matches fragments like IDENT EQUALS LPAREN NUMBER TIMES IDENT RPAREN DIVIDE NUMBER -- so renaming and changing indents (the most common cheater obfuscations) don't change anything!