The book follows the ordinary introductory sequence in numerical analysis: numerical error, linear algebra, interpolation, differentiation and integration, root finding and optimization, and differential equations. That makes it easy to line up with a conventional course. The unusual part is the emphasis. We spend less time proving a method and more time exposing what the method actually does when we implement it.
That distinction matters when choosing a role for the book. In a course built around rigorous convergence proofs, CMNA makes a good computational companion. In a computational methods or scientific computing course, it can carry much more of the weekly structure. I would not pretend those are the same course merely because both eventually call a function namednewton().