Open Access Open Access  Restricted Access Subscription Access

Algorithm-based approach to problem solving

Anisha Godse, Aishwarya .

Abstract


Two perspectives (types) of algorithms resolving problems are explained inside the research. The initial one is static and is dependent on the recognition of a number of key factors that affect how algorithms find optimal solutions. The second one is dynamic; in other words, it lists the key stages involved in using a computer to solve a problem. The models are used to point out a number of crucial problems with teaching algorithm design and analysis, as well as to find answers.

Full Text:

PDF

References


] Baeza-Yates, R. Teaching Algorithm’s. SIGACT News,

(December 1995), 51-59.

Bentley, J. Programming Pearls. Addison-Wesley, 1986.

Brassard, G. and Bratley, P. Fundamental of Algorithms-

misc., Prentice-Hall, 1996.

Cormen, T. et al. Introduction to Algorithms. MIT, 1992.

Horowitz, et al. Computer Algorithms. Computer Science Press, 1996.

Kernigan, B. and Pike, R. The Practice of Programming. Addison-Wesley, 1999.

Levitin, A. Do we teach the right algorithm design techniques? In Proc. SIGCSE '99 (March 1999), 179-183.

Neapolitan, R.and Naimipour, K. Foundations of Algorithms. Jones and Bartlett, 2nd ed., 1997.

Polya, G. How to Solve It. Princeton Univ. Press, 1957.

Rawlins, J. Compared To What?: an Introduction to the Analysis of Algorithms. Comp. Sc. Press, 1992.


Refbacks

  • There are currently no refbacks.