In addition to learning technical aspects of website creation, students must connect different knowledge, think critically, seek more information, and approach their work from various perspectives. These requirements, or specified competencies, can be developed through providing and receiving peer feedback, which is confirmed as an efficient learning strategy in various empirical studies on different subjects. The aim of this research is to investigate the impact of peer feedback on students’ achievements in the Web Programming Course. We conducted a quantitative study with two groups of students. Students from the experimental group participated in online giving and receiving peer feedback regarding students’ assignments, while students from the control group did not have this opportunity. For evaluating students’ work, we used rubrics. The results indicate that students, through analyzing their peers’ work, providing qualitative assessments, reflecting on their work in line with received comments, and making necessary corrections, create content that surpasses the quality of websites created by their peers who did not have the opportunity to participate in peer feedback activities. Since students extensively analyzed their work after receiving comments and suggestions, made specific corrections, and consequently improved their projects, organizing peer feedback activities in programming courses, especially web programming, should be given more attention.
In this paper, for any real number $\lambdaup$, we transform the complete max-plus semiring $\mathbb{R}_\infty$ into a commutative, complete, additively idempotent semiring $\mathbb{R}_\infty^\lambdaup$, called the lower $\lambdaup$-truncation~of~$\mathbb{R}_\infty$. It is obtained by removing from $\mathbb{R}_\infty$ all real numbers smaller than $\lambdaup$, inheriting the addition operation, shifting the original products by $-\lambdaup$, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over $\mathbb{R}_\infty$, to $\mathbb{R}_\infty^\lambdaup$, where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over $\mathbb{R}_\infty^\lambdaup$ can be transformed into presimulations and prebisimulations between the original automata over $\mathbb{R}_\infty$. Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring $\mathbb{R}_\infty$.
In this paper, for any real number λ, we transform the complete max-plus semiring into a commutative, complete, additively idempotent semiring , called the lower λ-truncation of . It is obtained by removing from all real numbers smaller than λ, inheriting the addition operation, shifting the original products by −λ, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over , to , where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over can be transformed into presimulations and prebisimulations between the original automata over . Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring .