T.R | Title | User | Personal Name | Date | Lines |
---|
1600.1 | additional help big O contest | KYOA::PEREZ | Welcome to My Nightmare | Sun Apr 26 1992 15:29 | 10 |
|
Additional help,
If you would like to beat the rush, send vaxmail and specify which
problem you have the answers to. On a first come basis , i will call
back, and if correct you will be paid.
good luck,
tony
|
1600.2 | smells like homework to me | 3D::ROTH | Geometry is the real life! | Mon Apr 27 1992 08:37 | 0 |
1600.3 | | WONDER::COYLE | | Mon Apr 27 1992 09:56 | 5 |
| RE .2
Or maybe at the end of a semester a take home exam?
-Joe
|
1600.4 | | TRACE::GILBERT | Ownership Obligates | Mon Apr 27 1992 13:53 | 21 |
1600.5 | I got an A anyway!!! | KYOA::PEREZ | Welcome to My Nightmare | Mon Apr 27 1992 23:27 | 22 |
|
Ok ok ..... I guess if i didn't offer money i would have gotten
responses anyway. But how do you know if other notes have been entered
for homework or exam requests ???
I think i was cut off a bit early here based on over-reactive
suspicious minds.
I don't beleive that i should have to explain my motives when asking
for some good old fashion help ESPECIALLY if i am paying for it.
For the hard record, these were not homework or exam questions! Not
that its anyones business.
So for the time it took some of you to read, think , and reply you
could have just answered the questions (like most helpful noters)
and took my money. And some offline responses may have done just that.
thanks for the fatherly concerns,
tony (who got an A on the mistery final)
|
1600.6 | | CREATV::QUODLING | Ken, Me, and a cast of extras... | Tue Apr 28 1992 07:59 | 11 |
| It's not homework or exams but you got an A, care to elaborate?
Re suspicious minds. And what would you think if someone came up to you
and offered you money for quick answers to basic math problems...
Irrespective of whether you are paying for a service or not.
Professional and personal ethics would require that most people be
given adequate assurance that they are not assisting you to cheat on an
exam.
q
|
1600.7 | | 3D::ROTH | Geometry is the real life! | Tue Apr 28 1992 08:08 | 5 |
| If someone tells me they're doing a take home exam and want help
that is fine, and I've helped people with their homework. But
being offered cash for something like that really turns me off.
- Jim
|
1600.8 | Lets quit now. | KYOA::PEREZ | Welcome to My Nightmare | Tue Apr 28 1992 20:19 | 15 |
|
I'm always the one who reads these kind of notes and gets mad because
they are a waste of everyones time, So how about we forget the whole
thing. I was just looking for some simple answers not analysis and
felt that if you were unsure about giving possible exam or homework
answers you should just skip to the next note.
So lets cut this one off. I believe that the moderator may want to
delete this entirely or better to unset hidden 1600.4 which has the
answers that may be helpful to someone in the future.
Sorry for the inconvenience.
thanks,
tony
|
1600.9 | | AUSSIE::GARSON | | Tue Apr 28 1992 20:20 | 13 |
| re .various
And furthermore when .0 contains wording like
> I need to get the answers to the following problems by 3pm or so on
> Monday 4/27/92.
a certain amount of suspicion is justified. I mean to say! When was the
last time you had to solve such life-threatening problems by some
deadline except as part of a course of study, exam, etc.
Just for (my) interest would someone care to define big O (in the
context of mathematics, I mean (-:)?
|
1600.10 | | BEING::EDP | Always mount a scratch monkey. | Wed Apr 29 1992 08:50 | 13 |
| Re .9:
To say f(x) is O(g(x)) means the function f is on the order of g(x). I
think the definition is that f is O(g) if there exist finite numbers M
and c such that f(x) < c*g(x) for all x > M. You might need absolute
values in there, depending on the domains being used. E.g., abs(f(x))
< abs(c*g(x)).
Thus x^2+2x+3 is on the order of x^2. This order expresses how quickly
the function increases.
-- edp
|
1600.11 | | BEING::EDP | Always mount a scratch monkey. | Wed Apr 29 1992 08:53 | 9 |
| At the dinner last month, Stan said he used to rule this conference
with an iron hand. I have given some slack here, but the author of .0
still has not explained their note. I would prefer not to see such
notes posted in the future.
This is the Math conference, and discussion should be about math.
-- edp
|
1600.12 | on big O | STAR::ABBASI | i^(-i) = SQRT(exp(PI)) | Wed Apr 29 1992 09:40 | 16 |
| >I think the definition is that f is O(g) if there exist finite numbers M
>and c such that f(x) < c*g(x) for all x > M. You might need absolute
i think the defintion should be applied for all x, i.e no need for the M.
i.e if there is a C, s.t. |f(n)| <= c *|g(x)| for all x, then
f(x) = O(g(x))
some big O rules:
1. f(x) = O(f(x))
2. O(f(x) g(x))= f(x) O g(x)
3. O(f(x)) O(g(x)) = O(f(x) g(x))
4. K O(f(x))= O(f(x))
4. O(O(f(x)))= O(f(x))
/nasser
|
1600.13 | X-range has to be specified | HERON::BLOMBERG | Trapped inside the universe | Wed Apr 29 1992 11:56 | 3 |
|
No, not for all x. The x-range has to be specified in each case,
e.g., f(x) = O(g(x)) when x->x0 (or whatever) if ...
|
1600.14 | | TOOK::ALEX | Alex Allister | Mon May 04 1992 11:23 | 11 |
| re .12:
> i think the defintion should be applied for all x, i.e no need for the M.
> i.e if there is a C, s.t. |f(n)| <= c *|g(x)| for all x, then
> f(x) = O(g(x))
You really do need the M. E.g., 1 = O(x) by using c = 1 and M = 1.
Otherwise, for x = 0 you get 1 <= 0, which is false.
Alex
|