| Line 50: | Line 50: | ||
* Second level: <math>9\frac{\frac{n}{3}+5}{4}</math> | * Second level: <math>9\frac{\frac{n}{3}+5}{4}</math> | ||
* i<sup>th</sup> level: <math>\left(\frac{3}{2}\right)^i\left(\frac{n}{3}+5\right)</math> | * i<sup>th</sup> level: <math>\left(\frac{3}{2}\right)^i\left(\frac{n}{3}+5\right)</math> | ||
| + | |||
| + | <i>Note:</i> above is not correct | ||
<math>\left(\frac{n}{3}+5\right)\sum{\left(\frac{3}{2}\right)^i}</math> | <math>\left(\frac{n}{3}+5\right)\sum{\left(\frac{3}{2}\right)^i}</math> | ||
Revision as of 19:21, 14 February 2009
Contents
Rhea Section for ECE 608 Professor Ghafoor, Spring 2009
If you create a page that belongs to this course, please write
[[Category:ECE608Spring2009ghafoor]]
at the top of the page. You may also add any other category you feel is appropriate (e.g., "homework", "Fourier", etc.).
ECE 608 professor Ghafoor Spring 2009
TA
Hamza Bin Sohail Office Hours: Tuesday & Thursday 4:30-5:30PM in EE306
Course Website
http://cobweb.ecn.purdue.edu/~ee608/
Newsgroup
On the news.purdue.edu server: purdue.class.ece608
One way to access: SSH to a server at Purdue (ie expert.ics.purdue.edu) and type "lynx news.purdue.edu/purdue.class.ece608"
On Ubuntu, you can use the "Pan" newsreader.
- "sudo apt-get install pan"
- Set "news.purdue.edu" as the server. You do not need to enter login information.
- Type "purdue.class.ece608" in the box in the upper-left of the screen.
- After a delay (half a minute?) the newsgroup will appear in the left pane. You can right click the group to "subscribe".
Reviewed Algorithms
Discussions
Area to post questions, set up study groups, etc.
4-4
Attempted solution for 4-4 part (d): $ T(n) = 3T(n/3+5)+n/2 $
We use the iteration method. Start with recursion tree:
- Root node: $ \frac{n}{2} $
- First level: $ 3\frac{\frac{n}{3}+5}{2} $
- Second level: $ 9\frac{\frac{n}{3}+5}{4} $
- ith level: $ \left(\frac{3}{2}\right)^i\left(\frac{n}{3}+5\right) $
Note: above is not correct
$ \left(\frac{n}{3}+5\right)\sum{\left(\frac{3}{2}\right)^i} $
Randomization (and prob 5.3-3)
An experiment with the erroneous randomization algorithm: False randomize
In the solution given for this problem, their argument is that $ n^n $ is not a multiple of $ n! $ for $ n\ge 3 $. Intuitively, $ n! $ for $ n\ge 3 $ includes more than one prime factor, namely 2 and 3, whereas $ n^n $ of course has only one.
