Algorithms on Graphs: Automatic Course Verification in eLearning
, , , и .
The 10th IASTED International Conference on Signal and Image Processing ~IMSA 2008~, Kailua, Hawaii, (августа 2008)

Intelligent course management and training applications for students design eLearning courses as storyboard graphs whose nodes are elementary training units and whose edges encode dependencies between them. A well-designed storyboard is then able to adapt the course to learner by observing the history of the learning path and propose suitable course elements to the student. However, setting up a storyboard and testing it for correctness and completeness is a tedious task that can be well taken over by the computer, too. Since storyboards are mathematically described as graphs, known algorithms on graphs are readily deployed here and help authors to setup consistent courses. In this article, we introduce our course management ``Marvin'', describe its properties in an eLearning framework designed to run interactive experiments, so called ``Virtual Labs'', and introduce the structure of its courses. We then define the terms correctness and completeness of a course within the system and describe algorithms that help authors to test for these properties.\\
  • @rainerreichel
  • @thomasrichter
К этой публикации ещё не было создано рецензий.

распределение оценок
средняя оценка пользователей0,0 из 5.0 на основе 0 рецензий
    Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)