I’ve been porting exercises to powershell for over a month now with the help of @Meatball . As soon as we got the short list I will prioritize those for october.
Yeah and @glaxxie have created some more exercises, so to the list for PowerShell could the following exercises:
Simple Cipher
Meet up
Change
I will likely do grade school or list ops for Crystal this weekend (dependent on if Ryan comes before me on one of them), and there will likely be an addition of around 4 exercises for Crystal but not sure which ones yet.
I also want to add to the pool of suggestion:
Rational numbers, Complex numbers, Custom set
Good candidates for OOP with the addition of overloading operators
Hi! Pharo contributor here. If you encounter some of the exercises seen as must for OOP October, please write it down! Pharo has biggest gaps in terms of implemented exercises, but we’ll (with Glenn J. ) try to support them ASAP.
I think clock, rational-numbers, complex-numbers and custom-set are somewhat similar, in that they are small wrappers and usually require operator overloading. Of those, I think clock is the best option, as it is the easiest to understand and the least mathy.
I like these two options, my only concern being that they’re somewhat harder exercises, and we usually try to select relatively easy ones.
A very prototypical OO exercise, my only worry being that for some tracks (including C#) it will introduce concurrency (issues), which makes things a bit more complex.
I quite like this one, but unfortunately we’ve already used it for Functional February.
I like this option a lot, as you’ll have to do something with constructors/
Do these exercises require a proper OO solution? I think they’re more algorithmic in nature.
Regarding powershell track for these chosen exercises:
Clock : done.
Matrix : done, however it isn’t in OOP style, @meatball authored this, but I can redo it. But idk much about protocol of redoing a whole exercise that already published so i leave the decision to you guys.
Simple cipher : i’m PRing it atm, but i didn’t design it as oop, so i can pull it down now and make the changes.
Circular buffer: not yet, next on the list
Binary search tree : practically done, just need to add test cases
A question regarding implementing binary search tree : would it be ok if i add more tests for extra functionalities? Atm, the specs only ask for comparison between the tree, and sorted data (inorder), but i want to ask learner to implement : preorder, postorder, search (maybe even deletion but it is probably too much)
I’d say that’s OK, the example solution is just to prove the problem can be solved. I’d think that students might be encouraged to solve it in a OO style.
I think some extra functionality is good. I wouldn’t go overboard with it. If something is particularly tricky, you should definitely make it optional (meaning: not solving it does not influence the test results)