A grading dilemma or the abyss between sorting and the knapsack problem

Authors:
Robert W. McGrail;Tracey Baldwin McGrail
Affiliations:
Bard College, Annandale-on-Hudson, NY;Marist College, Poughkeepsie, NY
Venue:
Journal of Computing Sciences in Colleges
Year:
2004

Citing 7
Cited 0

Scheme and the art of programming

Scheme and the art of programming
Introduction to algorithms

Introduction to algorithms
An introduction to genetic algorithms

An introduction to genetic algorithms
Choosing subsets with maximum weighted average

Journal of Algorithms
How to design programs: an introduction to programming and computing

How to design programs: an introduction to programming and computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Revised Report on the Algorithmic Language Scheme

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper attempts to provide a solution to a seemingly simple grading problem. It introduces a notion of sorting for lists of weighted grades and puts forward an algorithmic candidate for this task. The paper then goes on to discuss the reliability of this algorithm and concludes with suggestions for student research. It is noted that the problem has similarities to both sorting and the knapsack problem and can be a nice addition to a course on algorithms.