--- capa/capa51/GUITools/grader.funct.c 1999/09/28 21:25:36 1.1.1.1 +++ capa/capa51/GUITools/grader.funct.c 2000/11/06 22:52:51 1.6 @@ -1,11 +1,34 @@ +/* interfaces to the C portions of CAPA for grader + Copyright (C) 1992-2000 Michigan State University + + The CAPA system is free software; you can redistribute it and/or + modify it under the terms of the GNU General Public License as + published by the Free Software Foundation; either version 2 of the + License, or (at your option) any later version. + + The CAPA system is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public + License along with the CAPA system; see the file COPYING. If not, + write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. + + As a special exception, you have permission to link this program + with the TtH/TtM library and distribute executables, as long as you + follow the requirements of the GNU GPL in regard to all of the + software in the executable aside from TtH/TtM. +*/ + /* * grader.funct.c - * Copyright Guy Albertelli II 1996 - * Portions Copyright Issac Tsai + * Guy Albertelli II 1996 */ #include #include -#include +#include #include #include #include @@ -209,25 +232,6 @@ int capaFindSection(ClientData clientdat return TCL_OK; } -/* finds how many set.db files there are */ -int howManySetDBFile() -{ - char filename[FNAMELENGTH], *pathName; - int ii; - - - pathName=getcwd(NULL,FNAMELENGTH); - ii=1; - sprintf(filename,"%s/records/set%d.db",pathName,ii); - while(!access(filename, F_OK)) - { - ii++; - sprintf(filename,"%s/records/set%d.db",pathName,ii); - } - free(pathName); - return (ii-1); -} - /* makes a student report * Arguments: the student number */ @@ -1279,7 +1283,7 @@ int capaSetScore (ClientData clientdata, if ( i==(question-1) ) { entry.answers[i]=score+'0'; } else { - entry.answers[i]='-'; + entry.answers[i]='?'; } entry.tries[i*3]='-';entry.tries[i*3+1]='1'; if (i