This is an archived, read-only copy of the United-TI subforum , including posts and topic from May 2003 to April 2012. If you would like to discuss any of the topics in this forum, you can visit Cemetech's Technology & Calculator Open Topic subforum. Some of these topics may also be directly-linked to active Cemetech topics. If you are a Cemetech member with a linked United-TI account, you can link United-TI topics here with your current Cemetech topics.

This forum is locked: you cannot post, reply to, or edit topics. Math and Science => Technology & Calculator Open Topic
Author Message
luby
I want to go back to Philmont!!


Calc Guru


Joined: 23 Apr 2006
Posts: 1477

Posted: 28 Sep 2006 07:37:48 pm    Post subject:

There's this algorithem here about if a teacher allows you to drop 1(or more) test grade in order to maximized your grade. This is supposed to let you do that. I cannot understand it, as i do not get the complex math stuff. If i could get it explained in english i might be able to program it.
thanks.
Back to top
DarkerLine
ceci n'est pas une |


Super Elite (Last Title)


Joined: 04 Nov 2003
Posts: 8328

Posted: 28 Sep 2006 08:13:28 pm    Post subject:

This is actually very theoretical; for practical purposes, a teacher will drop grades that all have the same weight (in most cases) and in the few cases where they don't, brute force works because there aren't too many grades being dropped. However, the problem itself is interesting.

I'm also afraid the paper is as simple an explanation as you're likely to get. There are two steps to solving this problem:

1. Find an efficient way to calculate some function F(q) where q is a number 0 to 1. Don't worry about what it means, but we calculate it as follows:
a. Calculate fj(q) = (Points Earned) - q*(Points Possible) for each individual assignment.
b. Find the (# of assignments not dropped) of assignments for which this value fj(q) is maximized.
c. Add up the fj(q) for all of these assignments. This is F(q).

2. Use Newton's Method to find the zero of F(q). The paper shows that this will give us the answer; for now, just take this for granted.

a. The formula for Newton's method, we know, is xn+1 = xn - F(xn)/F'(xn). We need to find a way to find a derivative of F.

b. Fortunately, F is piecewise linear. That means if we take values q' that are close to q, F will be straight between q and q' and we just find the slope between these two points.

c. How close is close enough? The paper shows that at slope changes, the denominator of q is at most (# of assignments not dropped)*(maximum points possible for any assignment). We need to square this denominator's reciprocal to get the number we can safely add to q to get q'.

Now we just iterate until we find a q for which F(q) is 0. Then we take the optimal assignments found in step 1 for this q, and these will be the assignments we don't drop.


Last edited by Guest on 28 Sep 2006 08:13:59 pm; edited 1 time in total
Back to top
Display posts from previous:   
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.

» Go to Registration page
    »
» View previous topic :: View next topic  
Page 1 of 1 » All times are UTC - 5 Hours

 

Advertisement