Search

This study provides a detailed comparison of the skills and competencies required for systems and computer engineers in Colombia and the rest of Latin America. The research uses data from 187 universities, based on the ranking from the Cybermetrics Lab of the Spanish National Research Council, to categorize 16 generic and 20 specific competencies that these professionals should possess. The comparison is carried out using Venn diagrams and statistical analysis of frequency and proportionality to identify similarities and differences between the two regional groups studied. The findings of the study are crucial for understanding regional variations in the academic preparation and job expectations of systems and computer engineers. This comparative analysis proves to be a valuable tool for both companies and academic institutions in the decision-making process. Companies can use this information to assess the suitability of candidates based on specific competencies, while universities can tailor their curricula to meet the demands of the job market and enhance the quality of education. In summary, the study offers a comprehensive overview of the essential competencies of systems and computer engineers in Colombia and Latin America, enabling more informed and effective decision-making in the academic and business sectors. [ABSTRACT FROM AUTHOR]

Copyright of Revista de Ingenieria, Matematicas y Ciencias de la Informacion is the property of Corporacion Universitaria Republicana and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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]

Copyright of Revista Avances: Investigación en Ingeniería is the property of Universidad Libre, Facultad de Ingenieria and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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]

Copyright of Scientia et Technica is the property of Scientia et Technica and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)