| Line 36: | Line 36: | ||
=== Discussions === | === Discussions === | ||
| + | |||
| + | Assertion made in lecture 3: | ||
| + | * "The base of a logarithm does not matter asymptotically" | ||
| + | * So does that mean that given a set of log functions with different bases, we cannot say that one grows faster than the other? | ||
Area to post questions, set up study groups, etc. | Area to post questions, set up study groups, etc. | ||
Revision as of 13:15, 21 January 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
Assertion made in lecture 3:
- "The base of a logarithm does not matter asymptotically"
* So does that mean that given a set of log functions with different bases, we cannot say that one grows faster than the other?
Area to post questions, set up study groups, etc.
