You are not logged in.
Pages: 1
Hi;
Do you see example 8, entitled average case complexity of the linear search algorithm?
Yes,
The calculation they use.. it makes a bunch of assumptions.. they are based on prior proofs..
Hi;
For the 2nd problem I am getting
also.
I have sheets and sheets of paper -- but I am not getting close
I do not know about the 7th edition but the 6th edition has the answer to this problem just a few pages away!
I'm not understanding their examples.. I had to find help on Bayes' from youtube -- book does not even mention using a tree to simplify things..
Final is cumulative - no notes/calc anything .. there is just a vast amount of material. This last chaper (7) was basically assigned to us for finals week.. which means that we didn't really cover it.
Hi Festisio;
Discrete Math and its Applications?
Yes, that's correct.
McGraw has the 6th ed online here: http://highered.mcgraw-hill.com/sites/dl/free/0070648247/510610/Chapter_06_Discrete_Probability.pdf
It is page 440 #9 on there I don't know if they have the matching solutions.. but I am using the 7th edition..
Well, for the second problem, the book is wrong.
It would not be the first time -- it is Prob 7.4 #9 from Discrete Math (rosen 7th ed)
For the birthday problem -- the book answer is 614 (book assumes 366 days a year)
I want to understand how to complete the problem.. the basic birthday concept, no prob -- but this variation is a little tough.
For the other problem, the book answer is
I have sheets and sheets of paper -- but I am not getting close -- I hate looking at the answer first, because I try to understand the concepts of obtaining them.. in these cases I could not find them
There again, I have been studying for 3 finals, which are tonight, and two more tomorrow, so I may be a little tired and missing things.
Pages: 1