ACM Home Page
Please provide us with feedback. Feedback
Design and analysis of algorithms reconsidered
Full text PdfPdf (361 KB)
Source Technical Symposium on Computer Science Education archive
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education table of contents
Austin, Texas, United States
Pages: 16 - 20  
Year of Publication: 2000
ISBN:1-58113-213-1
Also published in ...
Author
Anany Levitin  Department of Computing Sciences, Villanova University, Villanova, PA
Sponsor
SIGCSE: ACM Special Interest Group on Computer Science Education
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 61,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/330908.331802
What is a DOI?

ABSTRACT

The paper elucidates two views (models) of algorithmic problem solving. The first one is static; it is based on the identification of several principal dimensions of algorithmic problem solving. The second one is dynamic, i.e., it catalogs main steps in the process of solving a problem with a computer. The models are used to identify several important issues in teaching design and analysis of algorithms and to suggest ways of rectifying the shortcomings identified.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
 
5
 
6
7
 
8
 
9
Polya, G. How To Solve It. Princeton Univ. Press, 1957.
 
10
 
11
 
12
 
13
Vandervooerde, D. The maximal rectangle problem. Dr. Dobb 's Journal, 23 (April 1998), 28-32.



Peer to Peer - Readers of this Article have also read: