A problem generator to learn expression: evaluation in CSI, and its effectiveness
CCSC '01 Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges
Introduction to algorithms
Introduction to the Design and Analysis of Algorithms (2nd Edition)
Introduction to the Design and Analysis of Algorithms (2nd Edition)
Generation of problems, answers, grade, and feedback---case study of a fully automated tutor
Journal on Educational Resources in Computing (JERIC)
Analysis of Algorithms
| Hi-index | 0.00 |
Application based tutors can be an excellent means of improving student learning. It comes as no surprise, therefore, that many such tutors have been developed to aid in the traditionally challenging topics of Computer Science, ranging from introductory programming to more advanced topics. In this paper we describe the first experience using a tutor specifically built to support learning about recursive algorithms, and, more specifically, the time performance analysis of chip-and-conquer, chip-and-be-conquered, and divide-and-conquer algorithms. The software tool was provided to students via Blackboard Vista as a supplement to lecture notes, textbooks, classroom lectures, and practice examples. Assessment includes comparison of test scores after short and limited exposure to the tutor and the scores received by the same student body on the final exam after more extensive exposure to the software. In addition, final exam scores for relevant time analysis questions in sections of the Algorithms courses since 2002 are used to compare the averages of students scores before and after using the tutor. The evaluation confirms the tutor's usefulness in improving student learning.