For all those taking CS at waterloo...

Dan — Thu, 10 Dec 2009 16:03:16 GMT

Hahahaha you better like recursion, no LOVE recursion. And brackets. Lots of brackets.

Well then....

Mei Sum — Sat, 01 Aug 2009 22:15:56 GMT

Where was this section a year ago??

Having Trouble opening the CASCON "CodeSpy" Contest

Jamie(); — Sat, 19 Sep 2009 02:14:24 GMT

IBM has come out with a new contest this year for 2009! Just like last year, we are already having trouble downloading and getting it to work. So far, I found out how to actually get the files: you have to follow thier instructions and instead of simply downloading the .jar files, you need to create a .xml file in eclipse and get it to download (!?). The files will download, and I should be prompted to restart eclipse, but I'm not, and when I do it still has no effect. This is strange, especially ...

CASCON 2009

Jamie(); — Wed, 28 Oct 2009 21:13:43 GMT

Ok. So, CodeSpy is a little buggy, so they have officially changed the contest to CodeRally, which you can download at https://www-927.ibm.com/ibm/cas/hspc/hspc2009.shtml. CodeSpy will be next year's competition, so if you want to start playing with that, we can do really well next year. With the glitch before: make sure that you copy over the "license" folder for CodeRally as well. (For some reason, CodeSpy also works after copying over this folder).

Mars' Profile

mars — Wed, 27 Aug 2008 23:01:31 GMT

Name: Andy C. Grade: 12 Birthday: classified Primary Interest: Space Exploration Favorite Video Game: Starcraft Favorite Sports: Soccer, Swimming, Table Tennis, Cycling Favorite TV Show: Mayday Favorite Quotation: You see things and ask why; I imagine things and ask why not. Recommended Websites: RASA RHHS Engineering

Alex I think I saw you today

Mei Sum — Tue, 06 Oct 2009 02:32:18 GMT

You might have said hi but I was late for class and wasn't really paying attention.

Hi!

Unless it wasn't you, in which I take it back.

James' Profile

Jamie(); — Sat, 06 Sep 2008 15:39:24 GMT

Name: Jamie Langille
Grade: 10
Birthday: May 4, 1993
Favorite Sports: Soccer, Cycling, Karate, Scuba Diving, Skiing
Teams/Clubs: Silver Band, Math Club (hopefully), Computer Science club(hopefully)
Favorite TV Shows: Doctor Who, CSI-type shows

Thamoron's Profile

thamoron — Wed, 10 Sep 2008 01:42:31 GMT

Name: Kevin C.
Grade: 10
Favorite VG: Red Alert Franchise
I not say anything else.

This forum is #1 on Google for "RHHS Computer Science Club"
That's how I actually found the forum...

a13x's Profile

a13x — Thu, 11 Sep 2008 22:29:38 GMT

hi i'm a13x. please don't point out which one though.

Dan's Profile

Dan — Wed, 27 Aug 2008 22:54:51 GMT

Name: Dan D.
Grade: 12
Birthday: October 8th 1991
Favorite Video Game: Warcraft 3
Favorite Sports: Soccer, Tennis

Having Trouble Opening the CASCON "I have a Code" Contest

Dan — Fri, 12 Sep 2008 04:53:04 GMT

https://www-927.ibm.com/ibm/cas/cascon/hspc/index.html "2. Unzip the file into the [Eclipse install dir]/eclipse directory, where [Eclipse install dir] is the directory in which Eclipse is installed. This action should create one or more files with names such as [Eclipse install dir]/eclipse/plugins/com.ibm.games*.jar." I don't get any such files : <. Anyone else having this problem or know how I messed this up?

Eddie's Profile

Eddie — Wed, 27 Aug 2008 23:47:28 GMT

Name: Eddie Du
Grade: 12
Birthday: Feb 25, 1990 (yes, i will be 19 when i graduate)
Interests: sports, music, interesting problems

November 14th Subset Sums

Eddie — Sat, 15 Nov 2008 03:16:48 GMT

Subset Sums JRM For many sets of consecutive integers from 1 through N (1 <= N <= 39), one can partition the set into two sets whose sums are identical. For example, if N=3, one can partition the set {1, 2, 3} in one way so that the sums of both subsets are identical: * {3} and {1,2} This counts as a single partitioning (i.e., reversing the order counts as the same partitioning and thus does not increase the count of partitions). If N=7, there are four ways ...

[CONTEST] Official "CASCON I Have a Code" discussion

Eddie — Sat, 13 Sep 2008 15:39:19 GMT

CASCON I Have A Code Wednesday, October 29, 2008 8:30 am to 4:00 pm This is a fairly entertaining contest. It's similar to robocode if you have done that before. Basically, you write an AI to take over the entire map with your cells. Your cells start as stem cells, and later can specialize into attacking cells, defending cells, growing cells, etc. You earn points by occupying space or killing others. There are up to 4 other colonies of cells (other AIs) in the same map battling you, and ...

November 6th - 0/1 Knapsack Algorithm, Stack of Blocks Problem

Dan — Fri, 07 Nov 2008 01:22:01 GMT

Example 2D Solution Matrix: Max Weight = 5 Size of the Array = [Max Weight][Number Of Items] 0 0 0 0 0 0 0 1 1 1 0 0 1 7 7 0 0 1 7 9 The optimum value can be found in the bottom right corner of the array. To find the value of entry (k, item index) if (k < weight) value of entry = value of entry directly above else if (k==weight) value of entry = max(value above this entry, value of the item being examined) else if (k>weight) value of entry = max(value ...

October 30th - Snail Trail

Eddie — Thu, 30 Oct 2008 23:55:11 GMT

Snail Trail Sally Snail likes to stroll on a N x N square grid (1

October 16th - Mud Path Problem, Mine Field Problem

Dan — Fri, 17 Oct 2008 03:14:17 GMT

Mud Path Problem In front of you there is a path of squares and a bundle of wooden planks. Each square either contains a patch of grass or mud. You want to cover all of the patches of mud so people can walk across without getting dirty while minimizing the amount of grass patches covered by the planks (if grass is covered by a plank it won�t get any sun and will die). Your task is to cover all the patches of mud while minimizing the number of grass patches you cover. Given the maximum number ...

September 18th - Card Problem, Largest Sum Problem

Dan — Thu, 18 Sep 2008 22:00:49 GMT

Card Problem Write a program to calculate the number of all possible 5 card playing-card hands (4 suits, 13 values) with no hand being counted more than once (i.e. Jack of Clubs, 4 of Diamonds, 3 of Spades, 2 of Hearts, King of Hearts is the same as 3 of Spades, 2 of Hearts, King of Hearts, Jack of Clubs, 4 of diamonds, so only one of these hands should be counted). Number of Possible Hands: 2,598,960 Largest Sum Problem Write an efficient program that given a two dimensional array, ...

Welcome to the 2008-2009 School Year!

Eddie — Wed, 27 Aug 2008 19:37:29 GMT

School starts on Sept 3rd for everyone. Everyone, especially the Gr. 12s, you better get ready to work your bumbums off this year, and of course, have a lot of fun

Also, welcome to the Computer Science Club! I'm sure you will find your experience here profusely rewarding.

See you in school!