Intro to Algorithms help, please!?

My book explains the theory, but doesn't tell you how to apply it to an actual problem. There aren't any steps. I just need a step by step guide on how to solve a problem like this:

Suppose you have algorithms with the six running times listed below. (Assume these are the exact number of operations performed as a function of the input size n.) Suppose you have a computer that can perform 10^10 operations per second, and you need to compute a result in at most an hour of computation. For each of the algorithms, what is the largest input size n for which you would be able to get the result within an hour?

(a) n^2

(b) n^3

(c) 100n^2

(d) n log n

(e) 2^n

(f) 2^2^n