--- loncom/publisher/testbankimport.pm 2008/04/17 15:58:45 1.13
+++ loncom/publisher/testbankimport.pm 2008/06/05 01:24:59 1.14
@@ -1,5 +1,5 @@
# Handler for parsing text upload problem descriptions into .problems
-# $Id: testbankimport.pm,v 1.13 2008/04/17 15:58:45 raeburn Exp $
+# $Id: testbankimport.pm,v 1.14 2008/06/05 01:24:59 raeburn Exp $
#
# Copyright Michigan State University Board of Trustees
#
@@ -456,8 +456,8 @@ The Testbank Upload utility can b
All questions (including question text and all foils) must occur before any of the answers. Each question should begin on a new line, and should start with the question number. Questions should be numbered sequentially using a number followed immediately by a space, a period, or enclosed in parentheses, i.e., 1 , 1., (1), 1), or (1 .
Multiple choice and multiple answer correct questions should consist of: (i) the question number followed by (ii) the question text beginning on the same line and (iii) two or more foils, with each foil beginning on a new line and prefixed by a unique letter, or Roman numeral, listed in alphabetic or numeric order, beginning at a (alphabetic) or i (Roman numeral), followed by a period, or enclosed in parentheses, i.e., a., (a), i., or (i).
One or more correct answers should be provided for all questions (although blank answers may be provided for essay questions). Answers should be numbered sequentially, using the same scheme as used for the questions, and must occur after all the questions.
- If fill-in-the-blank or multiple answer questions have more than one correct answer, each answer should appear in a comma-, tab-, space-, or new line-delimited list. For a ranking/ordering question, the "answer" should contain the foil identifiers correctly ordered in a similarly delimited list.
-
+ If fill-in-the-blank or multiple answer questions have more than one correct answer, each answer should appear in a comma-, tab-, space-, or new line-delimited list. For a ranking/ordering question, the "answer" should contain the foil identifiers correctly ordered in a similarly delimited list. If two or more foils have the same ranking, they should occur together, with an equals sign separating equally ranked foils [e.g., (b),(e)=(a),(d),(c)].
+
Five steps are involved in the import process.
- Upload your text file to the server.|);
@@ -1188,19 +1188,58 @@ sub final_display {
$items[$k] =~ tr/A-Z/a-z/;
my @corrects = split/$patterns{$ansrtypes[$i]}/,$items[$k];
foreach my $correct (@corrects) {
- $correct =~s/\W//g;
+ my @tied;
+ if ($qtype[$i] eq "Ord") {
+ if ($correct =~ /=/) {
+ @tied = split(/=/,$correct);
+ for (my $j=0; $j<@tied; $j++) {
+ $tied[$j] =~ s/\W//g;
+ }
+ } else {
+ $correct =~s/\W//g;
+ }
+ } else {
+ $correct =~s/\W//g;
+ }
if ($foilformats[$i] eq "lcperiod" || $foilformats[$i] eq "lcparen" || $foilformats[$i] eq "ucparen" || $foilformats[$i] eq "ucperiod") {
- for (my $j=0; $j<@alphabet; $j++) {
- if ($alphabet[$j] eq $correct) {
- push @{$answers{$k}}, $j;
- last;
+ if (($qtype[$i] eq "Ord") && (@tied > 0)) {
+ my @ties;
+ foreach my $tie (@tied) {
+ for (my $j=0; $j<@alphabet; $j++) {
+ if ($alphabet[$j] eq $tie) {
+ push(@ties,$j);
+ last;
+ }
+ }
+ }
+ my $ans = join('=',@ties);
+ push(@{$answers{$k}},$ans);
+ } else {
+ for (my $j=0; $j<@alphabet; $j++) {
+ if ($alphabet[$j] eq $correct) {
+ push @{$answers{$k}}, $j;
+ last;
+ }
}
}
} elsif (($foilformats[$i] eq "romparen") || ($foilformats[$i] eq "romperiod") || ($foilformats[$i] eq "romoneparen") || ($foilformats[$i] eq "romdotparen")) {
- for (my $j=0; $j<@romans; $j++) {
- if ($romans[$j] eq $correct) {
- push @{$answers{$k}}, $j;
- last;
+ if (($qtype[$i] eq "Ord") && (@tied > 0)) {
+ my @ties;
+ foreach my $tie (@tied) {
+ for (my $j=0; $j<@romans; $j++) {
+ if ($romans[$j] eq $tie) {
+ push(@ties,$j);
+ last;
+ }
+ }
+ }
+ push(@{$answers{$k}},join('=',@ties));
+ } else {
+ for (my $j=0; $j<@romans; $j++) {
+ if ($romans[$j] eq $correct) {
+ push @{$answers{$k}}, $j;
+ last;
+ }
}
}
}
@@ -1451,7 +1490,7 @@ sub file_split {
my %multparts = ();
for (my $i=0; $i<$blocks; $i++) {
if (${$numsref}[$i] > 0) {
- if ((${$qtyperef}[$i] eq "MC") || (${$qtyperef}[$i] eq "MA")) {
+ if ((${$qtyperef}[$i] eq "MC") || (${$qtyperef}[$i] eq "MA") || (${$qtyperef}[$i] eq "Ord")) {
my $splitstr = '';
if (${$foilsref}[$i] eq "lcperiod") {
$splitstr = '[a-z]\.';
@@ -1568,7 +1607,26 @@ sub create_mcq {
|;
for (my $k=0; $k<@{$qstnref}-1; $k++) {
- $output .= " ".${$qstnref}[$k+1]."\n";
+ my $ansval;
+ my $num = 0;
+ for (my $i=0; $i<@{$answerref}; $i++) {
+ if ($$answerref[$i] =~ /=/) {
+ my @tied = split(/=/,$$answerref[$i]);
+ foreach my $tie (@tied) {
+ if ($k == $tie) {
+ $ansval = $num + 1;
+ last;
+ }
+ }
+ $num += scalar(@tied);
+ } elsif ($k == $$answerref[$i]) {
+ $ansval = $num + 1;
+ last;
+ } else {
+ $num ++;
+ }
+ }
+ $output .= " ".${$qstnref}[$k+1]."\n";
}
chomp($output);
$output .= qq|