OPTIMIZATION OF EXAM DISTRIBUTION

Authors

  • Fadi Safieddine American University of M. East, Kuwait
  • Milan Dordevic American University of M. East, Kuwait
  • Ahmed M. Hamza University of Portsmouth,United Kingdom

DOI:

https://doi.org/10.46827/ejes.v0i0.172

Keywords:

exam, distribution, EDP, graph-theory, optimization algorithms, cheating

Abstract

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 Release Algorithm did on average no better than the Random Algorithm. Using Optimization Algorithm, the team presents a new approach, the Dichotomous Interleaved Pairing Algorithm (DIP) that achieves minimal adjacency between two identical exam papers and minimal risk of cheating.

 

Article visualizations:

Hit counter

References

Davis, S. F., Grover, C. A., Becker, A. H., & McGregor, L. N. (1992) "Academic Dishonesty: Prevalence, Determinants, Techniques and Punishments." Teaching of Psychology, 19, 16-20.

Dick, M., Sheard, J., Bareiss, C., Carter, J., Joyce, D., Harding, T., and Laxer, C. (2003) Addressing student cheating: definitions and solutions. ACM SIGCSE Bulletin, 35 (2). pp. 172-184. ISSN 0097-8418.

Lathrop, A., & Foss, K. (2005). Guiding students from cheating and plagiarism to honesty and integrity: strategies for change. Westport, CT: Libraries Unlimited.

Richard J. Fendler & Jonathan M. Godbey (2016) Cheaters Should Never Win: Eliminating the Benefits of Cheating. Journal of Academic Ethics 14 (1):71-85.

M, Moffat. (1990) Undergraduate Cheating, ERIC document ED334921.

Akram Abedinipoor , Fatemeh Samadi , Somayeh Momeniyan (2014) Prevalence and factors associated with cheating among students of Qom University of Medical Sciences. Journal of Medical Education Development. J Med Edu Dev 2015, 8(19): 73-80.

Jensen, L. A., Arnett, J. J., Feldman, S. S., and Cauffman, E. (2002). It’s wrong, but everybody does it: Academic dishonesty among high school and college students. Contemp. Educ. Psychol. 27: 209–228.

Newstead, S.E.,Franklyn-Stokes, A. and Armstead, P. (1996), 'Individual differences in student cheating', Journal of Educational Psychology, 88, 229–41

Donald L. McCabe, Linda Klebe Treviño, Kenneth D. Butterfield, (2001) “Cheating in Academic Institutions: A Decade of Research,” Ethics & Behavior 11 (3): 219–232

Sharp, A. (2007). Distance colouring, In Algorithms–ESA 2007, Springer Berlin Heidelberg, pp. 510-521.

Kramer, F., & Kramer, H. (2008), A survey on the distance-colouring of graphs, Discrete mathematics, 308(2): 422-426.

M. Molloy, M.R. Salavatipour, Frequency channel assignment on planar networks, in: Proceedings of ESA 2002, Lecture Notes in Computer Science, Vol. 2461, Springer, Berlin, 736–747.

Garey, M. R., & Johnson, D. S. (1979), A Guide to the Theory of NP-Completeness, WH Freemann, New York.

Bondy, J., Murty, U.: Graph Theory with Applications. The MacMillan Press Ltd (1978)

Fiorini, S., Wilson, R.J.: Edge-colourings of graphs. In Beineke, L.W., Wilson, R.J., eds.: Selected Topics in Graph Theory. Academic Press, Inc., London (1978) 103–126

Bollob´as, B., Harris, A.J.: List-colourings of graphs. Graphs and Combinatorics 1 (1985) 115–127

Wilson, B.: Line-distinguishing and harmonious colourings. In Nelson, R., Wilson, R.J., eds.: Graph Colourings. Pitman Research Notes in Mathematics Series. Longman Scientific & Technical, Longman house, Burnt Mill, Harlow, Essex, UK (1990) 115–133

Chetwynd, A.: Total colourings of graphs. In Nelson, R., Wilson, R.J., eds.: Graph Colourings. Pitman Research Notes in Mathematics Series. Longman Scientific & Technical, Longman house, Burnt Mill, Harlow, Essex, UK (1990) 65–77

Wright, D. W., Angus, T., Enright, A. J., van Dongen, S., & Freeman, T. C. (2014). BioLayout Express 3D Version 3.2.

Downloads

Published

2016-07-22

Issue

Vol 2, No 1 (2016)

Section

Articles

License

Authors who publish with this journal agree to the following terms:

Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).