Ancient CS 61 Content Warning!!!!!1!!!
This is not the current version of the class.
This site was automatically translated from a wiki. The translation may have introduced mistakes (and the content might have been wrong to begin with).

As mentioned in Lecture 1, Prof. Chong has placed a binary highscore in his home directory ~stephenchong on nice.fas.harvard.edu. This program takes four integers on the command line, and produces a score. Try to get the highest score possible. Note: every positive score sends an email with your name, input, and score to Prof. Chong! Do not try brute force! To figure out what inputs you should provide to the program, you will need to disassemble the binary, and work out how the program computes a score from the four input numbers. More instructions and information is below.

The highest scores will be announced in class.

More detailed instructions

  1. If you don't already, get an account on nice.fas.harvard.edu.If you have a FAS email address, then you have access to nice. See http://www.fas-it.fas.harvard.edu/services/student/unix for more information.
  2. Log in to nice, for example, by running the command ssh YourUserName@nice.fas.harvard.edu.
  3. Change directory to Prof. Chong's home directory: cd ~stephenchong
  4. Try running the binary: ./highscore. Executing it with no command line arguments will give you a usage message.
  5. Try disassembling the binary, using either objdump or gdb. Look on the web or the Resources page for tutorials for using these tools. A first thing to try: run gdb highscore, and try typing list 1,100.
  6. Try getting the highest score you can! Remember, every positive score will send an email to Prof. Chong, so don't use brute force to find the highest possible score!