To ask this question, you have to first be clear what you mean by a "class". Do you mean a finite formula in ZFC language with one free variable, P(x)? (Writing P(x) roughly means "x has property P".)
Second, what do you mean by a map from a class P to a class Q? Do you mean a class of ordered pairs?
If "yes" to both of the above, then I think the answer to your question is also "yes", because the Schroeder-Bernstein argument will allow you to explicitly write down a formula F(x,y) from the formulas P( ) and Q( ) that is a "bijection" in the sense that for all x such that P(x) there is a unique y such that Q(y) and F(x,y).
If, however, you mean class in some other sense, like the undefined notion of "class" used in NBG set theory, or something more vague, a different answer will be required.
I recommend reading the wikipedia article on Zermelo-Frenkel Set Theory
and browsing related articles until you feel comfortable the precise meanings of the basic terminology :)