Normally a computational task is spelt out in pseudo code form or as a flowchart. Forming the program code with this as guide is good practice. The task can be simple and direct or conditional. The latter is often realized using keywords like while or if. They are explained through clear and focused examples. The idea of iterative routines, their convergence to a solution of desired accuracy using judgment based on metrics to stop iteration—all these go with these. A few widely used approaches to iterative solutions are explained here. The variety of exercises given, help in understanding the types of tasks as well as possible iterative procedures.
- Guttag JV (2013) Introduction to computation and programming using Python. MIT Press, MassachusettsGoogle Scholar
- Kreyszig E (2006) Advanced engineering mathematics, 9th edn. Wiley, New JeresyGoogle Scholar
- van Rossum G, Drake FL Jr (2014) The Python library reference. Python software foundationGoogle Scholar