Even if you don't know many limits, note that by expanding $(1+{1\over n})^n$ and dropping all terms except the two lowest order terms, one has $(1+{1\over n})^n\ge 1+n\cdot{1\over n}=2$. Thus
$$0\le\Bigl({n\over n+1}\Bigr)^{n^2}={1\over\bigl[ \,(1+{1\over n})^n\,\bigr]^n}\le {1\over 2^n}.$$
The convergence of your series now follows by comparison to the convergent geometric series $\sum\limits_{n=1}^\infty (1/2)^n$.
(Using the "well-known" limit $\lim\limits_{n\rightarrow\infty}(1+{1\over n})^n=e$, you can conclude that the terms $(1+{1\over n})^n$ eventually exceed $2$; this will suffice for comparing your series with $\sum\limits_{n=1}^\infty (1/2)^n$. Of course, if you do make use of this limit, using the Root Test is somewhat easier.)