Search

This research article presents a comprehensive approach to enhance the teaching of programming, specifically in the Arduino language, within the academic context of Universidad Tecnológica de Pereira (utp). The study addresses two key components: a teaching methodology centered on active pedagogy and an educational software tool. The proposed methodology enables educators to act as facilitators who tailor teaching to the individual needs of students. The software, a web application developed using standard technologies such as html, css, and JavaScript, is organized into modules ranging from theoretical fundamentals to practical projects. The effectiveness of this approach was evaluated through satisfaction surveys and data analysis applied to two groups of students from the Faculty of Engineering at utp. The results indicate that the combination of the methodology and the software resulted in significant progress in educational development and overall student satisfaction. Moreover, there was an increase in students' interest in actively participating in the learning process, supported by the adoption of information and communication technologies (ict). This article substantially contributes to the field of programming education. It offers effective pedagogical and technological strategies for a real academic environment and highlights the importance of ict and active pedagogy. It aims to drive a significant change in the quality of higher education in programming. [ABSTRACT FROM AUTHOR]

The main objective of this investigation is to develop a method that allows the creator of languages to decide if the grammar fulfills with the necessary and enough condition for that a clean grammar be of the type LL1 specifying that the groups of managing symbols corresponding to the different expansions of each symbol non terminal are disjointed. To reach this objective it is methodologically appropriate to advance in several well differentiated aspects. First, the analysis and design of the application is approached inside the methodologies defined in the field of structures of data, programming languages, artificial intelligence, and algorithm. In second instance, it is important to highlight that an algorithm exists to determine this type of grammarians. To implement this algorithm in this tool a series of steps are followed sequentially that consume enough time of manual analysis; therefore, the steps and the implicit algorithms of each one are systematized allowing to diminish the time of the analyses, to increase their efficiency and at the end to verify if the grammar is or is not of type LL1, finally the tests carried out with different types of grammarians were convincing, satisfactory and they reflected the expected results. [ABSTRACT FROM AUTHOR]

The main objective of this investigation is to develop a method that allows the creator of languages to decide if the grammar fulfills with the necessary and enough condition for that a clean grammar be of the type LL1 specifying that the groups of managing symbols corresponding to the different expansions of each symbol non terminal are disjointed. To reach this objective it is methodologically appropriate to advance in several well differentiated aspects. First, the analysis and design of the application is approached inside the methodologies defined in the field of structures of data, programming languages, artificial intelligence, and algorithm. In second instance, it is important to highlight that an algorithm exists to determine this type of grammarians. To implement this algorithm in this tool a series of steps are followed sequentially that consume enough time of manual analysis; therefore, the steps and the implicit algorithms of each one are systematized allowing to diminish the time of the analyses, to increase their efficiency and at the end to verify if the grammar is or is not of type LL1, finally the tests carried out with different types of grammarians were convincing, satisfactory and they reflected the expected results. [ABSTRACT FROM AUTHOR]

The main objective of this investigation is to develop a method that allows the creator of languages to decide if the grammar fulfills with the necessary and enough condition for that a clean grammar be of the type LL1 specifying that the groups of managing symbols corresponding to the different expansions of each symbol non terminal are disjointed. To reach this objective it is methodologically appropriate to advance in several well differentiated aspects. First, the analysis and design of the application is approached inside the methodologies defined in the field of structures of data, programming languages, artificial intelligence, and algorithm. In second instance, it is important to highlight that an algorithm exists to determine this type of grammarians. To implement this algorithm in this tool a series of steps are followed sequentially that consume enough time of manual analysis; therefore, the steps and the implicit algorithms of each one are systematized allowing to diminish the time of the analyses, to increase their efficiency and at the end to verify if the grammar is or is not of type LL1, finally the tests carried out with different types of grammarians were convincing, satisfactory and they reflected the expected results. [ABSTRACT FROM AUTHOR]

Societies are dynamic in many fields, such as demography, social evolution and development. In terms of growth, the way to limit their impact on the environment we have different methods. The prospective analysis, allowing decisions are tools that have served and continue to serve the environmental authorities, to achieve some way mitigate the impacts of this growth, either from an academic standpoint, involving an awareness, to a regulatory standpoint, who involves different laws that punish different behavior. Kuznets curve is a hypothesis that was created in the mid 50's and now as actual results, presents a trend of communities taking behavior in terms of environmental degradation and regulatory development. Presented as composition, a strong influence of economic growth and the possibility of sanctioning of communities. [ABSTRACT FROM AUTHOR]

This research aims to provide a description of sparse matrices, as well as evidence of its importance, the functioning of these matrices and their different forms of representation, through the implementation of this theory in a Java programming language, used an editor called Net beans7.0. As is shown in the paper every day sparse matrices tend to be used in scientific computing applications, biomedical, and are characterized most elements are zero [ABSTRACT FROM AUTHOR]