CASET:面向CS*课程提交的基于简单执行轨迹的复杂度分析
CASET: Complexity Analysis using Simple Execution Traces for CS* submissions
AI总结:
CASET利用动态执行轨迹和无监督机器学习自动分析学生提交程序的时间复杂度,帮助导师无需阅读源码即可识别算法类别,从而改进评分并提供针对性反馈。
摘要:
在CS1或CS2课程中,对学生提交进行自动评分的最常用方法是将其与预定义的测试套件运行,并将结果与参考结果进行比较。然而,当解决方案的正确性超出简单输出(例如用于获得结果的算法)时,此技术无法使用。评分者没有便捷的方法来识别解决问题所用的算法类型。他们必须阅读源代码并理解所实现的算法及其特征,这使得过程繁琐。我们提出CASET(Complexity Analysis using Simple Execution Traces,基于简单执行轨迹的复杂度分析),这是一种利用动态轨迹和无监督机器学习分析算法时间复杂度的新型工具。CASET使导师能够方便地将某个程序的提交分类到不同的时间复杂度篮子中。因此,导师无需逐一阅读学生编写的代码即可识别提交所使用的算法。CASET的分析可用于改进评分,并为那些试图在没有适当算法的情况下匹配结果的提交提供详细反馈,例如硬编码二进制结果、对可见或常见输入进行模式匹配。我们通过计算多种算法类别的时间复杂度(如排序、搜索以及使用动态规划范式的算法)展示了CASET的有效性。
英文摘要:
The most common method to auto-grade a student's submission in a CS1 or a CS2 course is to run it against a pre-defined test suite and compare the results against reference results. However, this technique cannot be used if the correctness of the solution goes beyond simple output, such as the algorithm used to obtain the result. There is no convenient method for the graders to identify the kind of algorithm used in solving a problem. They must read the source code and understand the algorithm implemented and its features, which makes the process tedious. We propose CASET(Complexity Analysis using Simple Execution Traces), a novel tool to analyze the time complexity of algorithms using dynamic traces and unsupervised machine learning. CASET makes it convenient for tutors to classify the submissions for a program into time complexity baskets. Thus, tutors can identify the algorithms used by the submissions without necessarily going through the code written by the students. CASET's analysis can be used to improve grading and provide detailed feedback for submissions that try to match the results without a proper algorithm, for example, hard-coding a binary result, pattern-matching the visible or common inputs. We show the effectiveness of CASET by computing the time complexity of many classes of algorithms like sorting, searching and those using dynamic programming paradigm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。