If it is something to use in an educational setting, even a non-traditional one it would likely be welcome. You can also write it up first on our sandbox area and get some feedback before it goes live.
It will then "magically" show up here in a few minutes. Ordinary CS might be better than SO, I think, but here would likely work out.
Also, the ACM SIGCSE has a mailing list for members that would likely be a good source for resources. Some of the members here are also members there, but I think not many.
The point of this resource is to avoid having to reinvent the wheel every single time you try to make a programming exercise and want to test potential solutions automatically. E.g., every time you write a programming exercise whose solution is intended to use Dijkstra, you can fit the collection of graphs into the correct specification, without having to think of possible problems anew and anew. However, it's not so much for use in the classroom as it is for use in programming contests.
(Of course these things need not be mutually exclusive.)
Err, and to really get at the purpose of my question: I'm thinking of creating a resource like that (with a few others), but wouldn't need to if it already existed (or it would give me something to build on).
to answer your earlier question, my classes are algebra II, spanish II, honors english I, whatever standard social studies class, physical science, intro to engineering, and health/p.e.
@BenI. yeah, the math's pretty easy. it's all pretty much review. the teacher brought in some finite mathematics textbooks that me and a friend are working through, which is fun - the simplex method is cool, for instance. engineering is probably my favorite.
okay, so let's say i have a problem like: i have 10 hours of metal working labor time, 10 hours of wood working labor time, toy trains take 1/2 hr of metal working time and toy trucks take 1/4 hr of wood working time; i get $10 profit for a toy train and $5 for a toy truck; how many of each should i make to maximize profit.
if i assign the variable x for # of toy trains and y for # of toy trucks
i can do the following inequalities:
1/4y <= 10, 1/2x <= 10, x >= 0, y >= 0
and the function:
f(x, y) = 10x + 5y
basically, i want to figure out how to still satisfy the constraints (inequalities), i.e., be in the "valid region", but still maximize the value of the function.
is this making sense so far? I'm bad at explaining things.
so, each point a pair of inequalities intersect is a vertex, and these vertices define the "corner" points - they're the only values we need to plug into the function.
so i can solve each pair of inequalities for those vertices, plug it into the function, and figure out which values maximize the function, and i've got my answer.
well, what i mean by intersect is, if i graph those inequalities
i'm going to basically have the x and y axes, two other functions, and a shaded region in the middle that's defined by the "corners" - the spots where the functions intersect with the x and y axes, and the origin.
@BenI. one of your inequalities. ditto for the blue and green lines.
the simplex method, to oversimplify, is basically writing all the coefficients of your function/inequalities in a matrix and then using row operations to find the optimal solution. i'm still learning it so i don't know if i can describe it much better than that right now.
(I suspect that your explanation is about as much as I wanted to get out of this right now anyway)
Thank you!
With @HenryWHHackv2.1 here, heather, and Buffy, it feels a bit like it used to :) Now we need @ItamarG3 and one or two others to be totally back.
Oh, and we need a random argument to break out. Probably with @thesecretmaster as the bad guy, and Heather to defend him. (Because, at the end of the day, he's really right.)