More Web Proxy on the site http://driver.im/

Article

Free access

Do we teach the right algorithm design techniques?

Author:

Anany LevitinAuthors Info & Claims

SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science education

Pages 179 - 183

https://doi.org/10.1145/299649.299747

Published: 01 March 1999 Publication History

Abstract

Algorithms have come to be recognized as the cornerstone of computing. Surprisingly, there has been little research or discussion of general techniques for designing algorithms. Though several such techniques have been identified, there are serious shortcomings in the existing taxonomy. The paper points out these shortcomings, reevaluates some of the techniques, and proposes a new, hierarchical classification scheme by grouping techniques according to their level of generality. A variety of examples from different areas of computing are used to demonstrate the power and flexibility of the taxonomy being proposed.

References

[1]

Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

Digital Library

[2]

Bellman, R.E. and Dreyfus, S.E. Applied Dynamic Programming. Princeton University Press, 1962.

Digital Library

[3]

Bentley, J. "Multidimensional divide-and-conquer. Communications of the ACM, Vol. 23, No. 4 (April 1980), pp. 214-229.

Digital Library

[4]

Brassard, G. and Bratley, P. Algorithmics: Theory and Practice, Prentice-Hall, 1988.

Digital Library

[5]

Brassard, G. and Bratley, P. Fundamental of Algorithtalcs, Prentice-Hall, 1996.

Digital Library

[6]

Horowitz, E. and Sahni, S. Fundamentals of Computer Algorithms. Computer Science Press, 1978.

Digital Library

[7]

Horowitz, E. Algorithms, design and classification of. In Encyclopedia of Computer Science, 3-rd edition, Ralston, A. and Reilly, E.D., Eds. Van Nostrand Reinhold, 1993, pp. 33-37.

[8]

Horowitz, E., Sahni, S., and Rajasekaran, Computer Algorithms. Computer Science Press, New York, 1996.

Digital Library

[9]

Knuth, D.E. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 1973.

Digital Library

[10]

Lawler, E.L. et al., Eds. The Traveling Salesman Problem: A Guided tour of Combinatorial Optimization. John Wiley & Sons, 1985.

[11]

Manber, U. Introduction to Algorithms: A Creative Approach. Addison-Wesley, 1989.

Digital Library

[12]

Moret, B.M.E. and Shapiro, H.D. Algorithms from P to NP, Volume I: Design & Efficiency. Benjamin/Cummings Publishing, 1990.

Digital Library

[13]

Neapolitan, R.E. and Naimipour, K. Foundations of Algorithms. Jones and Bartlett Publishers, 1996.

Digital Library

[14]

Pan, V. Strassen's algorithm is not optimal. In Proceedings of the 19th Annual IEEE Symposiom on the Foundations of Computer Science, 1978, pp. 166- 176.

[15]

Sedgewick, R. Algorithms. Addison-Wesley, 2nd ed., 1988.

Digital Library

Cited By

Levitin A(2016)Algorithm design strategies in CS curricula 2013Journal of Computing Sciences in Colleges10.5555/2835377.283538931:3(78-84)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.5555/2835377.2835389
Velázquez-Iturbide J(2013)An Experimental Method for the Active Learning of Greedy AlgorithmsACM Transactions on Computing Education10.1145/253497213:4(1-23)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1145/2534972
Lobo ABaliga G(2006)NP-completeness for all computer science undergraduatesJournal of Computing Sciences in Colleges10.5555/1127442.112745021:6(53-63)Online publication date: 1-Jun-2006
https://dl.acm.org/doi/10.5555/1127442.1127450
Show More Cited By

Index Terms

Do we teach the right algorithm design techniques?
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Computing education programs
        Computer science education

Recommendations

Do we teach the right algorithm design techniques?

Algorithms have come to be recognized as the cornerstone of computing. Surprisingly, there has been little research or discussion of general techniques for designing algorithms. Though several such techniques have been identified, there are serious ...
A Taxonomy of Visualization Techniques Using the Data State Reference Model
INFOVIS '00: Proceedings of the IEEE Symposium on Information Vizualization 2000

