hiltgenius.blogg.se - Scrolling world greenfoot source code

#Scrolling world greenfoot source code how to
#Scrolling world greenfoot source code download

10% of 50 (by dividing 10 by 2 or dividing 50 by 10).

We looked at percentage of a number recently and students could find their own strategies for dealing with simple cases like: This year I have been working with the idea of equivalence since September with the hope that students will develop better number sense and become familiar with equivalence as it becomes more abstract later on (ex. In fact, they may never revisit the topic again once taught. Basically we work with numbers a lot. Unfortunately students tend to think of these representations as being different rather than equivalent because they are taught in separate sections of a textbook and likely different units during the school year. In grade 8 we work with fractions, decimals, percentages, and ratios. Posted in Education | Leave a reply EquivalenceĮquivalence is one of the big ideas in Mathematics. I feel like some feedback on the lab itself might help improve it (reducing the number of questions in the tables or omitting them altogether). The “target” colors students were comparing their mixes against: It just doesn’t have the same punch when you try to explain as when they see it first hand. Students that lack understanding will typically come up with 14L (add 9L to both Red and Blue). How much blue paint should be added to 12L or red paint in order to produce the color?”

“Paint is mixed in a ratio 3 parts red : 5 parts blue.

What I liked about mixing the colors was students get to see how ratios maintain a proportion (otherwise the color does not match). The supplies list is attached in the word document above, but it cost less than $10 and most of it can be reused by our math department. I guess I got tired of reading about paint mixture problems in textbooks and decided this would be a lot more fun (and it was). This was a fun lab involving ratios that we did over the last couple of classes. When a student’s algorithm did not sort the data they are assigned a time of Integer.MAX_VALUE to place them in last. For example if three people finished 2nd the points would be 10 for 1st, 7 for 2nd, 7 for 3rd, 7 for 4th, and 6 for fifth, … The competition checks to see if data is sorted properly (it can be either ascending or descending). In a race with 10 competitors, 1st place gets 10 points, 2nd gets 9, 3rd gets 8, … In the event of a time, everyone in the tie gets the lowest amount of that group. Once the competition is finished just click the button to indicate what the next one will be and you’re ready to go again. Then hit the usual Greenfoot “play” button and watch the competition unfold. Click on the button at the bottom to determine which algorithm will run during the competition. When you compile the project it will start running immediately. To add your students to the competition they must load their classes into the project and add a new Object from their class to the loadCompetitors() method. public static final int SIZENLGN = 100000.Depending on the speed of your computer and number of competitors you will probably want to adjust these. There are two variables to control the size of the test data generated.

#Scrolling world greenfoot source code how to

You’ll probably do your own tinkering but here’s a few hints about how to setup the competition: Get your copy here (a Greenfoot project). I’m not promising it’s perfect, but it added the dramatic effect that had everyone staying in a lunch to watch the results. I built a skeleton project that looks a little cheesy but you can see visually who’s winning as each round completes.

#Scrolling world greenfoot source code download

Students have to implement an interface ( download it here) to “plug” into the competition. The wildcard sort would be with integers so students could learn about sorting algorithms that are not comparison based (Radix, Bucket, Counting, etc.), if they wanted to (not a requirement). Students were responsible to research 2 O(n^2) and 2 O(nlgn) sorting algorithms and 1 wildcard that could be anything they like.

I was very impressed by the work the class did to prepare. Today we concluded our unit on sorting algorithms in Computing Science 12.