• DocumentCode
    2343850
  • Title

    An L-Tree Based Analysis of E-lessons

  • Author

    Bahrami, Azita

  • Author_Institution
    Dept. of Inf. Technol., Armstrong Atlantic State Univ., Savannah, GA
  • fYear
    2007
  • fDate
    2-4 April 2007
  • Firstpage
    329
  • Lastpage
    334
  • Abstract
    Logical structure of an e-lesson may be viewed from three different perspectives of absolute, teacher and learner, which may be represented as A-tree, T-tree, and L-tree, respectively. Building an A-tree is extremely difficult, if not impossible. A T-tree can be built by a teacher for a class. An L-tree can be built by a learner with guidance of a teacher. In this paper, the inherent properties of A and L trees are utilized to answer some crucial questions any e-lesson developer encounters. These questions are: (a) how are needed new modules for an e-lesson identified and used, (b) how are redundant modules in an e-lesson identified and discarded, (c) how and when should an e-lesson be broken into two or more e-lessons, and (d) How is the level of preparedness of two groups of learners for receiving a new e-lesson compared
  • Keywords
    educational computing; trees (mathematics); A-tree; L-tree; T-tree; e-learning; e-lessons; logical structure; Buildings; Electronic learning; Information technology; Monitoring;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology, 2007. ITNG '07. Fourth International Conference on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    0-7695-2776-0
  • Type

    conf

  • DOI
    10.1109/ITNG.2007.35
  • Filename
    4151705