This introduction to computation teaches students to apply algorithmic thinking to problem solving. C is presented as a means of expressing algorithms, rather than as an end in itself. As Lerman covers the different areas of computation, he introduces C syntax on an as-needed basis. Many different algorithmic areas are considered, including numerical methods, matrix methods, sorting, searching, graphics and simulation. Each chapter is followed by a series of exercises which introduce new algorithms, or require some augmentation of algorithms already presented. Programming projects illustrate the application of methods to diverse problems in engineering, science, management and planning. Object-oriented programming methods are also introduced.