For Wednesday April 30th - Final Exam
In addition to the story cards for i4 I'd like you to complete the two items I asked about recently in an email:
I'd like to run the same scripts that the gprof group did the other day, could someone document how to do that in the wiki?
Similarly it would be nice to have a page that documents how to use the tests being built in autonomy/src/tests.
Lastly please check the wiki to be certain the the building, running, testing documentation is accurate and complete.
For Sunday April 27th
For Saturday April 26th
For Tuesday April 22nd
In a separate document describe what, in terms of the principle calls and data structures, each of the following entails:
Bring a printout of both parts to class on Tuesday.
Will, Fitz, and Aaron - Create the ADL scripts and driver necessary to automate the process of running Autonomy with the following behavior:
The driver should ensure that Autonomy runs long enough that all the drones which could mine an asteroid have, and at least some have returned to the base station.
Run Autonomy built with gcc -O0 under gprof using that scenario, where is it spending most of the time? Repeat with gcc -O3, what changed?
Bring the two reports from gprof and a short write-up of what you observed to class on Tuesday.
Maduna, DylanP, Matt, Nathan - Group defect fixing tour. Like before, 6 each for a total of 24. Make sure that you work together a significant portion of the time. Use defect as the type within trac so they can be identified.
In class on Tuesday be prepared to discuss group defect fixing compared to doing it on your own, pros and cons.
For Sunday April 20th
For Friday April 18th
For each defect you fix a test should be created. Document the name of the test in the defect's trac entry. Note the mechanism I described in email for how I look for the defects within trac and make sure yours appear as they should.
Bonus points for finding and entering new defects in addition to the assignment.
Reflect on your experience, what tools/facilities/information would have made understanding the problem and then fixing the source easier? Come to class with at least one concrete suggestion for improving the Autonomy debugging process.
Nota Bene: If you completed this when it was originally assigned you can fix additional bugs for extra credit. If you didn't, please do so now.
For Tuesday April 15th
For each defect you fix a test should be created. Document the name of the test in the defect's trac entry.
Bonus points for finding and entering new defects in addition to the assignment.
Reflect on your experience, what tools/facilities/information would have made understanding the problem and then fixing the source easier? Come to class with at least one concrete suggestion for improving the Autonomy debugging process.
For Friday April 11th
For Tuesday April 8th
For Sunday April 6th
For Friday April 4th
For Tuesday April 1st
Each of you should contribute to this effort, whether it's being the original author of prose, and/or a proof-reader, and/or an organizer.
Send me an email when this is ready for review, I'd like to have it before 8p on Monday so I can look at it before class on Tuesday.
For Friday March 28th
For Friday March 14th
Iteration 2 of the game project due at 8p EST. Please send me a pointer to the static binary and instructions for installation and use.
For Tuesday March 11th
Read chapter 6, Testing, in TPOP. Be prepared to discuss how you are structuring, using, and automating the test harness for the game.
For Friday March 7th
For Tuesday March 4th
For Friday February 29th
Review and edit the list of Story Cards on the game project wiki. Decorate each of them with an ideal number of hours. This will permit us to sort them into Iteration 1 and Iteration Future during class on Friday.
For Tuesday February 26th
For Tuesday February 19th
For Friday February 15th
Add a second sorting algorithm to your program, any of the n(log(n)) sorts will do. You can implement it yourself or copy it from elsewhere.
Instrument your code so that both of your sorting algorithms keep track of the number of compares and exchanges they do.
Add the ability to process commandline arguments to your sorting program using getopt(). Plumb it so that you can specify which of the two sorting algorithms to use and a verbose option. When verbose is enabled your program should print a summary which includes:
Bring a printout of the code and a typescript showing runs from 100 items using each of the two sorting algorithms with verbose enabled.
For Tuesday February 12th
You should do this independently. Come to class prepared to demonstrate your work for us. We'll discuss how to turn it in then.
The more I read and think about which space to work in I'm drawn to the notion of going with what we know, that is computer science. I think this is just a reflection of the importance of the disciplinary scientist to science-based educational game design. Since we're collectively closer to being computer scientists than anything else maybe we should look closely at that space for ideas.
For Friday February 8th
time to capture the wall time.
If you need a pointer to how to easily generate random integers send email to the class list.
Write-up a short document (2-4 paragraphs and lists) that covers all of the following:
Be prepared to copy/paste your prose into the class wiki in class on Friday. You can find my write-up on the wiki page for this class, http://wiki.cs.earlham.edu/index.php/Cs345-2008.
For Tuesday February 5th
To turn this in bring a printout of your text file to class. Send a tarball of the full kit to me via email before class on Tuesday.
For Friday February 1st
For Tuesday January 29th
For Friday January 25th
There are 13 (short) chapters to read, the first is titled The Cathedral and the Bazaar, the last is Epilog: Netscape Embraces the Bazaar.
For Tuesday January 22nd
For Friday January 18th
For Tuesday January 15th