ans_cnt;ii++) {
- if (p->ans_type == ANSWER_IS_FORMULA) {
+ if (p->ans_type == ANSWER_IS_FORMULA) {
+ /* first answer is stored in p, the rest are linked off of p->ans_list */
sprintf(buf,"Answer %d of %d:\n",ii+1,p->ans_cnt,q_idx+1,ii+1);
+ } else {
+ sprintf(buf,"
Answer %d of %d:\n",ii+1,p->ans_cnt,q_idx+1,ii+1);
+ }
+ append_qtext(buf);
+ for(ii=1, ai=p->ans_list;iians_cnt;ai=ai->ans_next,ii++) {
+ if (ai->ans_type == ANSWER_IS_FORMULA) {
+ sprintf(buf,"Answer %d of %d:\n",ii+1,p->ans_cnt,q_idx+1,ii+1);
} else {
sprintf(buf,"
Answer %d of %d:\n",ii+1,p->ans_cnt,q_idx+1,ii+1);
}
@@ -1886,7 +1890,9 @@ char buf[MAX_BUFFER_SIZE];
}
/* returns a -1 if there were not enough answers, otherwise the number of responses
- for the question is returned*/
+ for the question is returned
+ !!!!!AS A SIDEEFFECT IT ALSO CROPS ANSWERS TO ANSWER_STRING_LENG!!!!!!!
+*/
int gather_answers(char ***ans,int q_idx,Problem_t *p)
{
int cnt;
@@ -1896,6 +1902,7 @@ int gather_answers(char ***ans,int q_idx
sa_p= g_stu_ans_pp[q_idx+1];
for(i=0;((ians_cnt)&&(sa_p));i++){
ans[0][i]=sa_p->a_str;
+ if ((strlen(ans[0][i])+1) > ANSWER_STRING_LENG) ans[0][i][ANSWER_STRING_LENG]='\0';
sa_p=sa_p->a_next;
}
cnt=p->ans_cnt;
@@ -1903,19 +1910,21 @@ int gather_answers(char ***ans,int q_idx
} else {
*ans=(char**)capa_malloc(p->ans_cnt,1);
ans[0][0]=g_stu_ans_pp[q_idx+1]->a_str;
+ if ((strlen(ans[0][0])+1) > ANSWER_STRING_LENG) ans[0][0][ANSWER_STRING_LENG]='\0';
cnt=1;
}
return cnt;
}
+/*logging user's answer when it is passed due.*/
void
log_user_ans(int q_idx,Problem_t *p)
{
char **ans;
int cnt;
if (p->ans_type==ANSWER_IS_SUBJECTIVE) {
- capa_set_subjective(g_login_set,q_idx+1,g_student_number,
- g_stu_ans_pp[q_idx+1]->a_str);
+ /*capa_set_subjective(g_login_set,q_idx+1,g_student_number,
+ g_stu_ans_pp[q_idx+1]->a_str);*/
} else {
if (-1 != (cnt=gather_answers(&ans,q_idx,p))) {
switch( capa_check_answers(p,ans,cnt) ) {
@@ -1993,7 +2002,7 @@ int tries;
submit_subjective(q_idx,p);
return;
}
-
+
cnt=gather_answers(&ans,q_idx,p);
if (cnt == -1) {
g_tried[q_idx]--;
@@ -2185,7 +2194,8 @@ char *class_dir;char *class;char *studen
set_score, /* Score on a set */
term_score=0, /* Total points received */
term_valid=0, /* Total points possible */
- result;
+ result,
+ tot_num_sets=0;
T_entry entry; /* Database entry for a set */
char buf[MAX_BUFFER_SIZE]; /* Output line buffer */
char buf2[MAX_BUFFER_SIZE]; /* Output line buffer */
@@ -2200,7 +2210,7 @@ char *class_dir;char *class;char *studen
fprintf(stdout,"Unable to complete actions.\n");
return;
}
-
+ printf("");
sprintf(class_fullpath,"%s/%s",class_dir,class);
chdir(class_fullpath);
configResult=read_capa_config("web_status_line_length",buf);
@@ -2221,9 +2231,18 @@ char *class_dir;char *class;char *studen
for (set_idx=1; set_idx<=set; set_idx++) {
g_inhibit_response=capa_check_option(OPTION_INHIBIT_RESPONSE,set_idx,
g_student_data.s_sec);
- if (g_inhibit_response > 0) continue;
+ if (g_inhibit_response > 0) {
+ printf("\n",set_idx);
+ continue;
+ }
+ if ( capa_check_date(CHECK_OPEN_DATE,g_student_number,
+ g_student_data.s_sec,set_idx) < 0 ){
+ printf("\n",set_idx);
+ continue;
+ }
if (capa_get_header(&header,set_idx)) return;
+ tot_num_sets++;
capa_get_entry(&entry,student_number,set_idx);
sscanf(header.num_questions,"%d", &(question_cnt) );
valid_wgt = 0; set_score = 0;
@@ -2267,7 +2286,11 @@ char *class_dir;char *class;char *studen
printf("\n\n
\n");
/* SHOW TOTALS */
/* if capalogin_show_summary_score is set to none don't show it */
- sprintf(buf,"%d sets, total = %3d/%3d (%d%%)\n", set, term_score, term_valid, 100*term_score/term_valid);
+ if (term_valid > 0) {
+ sprintf(buf,"%d sets, total = %3d/%3d (%d%%)\n", tot_num_sets, term_score, term_valid, 100*term_score/term_valid);
+ } else {
+ sprintf(buf,"%d sets, total = %3d/%3d\n", tot_num_sets, term_score, term_valid);
+ }
result=read_capa_config("capalogin_show_summary_score",buf2);
if (result != 0 && result != -1) {
if (strcasecmp(buf2,"none")==0) {
@@ -2393,9 +2416,9 @@ FILE *out;
float hw_w, qz_w, ex_w, fe_w, pc_w;
int idx, entry_count, tmp_len;
float *S, *F;
- int *X;
+ int *X; /* array controlling whether to extrapolate scores */
char *capa_server;
- int max_set[4];
+ int max_set[4], width=600,height=750; /* width and height of applet*/
char **c_path_pp;
/*Unused Vars
@@ -2448,6 +2471,9 @@ FILE *out;
return;
}
+
+ get_tscore_width_height(&width,&height);
+
c_path_pp = (char **)capa_malloc( 4, sizeof(char *));
tmp_len = strlen(class_fullpath) + 1;
c_path_pp[0] = (char *)capa_malloc(tmp_len,sizeof(char));
@@ -2488,12 +2514,14 @@ FILE *out;
c_path_pp[2] = (char *)capa_malloc( (tmp_len),sizeof(char));
sprintf(c_path_pp[2],"%s",buf);
max_set[2] = check_class_get_maxset(c_path_pp[2]);
+ printf("\n",c_path_pp[2],max_set[2]);
if( max_set[2] <= 0 ) {
- /* should we continue ? */
- max_set[2] = 0;
- for(idx=2;idx <= (fs*2); idx++) {
+ /* no sets */
+ max_set[2] = 0;
+ }
+ /* start extrapolation with sets that don't yet exist */
+ for(idx=2+(max_set[2]*2);idx <= (fs*2); idx++) {
X[idx] = 1;
- }
}
} else { /* if exam_path is not in capa.config, then skip exams */
fs = 0;
@@ -2540,15 +2568,24 @@ FILE *out;
term_score += set_score;
capa_mfree(header.weight);
capa_mfree(header.partial_credit);
+ printf("\n",c_path_pp[idx],set_score,valid_wgt);
if(idx==2) { /* exam sets */
S[set_idx*2] = (float)set_score;
F[set_idx*2] = (float)valid_wgt;
- X[set_idx*2] = 0;
+ if (valid_wgt == 0) {
+ X[set_idx*2] = 1;
+ } else {
+ X[set_idx*2] = 0;
+ }
}
if(idx==3) { /* correction sets */
S[set_idx*2+1] = (float)set_score;
F[set_idx*2+1] = (float)valid_wgt;
- X[set_idx*2+1] = 0;
+ if (valid_wgt == 0 ) {
+ X[set_idx*2+1] = 1;
+ } else {
+ X[set_idx*2+1] = 0;
+ }
}
}
if( (idx == 0) || (idx==1) ) { /* homeworks and quizzes */
@@ -2563,7 +2600,7 @@ FILE *out;
fprintf(out,"\n");
- fprintf(out,"