We will show how the combinatorics of symmetric functions can give many new and classic results in the theory of permutation enumeration. Among other things, a well known result of Garsia and Gessel will be derivied through this perspective. This is the second of two talks on the subject; however, this talk is almost self contained. For those not attending the first talk, we only assume familiarity with the elementary and homogeneous symmetric functions and the notions of descents and inversions for permutations.