| |
| |
| |
|
Page: 1 2 3 4 5 6 7 8 9 10
Comments:
<0> nimeni000, do you know what day it is?
<1> -b+-Sqrt(b^2-2ac)/4a?
<2> sunday
<1> I can't remember!
<1> ack
<0> :)
<1> I can't even remember what it's called?
<0> :)
<3> quadratic equation? :P
<2> ok so the height is 4.. got that..
<4> ooh, that formula..
<4> damn school was long ago..
<1> ohhh, so close.
<2> Strict binary tree, a binary tree where each node has 0 or 2 (never 1) child nodes (subtrees).
<5> hi threat :P
<2> hm, i guess it is
<0> acid_x, w00t!
<1> I need to go back to college
<5> ;)
<1> I feel like my mind is rotting
<0> acid_x, SPIES!!! EVERYWHERE!
<5> threat: LIES!
<1> I knew soooooo much math just a few years ago
<0> acid_x, THERE ARE AFTER ME!
<0> Noidea128, :)
<0> Noidea128, ditto
<3> x = ( -b +- sqrt( b^2 - 4ac ) ) / 2a, iirc
<5> threat: haha
<0> Kniht, ?
<0> acid_x, :P
<1> it's so sad to be forgetting all of that.
<0> acid_x, just because I am paranoid, doesn't mean they are not after me!
<1> so much knowledge, just going to waste.
<2> a binary tree is full, how many nodes can it have ? (5,7,8 or 9)
<0> Noidea128, what did you do to loose the knowledge?
<1> I graduated
<3> Noidea128: pfft, that's what calculators and algorithm tables are for, just re-derive what you forget :P
<1> and got a job.
<5> threat: guess we will have to wait and see
<0> nimeni000, depends on the height
<1> I have almost no use for all the math I learned
<0> Noidea128, :)
<1> all the calculus, and diff eq, and linear algebra
<0> Noidea128, well thats probably why you forgot, you didnt need it
<2> threat well it's just a one answer qeustion
<1> no need for the proofs
<1> or anything else I used to be able to do in my head
<0> nimeni000, I am sure it is, but you need to know all of the variables and such before you can answer it
<1> I don't feel bad when I forget other things, like the biology crap I took, or the other random gen eds
<1> but, the math
<2> oh it must be 7, root+2 nodes on the 2nd level + 4 on the 3rd
<0> Noidea128, :)
<1> that was the core for so much of the engineering
<1> and the physics
<0> Noidea128, what job are you into ?
<1> I'm a computer engineer
<1> design verification
<6> sounds boring
<6> is it?
<1> I hope my company goes public
<1> and I make a lot of money
<2> ok one more, what's the worst case scenario runtime for the Kruskal alorigthm applied to a complete graph with n nodes ?
<1> then I can go back to school for the rest of my life
<3> I don't think I'll ever need to know the kreb cycle again, that loss doesn't bother me
<1> and not forget all this important stuff I've worked so hard to learn.
<1> no, not really Cowmoo
<1> it's pretty interesting
<1> some part of it anyway
<6> oh ok
<6> heh, how long has it been since you graduated
<1> the random program generator I was doing at AMD was really neat
<2> kruskal algorithm anyone ?
<1> 4.5 years
<1> I've been out of college as long as I was in college now
<1> kind of
<0> Noidea128, nice
<1> I was actually enrolled in college 5 years
<0> Noidea128, can you juggle?
<6> I'm graduating in May and I'm worried I'll turn into a dumbo :(
<1> but I took an 8 month internship
<6> after getting a job, that is
<1> you will
<0> nimeni000, kruskal ?
<6> :'(
<1> your job won't require you to know any of the stuff you learned
<1> but, it will take up your whole day
<1> you'll come home and go on to doing leisure activities
<1> I'm a much better rock climber now than I was in college
<1> that's nice
<2> threat yep that's what it says here, worst case runtime for kruskal when u have a full graph with n nodes
<1> but, I don't like forgetting all my math.
<6> I know, I alreayd have an internship that gave me an offer, which I think I'll take
<0> Noidea128, lol
<6> bah
<0> nimeni000, I have no idea what you are on
<2> threat it asks me for the complexity of the algorithm when applied to a full graph
<0> nimeni000, big O notation?
<2> 1) O(n^2) 2) O(n*log2 n) 3) O(n^2*log2 n) YEs
<0> nimeni000, lol, I hate algorithms :) I have to do an algorithm subject this semester :S
<1> what is there to do at night?
<2> i have to do somebody's homework :/
<1> I wish there were more options
<6> nimeni000: are those your choices for your kruskal question?
<1> other than go to a bar
<1> or a pool hall
<2> Cowmoo yes
<7> Or order a pizza
<1> there should be some fun social things to do at night.
<7> And a whore
<0> Noidea128, I am bored too
<6> ok, answer is 2)
<0> Noidea128, I am thikning about having a game of ET :)
<1> Whores cost too much
<7> You could teleport to europe, it's not night here
<6> er, no
<6> ignore that
<0> Noidea128, funh social things to do on a Sunday night :L\
<2> no ? :/
<2> i thought about 3
<1> Saturday
<6> it's O(|E|log|E|), where E is the set of edges
<0> its Sunday here, 7:51 PM
<2> Cowmoo well i have nodes, not edges :]
<6> but I think |E| = n^2 for a complete graph?
<2> oh, but the graph is full
<2> so that means...
<2> yep !
<1> The climbing gym should be open later
<0> [playing] Chris Rock - My Favorite Joke [ ]1%, 93 kbps, 44 kHz, pos: 5630/5898 [Stereo]
<1> and they should start serving drinks after 9pm
<2> but i don't have n^2 * log n^2 just n^2 * log n
<0> nimeni000, ?
<6> right
<2> threat the possible answers
<2> 1) O(n^2) 2) O(n*log2 n) 3) O(n^2*log2 n) (kruskal on a full graph with n nodes)
<6> but that's your answer, I don't remember why that n^2 gets reduced to an n
<6> but your answer is 3)
<0> :\
<2> uhm, how do i figure out how many vertices does a minimum spanning tree have
<2> on a graph
<6> do you know what a minimum spanning tree is?
<2> i have no idea
<6> time to learn
<0> haha
<2> no time, i must deliver the answers in 30 mins
<6> or else what, you get shot?
<2> i'm doing somebody elses's homework
<6> are you doing the homework for a mafia boss or something?
<2> no he has an exam
<2> and has to learn all the answers
<1> and you're his g/f?
Return to
#c++
or
Go to some related
logs:
#javascript
catablue
php useradd userdel passwd
mag lt916s problems
unresolved token (0A00001D) extern C long __stdcall CoInitialize(void *)
#linux
#php
espanian gay
clubitup
Jerusalem Tulip
|
|