Automated Feedback in Undergraduate Computing Theory Courses
Automated Feedback in Undergraduate Computing Theory Courses
批准号:
1819546
负责人:
Ivona Bezakova
金额:
$29.94万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2018
资助国家:
美国
项目状态:
已结题
起止时间:
2018-10-01 至 2023-09-30
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Computing theory poses and answers questions such as "Which problems are efficiently computable and which are not?" Answering such questions is important for any computer scientist and for any kind of software development. For example, it is better to determine if a problem is computable before spending a lot of time trying to write a program to solve it. Unfortunately, many students struggle with computing theory, because it is more abstract and mathematical than other computer science topics. As in any other knowledge area, students need to practice to get better at computing theory. A problem is that feedback on their work is not immediate and, while students wait for feedback, they stop interacting with the material. They may have to wait for days, since grading an assignment often takes a lot of instructor time and the instructors may have many assignments to grade. This project will increase the speed and, potentially, the quality of feedback to computing theory students by developing an automated feedback tool. The feedback will tell students whether a solution is correct or not, a convincing reason why an incorrect solution is incorrect, and provide information about the quality of a solution. Students will be able to use this immediate feedback to improve their solutions, get more practice, and increase their understanding of the material. In addition to building the feedback tool, this project aims to conduct research on the feedback tool's effectiveness. This project has the potential to contribute to the education of a strong computing workforce and to support development of students' independent learning skills. Although understanding computing theory concepts is very important, it is challenging. Typically, as a first step, students in computing theory classes learn about various models of computation. To understand more complex computational issues, students need to fully comprehend the possibilities and limitations of these models. JFLAP (Java Formal Languages and Automata Package) is a widespread tool that provides a way for students to interact with these concepts. However, like other interactive tools in this area, it does not provide detailed feedback on student solutions. This project will build a feedback and grading tool on top of JFLAP, to increase the likelihood that the feedback tool will have broad applicability. To accomplish this goal, the project will develop and evaluate the tool in the context of three research areas: (1) Computer Science Education: Do students who use the tool understand theoretical computer science concepts better than students who do not use the tool? (2) Theoretical Computer Science: How can software generate a convincing reason for why a student solution is incorrect? and (3) Artificial Intelligence: How can feedback be given about the quality of a student's solution? The project's research and software development activities will involve ten undergraduate students, who will be recruited with emphasis on including women and deaf/hard-of-hearing students. Thus, the project will directly contribute to these students' scientific and professional development. Project outcomes will be disseminated at scientific conferences and workshops, as well as at the University's innovation fair, which is attended by 35,000 visitors, including middle and high school students. Developing the feedback tool and completing research on its effectiveness has the potential to improve instruction and learning of computing theory.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(32)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
The Complexity of $(P_k,P_{\ell})$-Arrowing
$(P_k,P_{ell})$-箭头的复杂性
DOI:
--
发表时间:
2023
期刊:
Fundamentals of Computation Theory (FCT
影响因子:
--
作者:
[Hassan, Zohair Raza, Hemaspaandra, Edith, Radziszowski, Stanislaw]
通讯作者:
Radziszowski, Stanislaw
Insight into Voting Problem Complexity Using Randomized Classes
使用随机类洞察投票问题的复杂性
DOI:
10.24963/ijcai.2022/42
发表时间:
2022
期刊:
International Joint Conference on Artificial Intelligence (IJCAI
影响因子:
--
作者:
[Fitzsimmons, Zack, Hemaspaandra, Edith]
通讯作者:
Hemaspaandra, Edith
Enumerating Nontrivial Knot Mosaics with SAT (Student Abstract)
用 SAT 枚举非平凡的结马赛克(学生摘要)
DOI:
10.1609/aaai.v36i11.21645
发表时间:
2022
期刊:
Proceedings of the AAAI Conference on Artificial Intelligence
影响因子:
--
作者:
[Miller, Hannah]
通讯作者:
Miller, Hannah
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models
测试图形模型的下限:着色和反铁磁伊弦模型
DOI:
--
发表时间:
2020
期刊:
Journal of machine learning research
影响因子:
6
作者:
[Bezakova, Ivona, Blanca, Antonio, Chen, Zongchen, Stefankovic, Daniel, Vigoda, Eric]
通讯作者:
Vigoda, Eric
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery
使用加权匹配解决2-批准/否决控制和贿赂问题
DOI:
--
发表时间:
2023
期刊:
European Conference on Artificial Intelligence (ECAI
影响因子:
--
作者:
[Fitzsimmons, Zack, Hemaspaandra, Edith]
通讯作者:
Hemaspaandra, Edith
共 28 条
AF: Small: Counting and Sampling Cuts and Paths in Planar and Lattice Graphs
-
批准号:1319987
-
项目类别:Standard Grant
-
资助金额:$10.0万
-
财政年份:2013
-
负责人:Ivona Bezakova
-
依托单位:
Multiplayer Board Game Strategies in the Introductory CS Curriculum
-
批准号:1044721
-
项目类别:Standard Grant
-
资助金额:$19.87万
-
财政年份:2011
-
负责人:Ivona Bezakova
-
依托单位:
国内基金
海外基金
Dynamic Credit Rating with Feedback Effects
-
批准号:--
-
项目类别:外国学者研究基金项目
-
资助金额:--
-
批准年份:2024
-
负责人:Christian Martin Hilpert
-
依托单位: