News for hackers. Stuff that matters.
Re:The software development final exam: Algorithms and Data ... by gargleblaster on Monday October 08, 2012 @08:06AM (#4626449)
I think that question 1 is not well formulated (unless that is the answer he expects). Equality makes only very limited sense for asymptotic notation.
Re:The software development final exam: Algorithms and Data ... by crntaylor on Monday October 08, 2012 @08:21AM (#4626494)
It is perfectly well formulated. The notation O(f(n)) denotes a set of functions. The question is asking if the two sets O(2^n) and O(3^n) are the same set.
Re:The software development final exam: Algorithms and Data ... by nandemo on Monday October 08, 2012 @12:08PM (#4627483)
That's right. Some people get confused due to the rather unfortunate convention of writing f(n) = O(n) instead of the correct f(n) ∈ O(n).
Re:The software development final exam: Algorithms and Data ... by alexkus on Monday October 08, 2012 @08:28AM (#4626520)
I think the OP is looking for a bit more of an answer than a simple Yes/No.
Re:The software development final exam: Algorithms and Data ... by anonymouz on Monday October 08, 2012 @09:15AM (#4626678)
He is also asking "Why?", i.e., for a proof[1] to back up your Yes/No answer. Seems like a perfectly good question.

[1] Calculation, if you prefer.

Re:The software development final exam: Algorithms and Data ... by oggy on Monday October 08, 2012 @08:30AM (#4626524)
It's a perfectly sensible question. Knowing that both O(2^n) and O(3^n) are sets, and using the definition of set equality, it asks whether "f in O(2^n)" implies "f in O(3^n)", and vice versa. Only one of the implications holds...