In previous work, researchers have attempted to construct taxonomies of information visualization techniques by examining the data domains that are compatible with these techniques. This is useful because implementers can quickly identify various ...
Using guidelines to assist in the visualisation design process
APVis '05: proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45

The design process of any visualisation involves many design decisions. One way to assist with these design decisions is to provide guidelines. This paper introduces the MS-Guidelines and the rationale behind them. The MS-Guidelines form a group of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science education

March 1999

383 pages

ISBN:1581130856

DOI:10.1145/299649

Chairmen:
Jane Prey
Univ. of Virginia, Charlottesville
,
Bob Noonan
College of William & Mary, Williamsburg, VA

ACM SIGCSE Bulletin Volume 31, Issue 1
March 1999
370 pages
ISSN:0097-8418
DOI:10.1145/384266
Editor:
John Impagliazzo
Hofstra Univ., Hempstead, NY
Issue’s Table of Contents

Copyright © 1999 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCSE99

Sponsor:

SIGCSE

SIGCSE99: The 30th ACM SIGCSE Technical Symposium

March 24 - 28, 1999

Louisiana, New Orleans, USA

Acceptance Rates

SIGCSE '99 Paper Acceptance Rate 70 of 190 submissions, 37%;

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE TS 2025

Sponsor:
sigcse

The 56th ACM Technical Symposium on Computer Science Education

February 26 - March 1, 2025

Pittsburgh , PA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
1,199
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)15

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Levitin A(2016)Algorithm design strategies in CS curricula 2013Journal of Computing Sciences in Colleges10.5555/2835377.283538931:3(78-84)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.5555/2835377.2835389
Velázquez-Iturbide J(2013)An Experimental Method for the Active Learning of Greedy AlgorithmsACM Transactions on Computing Education10.1145/253497213:4(1-23)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1145/2534972
Lobo ABaliga G(2006)NP-completeness for all computer science undergraduatesJournal of Computing Sciences in Colleges10.5555/1127442.112745021:6(53-63)Online publication date: 1-Jun-2006
https://dl.acm.org/doi/10.5555/1127442.1127450
Levitin ADann WNaps TTymann PBaldwin D(2005)Analyze thatProceedings of the 36th SIGCSE technical symposium on Computer science education10.1145/1047344.1047409(171-175)Online publication date: 23-Feb-2005
https://dl.acm.org/doi/10.1145/1047344.1047409
Levitin A(2005)Analyze thatACM SIGCSE Bulletin10.1145/1047124.104740937:1(171-175)Online publication date: 23-Feb-2005
https://dl.acm.org/doi/10.1145/1047124.1047409
Sung KShirley P(2004)Algorithm analysis for returning adult studentsJournal of Computing Sciences in Colleges10.5555/1040151.104015820:2(62-69)Online publication date: 1-Dec-2004
https://dl.acm.org/doi/10.5555/1040151.1040158
Levitin APapalaskari M(2002)Using puzzles in teaching algorithmsACM SIGCSE Bulletin10.1145/563517.56345634:1(292-296)Online publication date: 27-Feb-2002
https://dl.acm.org/doi/10.1145/563517.563456
Levitin APapalaskari MGersting JWalker HGrissom S(2002)Using puzzles in teaching algorithmsProceedings of the 33rd SIGCSE technical symposium on Computer science education10.1145/563340.563456(292-296)Online publication date: 27-Feb-2002
https://dl.acm.org/doi/10.1145/563340.563456
Levitin A(2000)Design and analysis of algorithms reconsideredACM SIGCSE Bulletin10.1145/331795.33180232:1(16-20)Online publication date: 1-Mar-2000
https://dl.acm.org/doi/10.1145/331795.331802
Levitin ACassel BDale NWalker H(2000)Design and analysis of algorithms reconsideredProceedings of the thirty-first SIGCSE technical symposium on Computer science education10.1145/330908.331802(16-20)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/330908.331802

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents