A program for generating random seating lists

Because of the various sortings to determine rank and the extensive summaries and reports printed, the total process can take several hours for a lare...
0 downloads 0 Views 1MB Size
changes are made when a new set of exam scores are entered. Students generally give this detailed method of grade analysis high scores on class evaluations. They appreciate the frequent .. updates on their performance. The program itself is highly interactive, and the operator does not need anv knowledee of how the svstem works. Once a command is given, the computer automatically carries it out. Because of the various sortings to determine rank and the extensive summaries and reports printed, the total process can take several hours for a laree class. For example. after a recent examination of 165 studknts, two hours wereneeded to process the raw scores, print all reports, and post student results. ORGANIZR was written using a 48K RAM Radio Shack TRS-80 Model I with two disk drives. Level I1 BASIC. and DISK BASIC enhancements. In order to conserve memory, the original oroeram was comnacted bv deletine unnecessarv spacesand "sing multiple sfatement lines. f a d i o ~ h a c k ; s SCRIPSIT word processing program is particularly convenient for this type of edit-compacting. The current program will handle over 180 students with five raw scores each. corresponding standard scores and ranks, total score, and grade. The program requires approximately 12K bytes and clears about 24K bytes for character handling. Since the typical disk operating systems for the Model I TRS-80 plus the DISK BASIC require about 12K bytes, the machine is close to its 48K byte memory limit. A variation of this program permits six exam scores to be stored; the numher of students handled is reduced to a ~ ~ r o x i m a t e150. l v The two versions are referred a i d ORGANIZRlMO6 handling five to as ORGAN~ZRIMO~ and six exams, respectively. A listing is available for $10 (specify M05 or M06). A copy of the program on floppy disk (specify M05 or M06 and TRSDOS or NEWDOSl80) can he ohtained for $16. Make checks payable to the author. ~

~

~

~~

~.~~~~~

A Program for Generating Random Seating Lists Michael Gold and Keith M. Wellman University of Miami Coral Gables. FL 33124 As most faculty will attest, when it comes to seating arraneements for an examination. students do not choose random seating nor do they "spread" themselves out no matter how manv excess seats are available. In order to solve this prohlem,-a program (SEATLIST) has been developed in BASIC to prepare any numher of random seating charts. SEATLIST has a main menu which includes the choices: (1) creation of a file of student names, (2) creation of a file of seat numhers, (3) preparation of a random seating chart, and (4) creation of file directories. Each semester we create the desired student name files for various classes-a class of 100 student names typically can he entered in ten minutes from the kevboard. Provision is made for editing a file of names as necessary. In a similar manner, files of seats are entered. Since each file of seats is eiven a different file name, it is possible to have numerous ;eat arrangements for any one room. A particular seating arrangement is determined by the order in which the seats are entered. Commonly, we start with every other seat in alternate rows. If more seats are required, the remaining seats of a row are used leaving alternate rows empty. If it is desired to seat two different classes using the same room simultaneously, it is simply necessary to use alternate seat files for the two classes. I t is convenient to prepare multiple random seating lists to suffice for the whole semester. If desired, an alphabetical (nonrandom) seating list can be prepared. This is useful occasionally in order to permit faculty to locate easily and identify students in large classes. SEATLIST automatically maintains and updates directories (a file of file names) of the classes on file and the seat files. The directories include a hrief description of each class

-

and seat arrangement. The seat files are permanent if desired; class files are normally killed at the end of each semester. File structures utilize suhrecords in order to conserve disk mace: . , however, they can he accessed by other software and are easily adapted to other uses. The modular desien of the . Droeram faciiitates the incorporation of new appli&tions in the main program. The program is highly interactive and eliminates the need for the operator to have any special knowledge of the svstem. Once a command is given the program proceeds autom&ically without further input from the operator. Students readily accept a new seating chart for each exam; they appreciate the extra security provided. SEATLIST was written using a 48K RAM Radio Shack TRS-80 Model I with two disk drives, Level I1 BASIC, and DISK BASIC enhancements. The Droeram reauires about 7K . .. bytes niemory and clet~rsl > K bytes ior sharac~erhandling. Each directorv can hold 23 tmrlrs (class or room identifiers) and up to 200 entries in each fi1e.A listing is available h i sending a check for $3 to cover postage and handling to Keith M. Wellman. A copy of the program on floppy disk (specify TRSDOS or NEWDOSISO system) can he ohtained for $10 to cover postage, disk, and a technical service charge. Make checks payable to University of MiamiIChemistry Department.

~ssi~nme~ n t~ s t c m John Morris Miami-Dade Community College 11011 S. W. 104th Street Miami, FL 33176

The use of homework assignments has many advantages, but in laree classes eradine the . Daoers . and recordine the results is a Zifficult a& time-consuming task. 1f students copy from each other, the grades are of little value. The MiamiDade Homework System (MDHS) addresses these problems. I t encourages good study habits and attendance in laree clasws hy ; ~ r o & l i nindi;irlualiled ~ homework assignmenir for which the students receive credit. The system grades the homework, awards points for correct answers, andtahulates the results. 3. Eachsheet A tvnical .. assienment sheet is shown in Fieure " is numbered with an assignment numher and aversion number so that each student receives a unique assignment. The problems are varied by random selection of numhers and names a ~ ~ e a r i in n ethe ~roblems.The noint value of each pro hi em'^! givenin parentheses below the prubiem number. Points earned hv studentsare added to the total of their test scores. To encourage attendance, the homework assignments are given out onlv in class on unspecified davs. If students miss class, they miss t h e oppnrtunit; to earn the extra points. After students have worked the problems, they express the answers in exponential notation and mark them on the special cards illustrated in Figure 4. The students also mark their student numher, the assignment numher, and the version numher. Proper marking of the card is considered part of the problem, and students do not receive credit for incorrectly marked cards. When students turn in their answer cards, they also fill out and turn in the coupon printed at the bottom of the assignment sheet. This coupon has the assignment number and version number in seven places and also the date of printing. MDHS counts and pribts out the number of times every version is printed. This number should never be greater than one. The coupon is used to verify version numbers& case two or more students report the same version number. A table of the correct answers to all the versions is posted soon after the answer cards have been collected. This provides the students with prompt feedback and also precludes late turning in of answer cards.

-

-

Volume 59

~~

Number 7

July 1982

~~~

~

~~~

603