--- capa/capa51/pProj/capaCgiUtils.c 1999/10/13 18:45:28 1.2 +++ capa/capa51/pProj/capaCgiUtils.c 1999/12/16 22:18:35 1.9 @@ -404,12 +404,9 @@ void w_get_responses(int x,int q_idx,cha sscanf(g_entries[x].name,"INPUT%d",&q_idx); if( q_idx > 0 && q_idx < MAX_PROBLEM_CNT ) { if ( ! is_all_ws(g_entries[x].val) ) { - leng = strlen(g_entries[x].val) + 1; g_stu_ans_pp[q_idx] = (StudentAnswer_t *)capa_malloc(sizeof(StudentAnswer_t),1); (g_stu_ans_pp[q_idx])->a_idx = 1; (g_stu_ans_pp[q_idx])->a_str = strsave(g_entries[x].val); - if (leng > ANSWER_STRING_LENG) - (g_stu_ans_pp[q_idx])->a_str[ANSWER_STRING_LENG] = '\0'; (g_stu_ans_pp[q_idx])->a_next = NULL; trim_response_ws((g_stu_ans_pp[q_idx])->a_str); } @@ -424,11 +421,9 @@ void w_get_responses(int x,int q_idx,cha if( q_idx > 0 && q_idx < MAX_PROBLEM_CNT ) { if ( ! is_all_ws(g_entries[x].val) ) { StudentAnswer_t *sa_p; - leng = strlen(g_entries[x].val) + 1; sa_p = (StudentAnswer_t *)capa_malloc(sizeof(StudentAnswer_t),1); sa_p->a_idx = sub_idx; sa_p->a_str = strsave(g_entries[x].val); - if (leng > ANSWER_STRING_LENG) sa_p->a_str[ANSWER_STRING_LENG] = '\0'; sa_p->a_next = NULL; if( g_stu_ans_pp[q_idx] == NULL ) { g_stu_ans_pp[q_idx] = sa_p; @@ -451,22 +446,18 @@ void w_get_responses(int x,int q_idx,cha if( index(g_entries[x].name, ',' ) == NULL ) { /* only one answer */ sscanf(g_entries[x].name,"LAST%d",&q_idx); if( q_idx > 0 && q_idx < MAX_PROBLEM_CNT ) { - leng = strlen(g_entries[x].val) + 1; sa_p = (StudentAnswer_t *)capa_malloc(sizeof(StudentAnswer_t),1); sa_p->a_idx = 1; sa_p->a_str = strsave(g_entries[x].val); - if (leng > ANSWER_STRING_LENG) sa_p->a_str[ANSWER_STRING_LENG] = '\0'; sa_p->a_next = NULL; g_last_ans_pp[q_idx] = sa_p; } } else { sscanf(g_entries[x].name,"LAST%d,%d",&q_idx,&sub_idx); if( q_idx > 0 && q_idx < MAX_PROBLEM_CNT ) { - leng = strlen(g_entries[x].val) + 1; sa_p = (StudentAnswer_t *)capa_malloc(sizeof(StudentAnswer_t),1); sa_p->a_idx = sub_idx; sa_p->a_str = strsave(g_entries[x].val); - if (leng > ANSWER_STRING_LENG) sa_p->a_str[ANSWER_STRING_LENG] = '\0'; sa_p->a_next = NULL; if( g_last_ans_pp[q_idx] == NULL) { g_last_ans_pp[q_idx] = sa_p; @@ -1043,11 +1034,11 @@ print_mainmenu(class,sn,pin)char *class; fprintf(stdout,"\n"); } outcome = check_termscore_option(); - fprintf(stdout,"\n",outcome); + fprintf(stdout,"\n",outcome); /*Termscore Button*/ if( outcome ) { fprintf(stdout,"
  • ",serverName,g_cgibin_path); + sprintf(buf,"action=\"http://%s/%s/%s/capasbin\">",serverName,g_cgibin_path,g_cowner); fprintf(stdout,"%s\n", buf); fprintf(stdout,"\n",class); fprintf(stdout,"\n",sn); @@ -1454,23 +1445,25 @@ char *class_dir; char *c_owner;char *cla append_qtext("Top"); sprintf(buf,"  Next",question_idx+2); append_qtext(buf); }*/ - q_leng = strlen(prob_idx->question); - if ( !prob_idx->show_br ) { - append_qtext(prob_idx->question); - } else { - for(idx=0;idx= g_qsize ) { - char *temp_text; - g_qsize=g_qchar_cnt*2; - temp_text=capa_malloc(g_qsize,sizeof(char)); - strncpy(temp_text,g_question_txt,g_qsize); - capa_mfree(g_question_txt); - g_question_txt=temp_text; - } - g_question_txt[g_qchar_cnt]=prob_idx->question[idx]; - g_qchar_cnt++; - if(prob_idx->question[idx] == '\n' ) { - append_qtext("
    \n"); + if (prob_idx->question != NULL) { + q_leng = strlen(prob_idx->question); + if ( !prob_idx->show_br ) { + append_qtext(prob_idx->question); + } else { + for(idx=0;idx= g_qsize ) { + char *temp_text; + g_qsize=g_qchar_cnt*2; + temp_text=capa_malloc(g_qsize,sizeof(char)); + strncpy(temp_text,g_question_txt,g_qsize); + capa_mfree(g_question_txt); + g_question_txt=temp_text; + } + g_question_txt[g_qchar_cnt]=prob_idx->question[idx]; + g_qchar_cnt++; + if(prob_idx->question[idx] == '\n' ) { + append_qtext("
    \n"); + } } } } @@ -1567,6 +1560,7 @@ char *class_dir; char *c_owner;char *cla } } +/*if the assignment is passedue we come here to get what the answer was just in case*/ void get_response(char pcr,char u_db,int q_idx,Problem_t *p) { @@ -1683,9 +1677,9 @@ void display_last_subjective(int q_idx) void create_answer_area(Problem_t *p,int q_idx) { - int ii; + int ii=0; char buf[MAX_BUFFER_SIZE]; - + AnswerInfo_t *ai; #ifdef CGI_DBUG fprintf(g_cgi,"Enter create_answer_area() [%d]\n",q_idx); fflush(g_cgi); #endif /* CGI_DBUG */ @@ -1695,9 +1689,16 @@ void create_answer_area(Problem_t *p,int } if ( p->show_ans_box ) { if ( p->ans_op == ANS_AND ) { - for(ii=0;iians_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 +1887,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 +1899,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 +1907,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 +1999,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 +2191,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 +2207,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 +2228,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 +2283,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) { @@ -2383,27 +2403,28 @@ FILE *out; i, /* Question counter */ set_score, /* Score on a set */ term_score=0, /* Total points received */ - term_valid=0, /* Total points possible */ - result; + term_valid=0; /* Total points possible */ T_entry entry; /* Database entry for a set */ char buf[MAX_BUFFER_SIZE]; /* Output line buffer */ - char buf2[MAX_BUFFER_SIZE]; /* Output line buffer */ T_header header; /* Problem set header */ - int question_cnt,valid_wgt, rate,configResult, - status_line_length=DEFAULT_STATUS_LINE_LENGTH,row; + int question_cnt,valid_wgt,configResult; char class_fullpath[ONE_K],*serverName; int hw_c, hw_r, qz_c, qz_r, fs, homework_count, quiz_count; - int ex_c, epc_c; float hw_w, qz_w, ex_w, fe_w, pc_w; int idx, entry_count, tmp_len; float *S, *F; - int *X; - char *capa_server, *qz_p, *ex_p, *epc_p; - int max_set[4]; + int *X; /* array controlling whether to extrapolate scores */ + char *capa_server; + int max_set[4], width=600,height=750; /* width and height of applet*/ char **c_path_pp; - - - + + /*Unused Vars + char buf2[MAX_BUFFER_SIZE]; + char *qz_p, *ex_p, *epc_p; + int ex_c, epc_c, result; + int rate, status_line_length=DEFAULT_STATUS_LINE_LENGTH,row; + */ + serverName=getenv("SERVER_NAME"); if (!serverName) { fprintf(out,"Enviroment variable SERVER_NAME not set.\n"); @@ -2447,6 +2468,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)); @@ -2487,12 +2511,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; @@ -2539,15 +2565,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 */ @@ -2562,7 +2597,7 @@ FILE *out; fprintf(out,"
    \n"); - fprintf(out,"\n",capa_server); + fprintf(out,"\n",capa_server,width,height); fprintf(out,"\n", hw_w); fprintf(out,"\n", qz_w); fprintf(out,"\n", ex_w); @@ -2606,7 +2641,28 @@ FILE *out; capa_mfree((char *)capa_server); } - +void +get_tscore_width_height(width,height) +int *width;int *height; +{ + char buf[MAX_BUFFER_SIZE]; + int configResult; + + configResult=read_capa_config("tscore_width",buf); + if (configResult != 0 && configResult != -1 ) { + sscanf(buf,"%d", width); + if (*width <= 0 ) { *width = DEFAULT_WIDTH; } + } else { + printf("\n",configResult); + } + configResult=read_capa_config("tscore_height",buf); + if (configResult != 0 && configResult != -1 ) { + sscanf(buf,"%d", height); + if (*height <= 0 ) { *height = DEFAULT_HEIGHT; } + } else { + printf("\n",configResult); + } +} int get_termscore_params(hw,qw,ew,fw,pw,hc,qc,fs)