|  |
Laura Felice [a1] [a2]
Departamento de Computación y Sistemas
Universidad Nacional del Centro de la Provincia de Buenos Aires [u1] [u2]
Buenos Aires, Argentina [c1] [c2]
Liliana Martinez [a1] [a2]
Departamento de Computación y Sistemas
Universidad Nacional del Centro de la Provincia de Buenos Aires [u1] [u2]
Buenos Aires, Argentina [c1] [c2]
Claudia Pereira [a1] [a2]
Departamento de Computación y Sistemas
Universidad Nacional del Centro de la Provincia de Buenos Aires [u1] [u2]
Buenos Aires, Argentina [c1] [c2]
In this paper we describe a methodology for constructing efficient algorithms applied in an elementary course on Data Structures and Algorithms. This methodology attempts to show the essential steps in a sequential process in software development from an informally stated problem, via a formal problem specification, to a final efficient program. Students of the course are expected to have at least a year's experience in programming high level languages and elementary logic and calculus. We describe a prototype, AyDA, which assists in the construction of algorithms starting from the proposed methodology.
Keywords: data structures and algorithms, algorithm design techniques, formal specifications, programming teaching
Read this refereed paper in Adobe Portable Document (PDF) format. (173 K bytes)
Preview this refereed paper in Plain Text (TXT) format. (24 K bytes)
View the photo/graphic Favre.Liliana.jpg with this presentation. (7 K bytes)
View the photo/graphic Felice.Laura.jpg with this presentation. (9 K bytes)
View the photo/graphic Martinez.Liliana.jpg with this presentation. (9 K bytes)
View the photo/graphic Pereira.Claudia.jpg with this presentation. (9 K bytes)
Comments and corrections to
webmaster@isedj.org
