Relationship between complexity of information and difficulty of example-oriented textbooks

被引:0
|
作者
Kuwabara, Tsuneo [1 ]
机构
[1] NTT Access Network Systems Lab, Ibaraki, Japan
来源
Systems and Computers in Japan | 1998年 / 29卷 / 08期
关键词
Education - Information science;
D O I
暂无
中图分类号
学科分类号
摘要
A new method is proposed for rating the complexity of the information in an example-oriented textbook. Quantitative relations are studied between the proposed complexity and difficulty of understanding the textbook. The complexity of the information in the textbook is rated in terms of an information unit newly defined in this paper by the deformation of propositions. These information units are propositions that were previously unfamiliar to the learners using the textbook. In the case of causal relations among propositions, the number of preconditions affects the complexity of information and the number of preconditions is adopted as an attribute of the information unit (the `dimension' of the information unit) and are reflected in the rating of complexity of information. The difficulty of the textbook is indexed by the error rate of the answers to its exercises. A serial model is proposed in which the understanding of one learning item is achieved when every information unit included in the item is understood with no errors. We attempt to relate the complexity of the information and difficulty of learning quantitatively. By learning experiments using a C language textbook, the validity of the model and its usefulness are demonstrated. From the results of experiments, the difficulty increase corresponds to the increase in the number of information units and the number of preconditions.
引用
收藏
页码:9 / 18
相关论文
共 50 条
  • [21] A SURPRISING RELATIONSHIP BETWEEN DESCRIPTIVE COMPLEXITY AND PROOF COMPLEXITY
    Chen, Yijia
    Flum, Joerg
    Mueller, Moritz
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2022, 2022 (138): : 145 - 152
  • [22] THE RELATIONSHIP BETWEEN WORD COMPLEXITY AND COMPUTATIONAL COMPLEXITY IN SUBSHIFTS
    Pavlov, Ronnie
    Vanier, Pascal
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2021, 41 (04) : 1627 - 1648
  • [23] THE AMBIGUOUS COMPLEXITY OF LATIN-AMERICA AND THE DIFFICULTY OF DESCRIBING ITS RELATIONSHIP TO THE RISORGIMENTO
    ALBONICO, A
    RISORGIMENTO, 1995, 47 (1-2): : 400 - 436
  • [24] Untangling search task complexity and difficulty in the context of interactive information retrieval studies
    Wildemuth, Barbara
    Freund, Luanne
    Toms, Elaine G.
    JOURNAL OF DOCUMENTATION, 2014, 70 (06) : 1118 - 1140
  • [25] THE RELATIONSHIP BETWEEN TASK DIFFICULTY AND PALMAR SKIN RESISTANCE
    Freeman, G. L.
    Giese, W. J.
    JOURNAL OF GENERAL PSYCHOLOGY, 1940, 23 (01): : 217 - 220
  • [26] Regarding the relationship between mild pancreatitis and difficulty of cholecystectomy
    da Costa, David W.
    Besselink, Marc G.
    HPB, 2019, 21 (07) : 933 - 933
  • [27] Exploring the Relationship Between Programming Difficulty and Web Accesses
    Long, Dun
    Wang, Kun
    Carter, Jason
    Dewan, Prasun
    2018 IEEE SYMPOSIUM ON VISUAL LANGUAGES AND HUMAN-CENTRIC COMPUTING (VL/HCC), 2018, : 131 - 135
  • [29] Application-oriented storage: Geographic information systems as an example
    Zeng, Lingfang
    Feng, Dan
    Wang, Fang
    Tian, Lei
    Shi, Zhan
    Journal of Information and Computational Science, 2007, 4 (02): : 859 - 870
  • [30] The Relationship between Multiplicative Complexity and Nonlinearity
    Boyar, Joan
    Find, Magnus Gausdal
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 130 - 140