Laws of Computer Science

Laws of Computer Science

 * 1) No attempt on any project sooner than the third may succeed. This is known as the Try3 phenomenon. Earlier attempts, Try1 and Try2, always fail, and generally involve switch statements, when written in Java. Try3 contains better coding practice and polymorphism.
 * 2) TEXT IN CLASS AND DIE . . . No, really, don't even try it. There is an ongoing debate on whether this is a logical or arithmetic AND, but the Cult of the VanDruids adheres to the arithmetic definition and strictly prohibits the use of cellphones in class.
 * 3) Law 7 is not to be followed under any circumstances.
 * 4) Detect and eliminate all orphans.
 * 5) There is no such thing as a good switch statement.
 * 6) If at first you don't succeed, use a finally block.
 * 7)  Law 3 must be obeyed at all times.
 * 8) All CS majors must attend CS dinners, at 5pm in the Stupe.
 * 9) If you think your program is flawless, Cheney can find the one thing that will break it.
 * 10) Tim must be a member of the CSC. If there is no one named Tim currently in the CSC, a member of the club shall henceforth be known as newTim.
 * 11)  NEVER USE GETS!! 
 * 12) It is perfectly acceptable to implement a PDA in class; in fact, you may be asked to do so by a professor.