论文标题

课程复杂性与计算机科学计划的质量

Curricular Complexity Versus Quality of Computer Science Programs

论文作者

Heileman, Gregory L., Free, Hayden W., Flynn, Johnny, Mackowiak, Camden, Jaromczyk, Jerzy W., Abdallah, Chaouki T.

论文摘要

在这篇研究论文中,我们描述了一项研究,该研究涉及测量计算机科学部门提供的本科课程的复杂性,然后将其与这些部门的质量进行比较,在这些部门的质量中,质量由基于度量的排名系统确定。该研究的目的是确定计算机科学部门质量与他们提供的课程的复杂性之间是否存在关系。在本科电气工程计划的情况下,先前研究了课程复杂性与计划质量之间的关系,结果令人惊讶。已经发现,如果美国新闻与世界报告最佳本科课程排名被用作质量的代理,那么在较高和较低质量的电气工程计划之间存在统计学上的课程复杂性差异。此外,发现更高质量的电气工程计划往往具有较低的复杂性课程,反之亦然。在本文报道的研究中,收集了足够数量的数据,以确定本科计算机科学部门的计划质量和课程复杂性之间的反比关系也存在。这就提出了一个有趣的问题,即这种现象在跨学科范围内存在的程度。

In this research paper we describe a study that involves measuring the complexities of undergraduate curricula offered by computer science departments, and then comparing them to the quality of these departments, where quality is determined by a metric-based ranking system. The study objective was to determine whether or not a relationship exists between the quality of computer science departments and the complexity of the curricula they offer. The relationship between curricular complexity and program quality was previously investigated for the case of undergraduate electrical engineering programs, with surprising results. It was found that if the US News & World Report Best Undergraduate Programs ranking is used as a proxy for quality, then a statistically significant difference in curricular complexities exists between higher and lower quality electrical engineering programs. Furthermore, it was found that higher quality electrical engineering programs tend to have lower complexity curricula, and vice versa. In the study reported in this paper, a sufficient amount of data was collected in order to determine that an inverse relationship between program quality and curricular complexity also exists in undergraduate computer science departments. This brings up an interesting question regarding the extent to which this phenomenon exists across the spectrum of STEM disciplines.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源