Shouldn't be too difficult. I haven't done much teaching and could write a short list. Unfortunately, I don't think it would be very surprising to most people (

Shouldn't be too difficult. I haven't done much teaching and could write a short list. Unfortunately, I don't think it would be very surprising to most people (just as this list probably isn't surprising to most math majors, since we've all made at least one of these "stupid mistakes" before, even when we knew better, especially in the early years. The difference -- and this is reiterated several times -- is that good/smart students notice their error and debug their math/program, instead of just going with it or fudging their result). Here are a few: * Not actually thinking of a solution to the problem before starting to write a program; not soliciting requirements. * ALL of the mistakes covered by this article. Struggling CS majors are often (not always) really, really horrible at math, and this -- more than anything else -- really holds them back from writing correct programs. * Off-by-one and the functional equivalents * Infinite loops in exception handling * not enough input validation; too much input validation * Reinventing bad versions of existing algorithms (Dijkstra's algorithm is a good example) and in general not enough research before implementation. * The other side of that coin is taking stack overflow upvoted answers as gospel (basically our equivalent of trusting the calculator) * Fundamental incomprehension of boolean algebra, which gives rise to all sorts of errors: incorrect paren placement Obscenely complicated conditions and/or absurd if conditions because they don't understand boolean algebra (e.g. I've seen conditions that eventually simplify to a || !a) Complicated programs and grandois bug-hunting because they couldn't figure how a simple boolean expression (there was a post on HN a while back about Javascript == vs === where the developer basically wasted a day going down a rabbit hole he attributed to == vs === but was actually completely avoidable if he had taken an undergraduate discrete math course that hammered home boolean algebra.) * This page contains a very useful implementation details section which describes some common errors implementing quicksort: http://algs4.cs.princeton.edu/23quicksort/ http://algs4.cs.princeton.edu/23quicksort/ * As a general rule, any program written by a student containing concurrency is always wrong, unless concurrency was explicitly taught (many schools just have a short unit in a course or two, instead of integrating the topic throughout the curriculum).