In this paper, we consider the back and forth nudging algorithm that has been introducedfor data assimilation purposes. It consists of iteratively and alternately solving forwardand backward in time the model equation, with a feedback term to the observations. Weconsider the case of 1-dimensional transport equations, either viscous or inviscid, linearor not (Burgers’ equation). Our aim is to prove some theoretical results on theconvergence, and convergence properties, of this algorithm. We show that for non viscousequations (both linear transport and Burgers), the convergence of the algorithm holdsunder observability conditions. Convergence can also be proven for viscous lineartransport equations under some strong hypothesis, but not for viscous Burgers’ equation.Moreover, the convergence rate is always exponential in time. We also notice that theforward and backward system of equations is well posed when no nudging term is considered.