[LON-CAPA-cvs] cvs: doc /homework lonchart.test_procedure
stredwic
lon-capa-cvs@mail.lon-capa.org
Thu, 27 Jun 2002 19:07:42 -0000
stredwic Thu Jun 27 15:07:42 2002 EDT
Added files:
/doc/homework lonchart.test_procedure
Log:
This the first attempt at a document that outlines a testing procedure for
lonchart.
Index: doc/homework/lonchart.test_procedure
+++ doc/homework/lonchart.test_procedure
lonchart Test Procedure
The procedure will show the validity of the lonchart code. A course
called Chart Test was created to test the possible scenarios due to course
creation. Next a series of false students will take the course. Each student
will perform differently. The number of students will be directly correlated
the number of grade related tests required. The combination of these two sets
of tests will ensure the proper output of lonchart.
The course was designed to test the following: problems in the top
level sequence, problems in a sequece separated by a subsequence, problems with
parts, and the correctness of a single problem resource in general. The course
is laid out beginning with a top sequence containing in order, start, problem,
sequence, problem, and finish resources. The subsequence contains two
problems. The first problem is a general problem containing a simple numeric
response. The second problem contains two parts.
The chart output should contain two columns. The first should have two
problems in it and the second should have three. The headings for these
columns should be the title of the sequences in which they lie.
The following table outlines a series of students and their performance
on homework1 sequence. Each row in the table represents a student in the
course. The combinations of results will test the possible outcomes lonchart
will handle. When the table specifies just correct, it means on the first try.
For the problems in the top sequence, they will all be correct on first try
except for student number two, who didn't didn't log in.
problem 1 problem 2 part1 part2
1. correct(1 try) correct correct
2. skip skip skip
3. 12 tries correct skip
4. correct(2 tries) skip correct
5. + correct after correct first time
skip first
6. - correct first correct after skip first
time
7. . . correct
8. x correct .
9. correct second try . .
after correct by
override on first
try
Expected output:
student top homework 1 totals
1 11 2 111 3 5/5
2
3 11 2 *1 2 4/5
4 11 2 2 1 2 4/5
5 11 2 +?1 ? ?/5
6 11 2 -1? ? ?/5
7 11 2 ..1 1 3/5
8 11 2 x1. 1 3/4
9 11 2 ?.. ? ?/5