We present an unified approach in analyzing Uzawa type iterative algorithms for saddle point problems. We study the classical Uzawa method, and two versions of Inexact Uzawa algorithms. The target application is the Stokes system, but other saddle point systems, e.g., arising from mortar methods or Lagrange multipliers methods can benefit from our study. We prove convergence of Uzawa type algorithms and find optimal rates of convergence in an abstract setting on finite or infinite dimensional Hilbert spaces. The results can be used to design multilevel or adaptive algorithms for solving saddle point problems. The discrete spaces do not have to satisfy the stability (LBB) condition.