An algorithm to form balanced and diverse groups of students
β Scribed by Hak Koon Yeoh; Mohamad Iskandr Mohamad Nor
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 156 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1061-3773
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We share the details of a simple algorithm which groups students based on diversity in gender and race while keeping the group average CGPA nearly equal. Application on simulated and actual class profiles gave multipleβfeasible solutions within seconds, with a maximum absolute deviation in group average CGPA of 0.03/4.00 or lower. Β© 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 19: 582β590, 2011
π SIMILAR VOLUMES
We shall describe an algorithm based on an idea of Roggenkamp and Scott (Roggenkamp and Scott, 1993) ) to compute \(\mathrm{Hom}_{\text {alg }}(\mathbb{F} H, \mathbb{F} G\) ), where \(H, G\) are finite \(p\)-groups and \(\mathbb{F} H, \mathbb{F} G\) are their group algebras over \(\mathbb{F}=\mathbb
We first develop a construction, originally due to Reidemeister, of the fundamental group and covers of a two-dimensional combinatorial cell complex. Then, we describe a practical algorithmic approach to the computation of fundamental groups and first homology groups (as finitely presented groups),
We present an algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. This algorithm has been implemented for System GAP, version 4.