We study the distribution of exceedance over permutations
with no fixed points (also called derangements) by
giving a recursive formula for the number d__{n,k}
of derangements over $n$ having $k$ eexceedances.
We also give an exponential generating function
for this distribution.
We further refine this study by adding parity as
additional parameter.