
Introduction 13
The chapter provides an analysis of algorithms from correctness and effi ciency view points.
Algorithm development is explained with its proof of correctness.
Estimation of worst-case and mean execution times of algorithms are also dealt here.
Methodology for program implementation, program structuring, planning for error detection and
reporting, and program testing are provided in this chapter.
A brief description on program documentation and, managing development of large programs
are provided.
Limitations of computing like algorithm complexity, tractable and intractable problems, and
problem classes – P, NP, NPC, RP are discussed. ...