NotesFAQContact Us
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ864595
Record Type: Journal
Publication Date: 2009-Sep
Pages: 14
Abstractor: As Provided
Reference Count: 11
ISSN: ISSN-0899-3408
Planning Readings: A Comparative Exploration of Basic Algorithms
Piater, Justus H.
Computer Science Education, v19 n3 p179-192 Sep 2009
Conventional introduction to computer science presents individual algorithmic paradigms in the context of specific, prototypical problems. To complement this algorithm-centric instruction, this study additionally advocates problem-centric instruction. I present an original problem drawn from students' life that is simply stated but provides rich discussions of different approaches. It lends itself to a wide range of didactic means from individual or group study to whole class discussions under various levels of guidance by the instructor. I suggest diverse algorithms for solving it, covering some of the most important algorithmic paradigms. Some of these algorithms (greedy, divide-and-conquer) do not produce optimal solutions but may nevertheless have their merits in practice. The best algorithms are illustrative instances of some of the most sophisticated paradigms introduced in undergraduate curricula (dynamic programming, graphs). (Contains 2 tables and 1 figure.)
Routledge. Available from: Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site:
Publication Type: Journal Articles; Reports - Research
Education Level: Higher Education; Postsecondary Education
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A