An algorithm for the determination of the eigenvalues of tridiagonal symmetric interval matrices is presented. The intervals of the eigenvalues are not overestimated, but exactly calculated. The algorithm is an efficient one, because it only needs twice as many operations as the Sturm algorithm, which is used for real matrices.