Submitted by Marlene Santos (marlene.bc.ufg@gmail.com) on 2016-09-12T17:34:17Z No. of bitstreams: 2 Dissertação - Rodrigo Elias Francisco - 2016.pdf: 1520504 bytes, checksum: ca44a0447aeffaf5c78c2b28a6859e69 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-09-15T12:37:53Z (GMT) No. of bitstreams: 2 Dissertação - Rodrigo Elias Francisco - 2016.pdf: 1520504 bytes, checksum: ca44a0447aeffaf5c78c2b28a6859e69 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2016-09-15T12:37:53Z (GMT). No. of bitstreams: 2 Dissertação - Rodrigo Elias Francisco - 2016.pdf: 1520504 bytes, checksum: ca44a0447aeffaf5c78c2b28a6859e69 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-08-30 / This dissertation approaches Online Judge in teaching Introductory Programming (CS1). Initially there was an exploratory research on BOCA system in teaching CS1, which brought experiences and data of student interactions with the system, which, supported by Systematic Literature Review (RSL), contributed to defining the requirements for the system meets the discipline of CS1 and guided continuing research. In the second phase, there was the aim to solve specific problems identified in the previous phase, and measuring the difficulty of CS1 problems and support for plagiarism identification in CS1 activities. The solution of these problems included RSL, practical experiences with writing and execution algorithms, comparison of the results with the expected results, and comparison of the proposed approaches to the identified in the literature. The strategy to measure the difficulty of problems CS1 proposed works with the height of a tree mounted to sets and sub-sets of nested code into a program and the amount of related subjects. The strategy to support the identification of plagiarism proposal works with the Edit Distance algorithm processing and normalization techniques in preprocessing, and it is a highly adapted proposal to the reality of the data used in this research (programs written in C with few lines of code by students CS1). Experience has shown the complexity of applying computing to education, which often works with subjective data, it was necessary to raise the difficulty of the problems in view of the students and the teacher’s view of the existence of plagiarism in peer programs, whose views are quite variables. It is suggested the creation of multidisciplinary teams to the evolution of the area (with professionals of computing, statistics, psychology and pedagogy) with a focus on validation and method used for research. / Esta dissertação aborda Juiz Online no ensino de Programação Introdutória (CS1). Inicialmente houve uma pesquisa exploratória sobre o sistema BOCA no ensino de CS1, que trouxe experiências e dados de interações de alunos com o sistema, que, apoiados pela Revisão Sistemática da Literatura (RSL), contribuíram para a definição dos requisitos necessários para que o sistema atenda à disciplina de CS1 e guiaram a continuidade da pesquisa. Em um segundo momento, o objetivo foi resolver problemas específicos levantados na fase anterior, sendo a medição da dificuldade de problemas de CS1 e o apoio à identificação de plágio em atividades de CS1. A solução desses problemas contou com RSL, experiências práticas com escrita e execução de algoritmos, comparação dos resultados obtidos com os resultados esperados, e comparação das abordagens propostas com as identificadas na literatura. A estratégia proposta para medir a dificuldade de problemas de CS1 trabalha com a altura de uma árvore montada com conjuntos e sub-conjuntos de códigos aninhados num programa e a quantidade de assuntos relacionados. A estratégia para apoiar a identificação de plágio proposta trabalha com o algoritmo Distância de Edição no processamento e técnicas de normalização no pré-processamento. Trata-se de uma proposta fortemente adaptada à realidade dos dados utilizados nesta pesquisa (programas escritos em C, com poucas linhas de código, por alunos de CS1). A experiência mostrou a complexidade em aplicar a computação à educação, que trabalha frequentemente com dados subjetivos. Foi necessário levantar a dificuldade dos problemas na visão dos alunos e a visão de professores sobre a existência de plágio em pares de programas, cujas opiniões são bastante variáveis. Sugere-se para a evolução da área, que sejam criadas equipes multidisciplinares (com profissionais de computação, estatística, psicologia e pedagogia) e haja um foco na validação e no método usado para as pesquisas.

abstract: The focus of the study was to identify secondary school students' difficulties with aspects of linearity and linear functions, and to assess their teachers' understanding of the nature of the difficulties experienced by their students. A cross-sectional study with 1561 Grades 8-10 students enrolled in mathematics courses from Pre-Algebra to Algebra II, and their 26 mathematics teachers was employed. All participants completed the Mini-Diagnostic Test (MDT) on aspects of linearity and linear functions, ranked the MDT problems by perceived difficulty, and commented on the nature of the difficulties. Interviews were conducted with 40 students and 20 teachers. A cluster analysis revealed the existence of two groups of students, Group 0 enrolled in courses below or at their grade level, and Group 1 enrolled in courses above their grade level. A factor analysis confirmed the importance of slope and the Cartesian connection for student understanding of linearity and linear functions. There was little variation in student performance on the MDT across grades. Student performance on the MDT increased with more advanced courses, mainly due to Group 1 student performance. The most difficult problems were those requiring identification of slope from the graph of a line. That difficulty persisted across grades, mathematics courses, and performance groups (Group 0, and 1). A comparison of student ranking of MDT problems by difficulty and their performance on the MDT, showed that students correctly identified the problems with the highest MDT mean scores as being least difficult for them. Only Group 1 students could identify some of the problems with lower MDT mean scores as being difficult. Teachers did not identify MDT problems that posed the greatest difficulty for their students. Student interviews confirmed difficulties with slope and the Cartesian connection. Teachers' descriptions of problem difficulty identified factors such as lack of familiarity with problem content or context, problem format and length. Teachers did not identify student difficulties with slope in a geometric context. / Dissertation/Thesis / Ph.D. Curriculum and Instruction 2011