Abstract: A computer stores a scheduled subset of learning activities. Each learning activity has a duration estimate. The system receives status data indicating a progress of a current learning activity of the scheduled subset. If the status data does not indicate completion of the current learning activity, and the scheduled subset has a sum of duration estimates that exceeds a remaining available teaching time, then the system automatically selects a replacement subset of the learning activities. The replacement subset has a sum of duration estimates that does not exceed the remaining available teaching time. The replacement subset of learning activities is automatically selected by the system based, at least in part, on at least one of: academic standards associated with each of the learning activities; and an importance score associated with each of the learning activities. The system establishes the replacement subset to schedule in place of the scheduled subset.

Abstract: A syllabus editing system is described hereafter for editing a course syllabus. The syllabus editing system aids the user in adjusting what learning objects are included in a syllabus. The system further checks dependency violations in an edited syllabus, where a dependency violation occurs when fundamental concepts for a particular learning object are not presented prior to the particular learning object within the flow of the syllabus. Embodiments provide information about detected dependency violations, information about learning objects that may be used to correct the dependency violations, and information helpful in aiding a user in editing the syllabus intelligently. Furthermore, embodiments provide an option to automatically correct dependency violations. Such an automatic correction involves identifying one or more solutions to the dependency violation.

Abstract: Techniques for teaching geometric proof problems are described. According to one approach, the geometric proof application displays a geometric proof problem and a set of connectable nodes in an initial arrangement. A user then rearranges the set of connectable nodes and connects them using one-way connections to generate a solution. The geometric proof problem is solved if the user-generated solution indicates the correct logical ordering of the set of connectable nodes as determined by the geometric proof application.