Análisis de sistemas interactivos para la enseñanza del TDA árboles binarios de búsqueda
Archivos
Fecha
2003-07-04
Autores
Cruz González, Rafael de la
Título de la revista
ISSN de la revista
Título del volumen
Editor
Universidad Central “Marta Abreu” de Las Villas
Resumen
Con este proyecto se pretende realizar un análisis crítico y extensivo de los principales sistemas interactivos disponibles en Internet, utilizados para representar de manera gráfica el TDA Árboles Binarios de Búsqueda, y cuyo código fuente esté disponible, de forma que permita diseñar una aplicación capaz de mostrar animaciones con explicaciones claras sobre los pasos que se están llevando a cabo cuando se realiza cualquier tipo de operaciones, todo esto con un enfoque pedagógico, gracias a el cual se garantiza el aprendizaje.
En Internet existen una serie de sitios con animaciones del TDA ABB, para árboles AVL, Rojo/Negro, y Biselado, pero la mayoría no explica el proceso que se muestra de manera gráfica y en ocasiones son tan rápidas que no se percibe el concepto del algoritmo que se está utilizando. Las opciones para los estudiantes se ven reducidas además por la barrera del idioma, y aunque en este tipo de carreras se debe tener la habilidad al menos de leer inglés, no todos han adquirido el conocimiento en esta etapa de la carrera.
Desde el punto de vista de programación se pretende acotar dos problemas:
La programación de los algoritmos para el TDA, sin perder de vista que muchos de estos algoritmos están ya definidos, pero intentando buscar variantes suficientemente claras para que sean entendidos con mayor facilidad por los estudiantes.
La representación gráfica de árboles, tomando como referencia la teoría existente para la representación de grafos.
The main objective of this project is to present the outcome of an extensive and critical analysis of some of the main interactive applications posted on the Internet, used to demonstrate graphic animations of the ADT Binary Search Trees, and whose source code is available for perusal, in order to design an application able to demonstrate graphic animations, along with clear and brief explanations about the steps needed to perform operations, all this from a pedagogic perspective, thanks to which the learning will be guaranteed. In Internet there is a small number of web sites with graphic animations of BST’s, whether it is AVL, Red-Black or Splay, but most of these animations do not explain the process shown, and sometimes are so fast that there is not enough time to assimilate the core concept of the algorithm being used. Students’ choices are reduced for the barrier of the language, even though they must at least have the ability to read in English, not all of them have acquired the knowledge at this early stages of the career. Through the paradigm of programming, this project intends to address two issues: The programming of algorithms to implement the ADT, knowing that even though many of these algorithms have already been implemented, new variations might be searched for students to understand them in more clear ways. The graphical representation of trees, taking as a reference the existing theory for graphs representation.
The main objective of this project is to present the outcome of an extensive and critical analysis of some of the main interactive applications posted on the Internet, used to demonstrate graphic animations of the ADT Binary Search Trees, and whose source code is available for perusal, in order to design an application able to demonstrate graphic animations, along with clear and brief explanations about the steps needed to perform operations, all this from a pedagogic perspective, thanks to which the learning will be guaranteed. In Internet there is a small number of web sites with graphic animations of BST’s, whether it is AVL, Red-Black or Splay, but most of these animations do not explain the process shown, and sometimes are so fast that there is not enough time to assimilate the core concept of the algorithm being used. Students’ choices are reduced for the barrier of the language, even though they must at least have the ability to read in English, not all of them have acquired the knowledge at this early stages of the career. Through the paradigm of programming, this project intends to address two issues: The programming of algorithms to implement the ADT, knowing that even though many of these algorithms have already been implemented, new variations might be searched for students to understand them in more clear ways. The graphical representation of trees, taking as a reference the existing theory for graphs representation.
Descripción
Palabras clave
Análisis, Sistemas Interactivos, Enseñanza del TDA, Arboles Binarios de Búsqueda, Inteligencia Artificial