Academic research findings report level of cheating in exams involving students studying from each other. Several publications have examined means for preventing cheating by means of exam versions, rotations of questions, and addressing social factors. Yet...
More
Academic research findings report level of cheating in exams involving students studying from each other. Several publications have examined means for preventing cheating by means of exam versions, rotations of questions, and addressing social factors. Yet one preventative aspect of exam cheating seems to be neglected and that is exam distribution. In this paper, the authors introduce the Exam Distribution Problem (EDP). Defining a given k versions of an exam in a classroom with n × m chairs, the paper attempts to find the optimal distribution of exam papers such that every two exams of the same version are at maximal distance from each other. Relevant works in Graph-Theory are examined with simulation of Naïve Algorithm (random) and Sequential Release Algorithm (common) for EDP are reviewed. A cost is assigned for instances where two papers of the same version appear in direct proximity thus associated with higher opportunity for cheating. The results showed that the Sequential Relea
Less
