Forum: Computer Science Oct 5th, 2008 |
| Replies: 4 Views: 1,144 Nobody knows when a substitution should be used. Problem solving works by guessing what steps to do and seeing where it leads, and you can only get better at guessing with experience.
You should... |
Forum: Computer Science Oct 4th, 2008 |
| Replies: 2 Views: 1,430 The length of N is 1 + floor(log_2(N)). |
Forum: C++ Oct 4th, 2008 |
| Replies: 3 Views: 658 Okay. In that case, it makes sense the separate the linked-listy parts of your objects from the polynomial parts of your objects, so that you only have to worry about one part of the problem at a... |
Forum: C++ Oct 4th, 2008 |
| Replies: 3 Views: 658 You shouldn't roll your own linked lists. Use std::list or std::vector (since there's little reason for prefering linked lists). |
Forum: Legacy and Other Languages Oct 4th, 2008 |
| Replies: 1 Views: 2,436 OH GOD OH GOD OH GOD OH GOD OH GOD.
Now I remember why I got an HP-49G. |
Forum: Computer Science Oct 4th, 2008 |
| Replies: 4 Views: 1,144 You can always do a replacement that produces a bigger value, when finding a big O bound. For example, consider:
i = 1
while i < n {
for j in (0..i) {
print j
}
i = i * 2
} |
Forum: Computer Science Oct 1st, 2008 |
| Replies: 1 Views: 617 Whatever programming language you want. |
Forum: Computer Science Sep 29th, 2008 |
| Replies: 1 Views: 580 You can do this with Javascript (and HTML). |
Forum: IT Professionals' Lounge Sep 26th, 2008 |
| Replies: 12 Views: 1,796 All these long, self-indulgent answers when the first was sufficient. |
Forum: Computer Science Sep 25th, 2008 |
| Replies: 1 Views: 714 You should use whatever you're most familiar with. |
Forum: Computer Science Sep 25th, 2008 |
| Replies: 14 Views: 1,743 People won't want to waste their time giving help to somebody who won't put in a good effort in what they do -- so they think their help will be wasted. When you can't even put in the effort to... |
Forum: Computer Science Sep 25th, 2008 |
| Replies: 4 Views: 1,085 Your solution for the first is wrong. The inside of your inner loop is O(1), the outside of your inner loop is O(n^3), the inside of your outer loop is the same, O(n^3), and the outside of the outer... |
Forum: Computer Science Sep 24th, 2008 |
| Replies: 10 Views: 5,927 http://www.daniweb.com/tutorials/ |
Forum: Computer Science Sep 24th, 2008 |
| Replies: 10 Views: 5,927 php.net should be avoided. It is fully of buggy and security-hole ridden examples. No, I don't have an example of this, I don't feel like going back and looking them up again. |
Forum: IT Professionals' Lounge Sep 20th, 2008 |
| Replies: 6 Views: 1,372 UML is stupid and should be avoided. And definitely shouldn't be studied and studied and studied and studied and studied... |
Forum: Computer Science Sep 20th, 2008 |
| Replies: 5 Views: 1,070 And here are some naive answers.
1. Type checking proves properties about the code. The compiler proves your assertion that your function returns an int, or that it returns something whose type... |
Forum: Computer Science Sep 20th, 2008 |
| Replies: 5 Views: 2,698 Yeah, "using" induction to prove the correctness of an algorithm, ever so formally, is a hassle. Thinking inductively (I mean recursively) is less-so.
When you have an algorithm with recursive... |
Forum: Computer Science Sep 15th, 2008 |
| Replies: 4 Views: 1,085 You can probably find worst-case numbers though, using some comparisons to simpler equations. |
Forum: Computer Science Sep 13th, 2008 |
| Replies: 2 Views: 696 There isn't an easy way to do that in BNF, but maybe there is via one of its extensions. However, I'm pretty sure the mainstream extensions don't have that facility either. |
Forum: Computer Science Sep 13th, 2008 |
| Replies: 5 Views: 2,698 You assure that the algorithm works by proving it works. For recursive functions (and oftentimes, for things like while loops), you can prove the function works with the following sort of strategy:... |
Forum: IT Professionals' Lounge Sep 12th, 2008 |
| Replies: 5 Views: 1,286 Well we can't figure out your problem without seeing the code. |
Forum: Computer Science Sep 12th, 2008 |
| Replies: 4 Views: 1,916 The platform is the last thing you should choose. How can you know the appropriate platform before you've decided what you want to do? |
Forum: IT Professionals' Lounge Sep 7th, 2008 |
| Replies: 5 Views: 1,286 |
Forum: Computer Science Sep 4th, 2008 |
| Replies: 4 Views: 847 Your answer makes sense, in terms of stacking naive interpreters atop one another.
Your examples of levels are completely nonsensical though, justsoyouknow. "Binary numbers" is not a programming... |
Forum: Computer Science Sep 3rd, 2008 |
| Replies: 4 Views: 847 "Level"?
What is a "level"? This question makes no sense. |
Forum: Computer Science Aug 30th, 2008 |
| Replies: 4 Views: 1,961 Overloading is one thing, and polymorphism is another. Look at the definitions on the internet and then use thinking to figure how they are related and unrelated. |
Forum: C# Aug 30th, 2008 |
| Replies: 11 Views: 1,602 Who are you replying to? Since when did we start talking about multitasking? |
Forum: C# Aug 28th, 2008 |
| Replies: 11 Views: 1,602 I'm not sure what's wrong with running mono, any deficiencies will be in the mono documentation. |
Forum: C# Aug 28th, 2008 |
| Replies: 11 Views: 1,602 MSDN has information on having multiple threads in C#. It's fairly straightforward. |
Forum: IT Professionals' Lounge Aug 28th, 2008 |
| Replies: 8 Views: 1,373 The best video game is the playlist I have playing right now. Rachmaninov Op. 1, 18, 30, 40, and 43. The storyline can't be beat! |
Forum: Computer Science Aug 28th, 2008 |
| Replies: 1 Views: 473 You'll need to use Javascript for the behavior of the page to be based on the contents of the text box. Learn Javascript and HTML and use that information to solve your problem. |
Forum: Computer Science Aug 28th, 2008 |
| Replies: 1 Views: 519 If you can't figure out a basic idea of the definitions after reading books on the topic, I don't think reading some post in the forum will help you. |
Forum: Computer Science Aug 28th, 2008 |
| Replies: 4 Views: 990 This is not a computer science or software design question.
Anyway, Linux distributions generally have some norms for how packages are distributed and installed. So first you need to think about... |
Forum: Computer Science Aug 25th, 2008 |
| Replies: 9 Views: 1,782 Take undergrad classes in the subjects to figure out what you're interested in.
It should be easy to pick up whatever programming languages you need when you get to them. |
Forum: Geeks' Lounge Aug 23rd, 2008 |
| Replies: 44 Views: 3,951 |
Forum: C++ Aug 23rd, 2008 |
| Replies: 6 Views: 572 |
Forum: Computer Science Aug 22nd, 2008 |
| Replies: 1 Views: 1,440 There is no such thing as technical programming. Functional programming is the writing of software in a referentially transparent manner.
Front end developers develop the front end, whereas back... |
Forum: Geeks' Lounge Aug 22nd, 2008 |
| Replies: 44 Views: 3,951 I could make a wristwatch for them to wear that injects a sedative. |
Forum: Geeks' Lounge Aug 22nd, 2008 |
| Replies: 44 Views: 3,951 Really? I can forecast the next 5 minutes of weather with high accuracy. |