首页> 外文期刊>Journal of Interpolation and Approximation in Scientific Computing >Assessing the Effectiveness of a Single Curriculum for a Group of Students with Different Mathematics Literacy
【24h】

Assessing the Effectiveness of a Single Curriculum for a Group of Students with Different Mathematics Literacy

机译:评估单一课程对不同数学素养的学生的有效性

获取原文
           

摘要

In recent years, applicants to Azad universities are different than those in last years. This difference arose from the unequal ability in learning mathematics by students. Traditionally university students were K-12 graduates and because of severe competition to enter the university, they had equivalent math literacy. In contrast recent applicants to universities have been graduated from different majors in high school in different past years. Since passing more years after graduating from high school causes degradation in math literacy, this kind of applicants has more divergent math literacy. When having university students with more divergent math literacy, it may be required to have different syllabus for different students at the same course. In this paper we model the learning phases of a math course as a network in which the arcs are sub-topics and the logical precedence between arcs exhibits the prerequisite relation between sub-topics. The ability to accomplish the course is equal to pass all sub-topics. This problem can be modeled as finding the shortest path in a network with probabilistic arc lengths. Traditionally, finding the shortest path in a probabilistic network is done with PERT. Since PERT is known to be over optimistic, we have developed a new method to find a more realistic estimate for completion time in the network on sub-topics in a course.
机译:近年来,阿扎德大学的申请者与去年不同。这种差异是由于学生在学习数学方面的能力不平等而引起的。传统上,大学生是K-12毕业生,由于进入大学的激烈竞争,他们具有同等的数学素养。相反,最近的大学申请者在过去的几年中是从高中的不同专业毕业的。由于高中毕业后的更多年时间会导致数学素养的下降,因此这类申请人的数学素养差异更大。当大学生的数学素养差异更大时,可能要求在同一课程中针对不同学生的教学大纲有所不同。在本文中,我们将数学课程的学习阶段建模为一个网络,其中弧是子主题,弧之间的逻辑优先级表现出子主题之间的前提关系。完成课程的能力等同于通过所有子主题。可以将此问题建模为在具有概率弧长的网络中找到最短路径。传统上,在概率网络中找到最短路径是通过PERT完成的。由于众所周知PERT过于乐观,因此我们开发了一种新方法,可以在网络上针对课程中的子主题找到更完整的完成时间估算。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号