@Enchantress: I'm assuming that you are talking about cheating by copying from nearby students. If this is not the first exam, based on prior grades, put the A students in the back of the room, with the B students in front of the A students, the C students in front of the B students, the D students in front of the C students, and the F students in the front of the room. Put as many of the C students as you can in alternate seats, e.g., columns 1, 3, 5, .... If you can alternate all of the C students, put as many of the B students as you can in alternate seats. If you can alternate all of the B students, put as many of the D students as you can in alternate seats. If you can alternate all of the D students, put as many F students as you can in alternate seats. Finally, if you can alternate all of the F students, put as many A students as you can in alternate seats. Rationale: An A or B student won't copy from anyone else, because he doesn't want someone else's mistake to mess up his grade. The C students have the most to gain by copying, but they will be spread out as much as possible. The D and F students will have only D and F students to copy from, so they won't gain much from copying. Probably not the solution you were looking for, but I think an effective one. Dave
On Saturday, July 27, 2013 1:02:11 PM UTC-5, enchantress wrote: > Given m*n matrix and k students how can they be placed such that cheatig > is minimised. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
