The idea of approximating the solutions of delay differential equations by equations with piecewise constant arguments (EPCA) has been suggested by Gyijri [l], who proved convergence of the method for linear and nonlinear delay equations on compact intervals, and under certain conditions also on the half line. The approximating equations with piecewise constant argument can, in turn, be solved by use of difference equations. The latter then also provide an approximation of the original delay equation. (The theory of EPCA was initiated and studied by Cooke and Wiener in [2] and [3].) In this paper, we begin to investigate the question of whether in this method of approximation the asymptotic dynamics of the delay differential equations are preserved. A number of authors have dealt with the problem of showing that discretization of ordinary differential equations does not significantly alter the basic qualitative features. Readers may refer to the papers of Kloeden and Lorenz [4] and Beyn [5] for some of this work. For delay differential equations, questions of this sort have been studied by Cryer [6], Barwell [7], Zennaro [8], and later authors. The paper of Strehmel et al. [9] contains an up-to-date list of references. In our method of approximation, the delay equation is first replaced by an EPCA, and then by a difference equation, and our objective is to relate the qualitative dynamics of these three equations. We obtain results for autonomous and nonautonomous equations with one or many delays. For autonomous equations, the resulting difference algorithm is just a simple Euler scheme, but for nonautonomous equations, it includes other possibilities. In order to make the method and the nature of results as clear as possible, we begin with a particular test equation, k(t) = -pz(t 7), p > 0, 7 > 0.