Broadening participation in computerscience has been widely studied, creating many different techniques to attract, motivate, and engage students. A common meta-strategy is to use an outside domain as a hook, using t...
详细信息
ISBN:
(纸本)9798400701382
Broadening participation in computerscience has been widely studied, creating many different techniques to attract, motivate, and engage students. A common meta-strategy is to use an outside domain as a hook, using the concepts in that domain to teach computerscience. These domains are selected to interest the student, but students often lack a strong background in these domains. Therefore, a strategy designed to increase students' interest, motivation, and engagement could actually create more barriers for students, who now are faced with learning two new topics. To reduce this potential barrier in the domain of music, this paper presents the use of automated, immediate feedback during programming activities at a summer camp that uses music to teach foundational programming concepts. The feedback guides students musically, correcting notes that are out-of-key or rhythmic phrases that are too long or short, allowing students to focus their learning on the computerscience concepts. This paper compares the correctness of students that received automated feedback with students that did not, which shows the effectiveness of the feedback. Follow up focus groups with students confirmed this quantitative data, with students claiming that the feedback was not only useful but that the activities would be much more challenging without the feedback.
Many students rely on examples when learning to program, but they often face barriers when incorporating these examples into their own code and learning the concepts they present. As a step towards designing effective...
详细信息
ISBN:
(纸本)9798400701382
Many students rely on examples when learning to program, but they often face barriers when incorporating these examples into their own code and learning the concepts they present. As a step towards designing effective example interfaces that can support student learning, we investigate novices' needs and strategies when using examples to write code. We conducted a study with 12 pairs of high school students working on open-ended game design projects, using a system that allows students to browse examples based on their functionality, and to view and copy the example code. We analyzed interviews, screen recordings, and log data, identifying 5 moments when novices request examples, and 4 strategies that arise when students use examples. We synthesize these findings into principles that can inform the design of future example systems to better support students.
Crowd management and analysis(CMA)systems have gained a lot of interest in the vulgarization of unmanned aerial vehicles(UAVs)*** tracking using UAVs is among the most important services provided by a *** this paper,w...
详细信息
Crowd management and analysis(CMA)systems have gained a lot of interest in the vulgarization of unmanned aerial vehicles(UAVs)*** tracking using UAVs is among the most important services provided by a *** this paper,we studied the periodic crowd-tracking(PCT)*** consists in usingUAVs to follow-up crowds,during the life-cycle of an open crowded area(OCA).Two criteria were considered for this *** first is related to the CMA initial investment,while the second is to guarantee the quality of service(QoS).The existing works focus on very specified assumptions that are highly committed to CMAs applications *** study outlined a new binary linear programming(BLP)model to optimally solve the PCT motivated by a real-world application study taking into consideration the high level of *** closely approach different real-world contexts,we carefully defined and investigated a set of parameters related to the OCA characteristics,behaviors,and theCMAinitial infrastructure investment(e.g.,UAVs,charging stations(CSs)).In order to periodically update theUAVs/crowds andUAVs/CSs assignments,the proposed BLP was integrated into a linear algorithm called PCTs *** main objective was to study the PCT problem fromboth theoretical and numerical *** prove the PCTs solver effectiveness,we generated a diversified set of PCTs instances with different scenarios for simulation *** empirical results analysis enabled us to validate the BLPmodel and the PCTs solver,and to point out a set of new challenges for future research directions.
Large language models (LLMs) such as GPT-4 have emerged as promising tools for providing programming feedback. However, effective deployment of LLMs in massive classes and Massive Open Online Courses (MOOCs) raises fi...
详细信息
ISBN:
(纸本)9798400706332
Large language models (LLMs) such as GPT-4 have emerged as promising tools for providing programming feedback. However, effective deployment of LLMs in massive classes and Massive Open Online Courses (MOOCs) raises financial concerns, calling for methods to minimize the number of calls to the APIs and systems serving such powerful models. In this article, we revisit the problem of 'propagating feedback' within the contemporary landscape of LLMs. Specifically, we explore feedback propagation as a way to reduce the cost of leveraging LLMs for providing programming feedback at scale. Our study investigates the effectiveness of this approach in the context of students requiring next-step hints for Python programming problems, presenting initial results that support the viability of the approach. We discuss our findings' implications and suggest directions for future research in optimizing feedback mechanisms for large-scale educational environments.
To broaden participation, competitive programming contests may include beginner-level problems that do not require knowledge of advanced computerscience concepts (e.g., algorithms and data structures). However, since...
详细信息
ISBN:
(纸本)9798400704758
To broaden participation, competitive programming contests may include beginner-level problems that do not require knowledge of advanced computerscience concepts (e.g., algorithms and data structures). However, since most participants have easy access to AI code-generation tools, these problems often become trivial to solve. For beginner-friendly programming contests that do not prohibit the use of AI tools, we propose Probeable Problems: code writing tasks that provide (1) a problem specification that deliberately omits certain details, and (2) a mechanism to probe for these details by asking clarifying questions and receiving immediate feedback. To evaluate our proposal, we conducted a 2-hour programming contest for undergraduate computerscience students from multiple institutions, where each student was an active member of their institution's ACM student chapter. The contest comprised of six Probeable Problems for which a popular code-generation tools (e.g., GitHub Copilot) were unable to generate accurate solutions due to the absence of details. Students were permitted to work individually or in groups, and were free to use AI tools. We obtained consent from 26 groups (67 students) to use their submissions for research. To determine whether Probeable Problems are suitable for such contests, we analyze the extent to which the code submitted by these groups identifies missing details.
In this paper,we investigate the stable matching problem with multiple preferences in bipartite graphs,where each agent has various preference lists for all available partners with respect to different *** problem req...
详细信息
In this paper,we investigate the stable matching problem with multiple preferences in bipartite graphs,where each agent has various preference lists for all available partners with respect to different *** problem requires that each matched agent must have exactly one partner and the obtained matching should be stable for all *** our main contribution,we present an integer linear programming(ILP)model for determining whether there exists a globally stable matching in bipartite graphs,which has been proved to be *** the time consumed for solving ILPs might dramatically increase as the size of instances grows,we develop a preprocessing technique that helps to eliminate pairs that will never be a member of any globally stable matching and thus accelerates the computing *** perform experiments on randomly generated preference lists and observe a significant speedup when we preprocess the instance before solving the *** there does not need to exist a perfect matching that is stable for all given criteria,we extend our ILP to the optimized version of the aforementioned problem,which asks to find a matching with maximum cardinality that is stable among all matched agents.
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an or...
详细信息
ISBN:
(纸本)9798350335873
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of linear inequalities. As our principal contribution we provide a decision procedure for checking if such a system has a real solution, and for computing the minimal/maximal value of a linear objective function over the solution set. We also show undecidability of these problems in case when only integer solutions are considered. Therefore orbit-finite linear programming is decidable, while orbit-finite integer linear programming is not.
Formal Methods (FMs) radically improve the quality of the code artefacts they help to produce. They are simple, probably accessible to first-year undergraduate students and certainly to second-year students and beyond...
详细信息
Formal Methods (FMs) radically improve the quality of the code artefacts they help to produce. They are simple, probably accessible to first-year undergraduate students and certainly to second-year students and beyond. Nevertheless, in many cases, they are not part of a general recommendation for course curricula, i.e., they are not taught - and yet they are valuable. One reason for this is that teaching "Formal Methods" is often confused with teaching logic and theory. This article advocates what we call FM thinking: the application of ideas from Formal Methods applied in informal, lightweight, practical and accessible ways. We will argue here that FM thinking should be part of the recommended curriculum for every computerscience student, for even students who train only in that "thinking" will become much better programmers. However, there will be others who, exposed to those ideas, will be ideally positioned to go further into the more theoretical background: why the techniques work, how they can be automated, and how new ones can be developed. Those students would follow subsequently a specialised, more theoretical stream, including topics such as semantics, logics, verification and proof-automation techniques.
This paper presents a method for building a programming platform for ternary optical computer(TOC). Firstly, the reasons why the existing programming platform can not be directly applied to the ternary optical compute...
详细信息
This paper presents a method for building a programming platform for ternary optical computer(TOC). Firstly, the reasons why the existing programming platform can not be directly applied to the ternary optical computer are analyzed. Then, the theoretical basis and core technologies for building the programming platform of the ternary optical computer are given, including: building a model-simple structured data type computer to express the application characteristics of the ternary optical computer, building an operation-data file containing data and computational requirements, expanding the operation-data file transfer instructions. According to our proposed theory, the implementation mechanism of the TOC programming platform is constructed. Finally, the effectiveness of the programming platform is verified by experiments. The programming platform simplifies the application of the TOC and bridges the gap between the user and the TOC.
This paper presents an approach to authoring a textbook titled Interactive OpenMP programming with the assistance of Large Language Models (LLMs). The writing process utilized state-of-the-art LLMs, including Gemini P...
详细信息
ISBN:
(数字)9783031725678
ISBN:
(纸本)9783031725661;9783031725678
This paper presents an approach to authoring a textbook titled Interactive OpenMP programming with the assistance of Large Language Models (LLMs). The writing process utilized state-of-the-art LLMs, including Gemini Pro 1.5, Claude 3, and ChatGPT-4, to generate the initial structure and outline of the book, as well as the initial content for specific chapters. This content included detailed descriptions of individual OpenMP constructs and practical programming examples. The outline and content have then undergone extensive manual revisions to meet our book goals. In this paper, we report our findings about the capabilities and limitations of these LLMs. We address critical questions concerning the necessity of textbook resources and the effectiveness of LLMs in creating fundamental and practical programming content. Our findings suggest that while LLMs offer significant advantages in generating textbook content, they require careful integration with traditional educational methodologies to ensure depth, accuracy, and pedagogical effectiveness. The Interactive OpenMP programming book is developed with the framework of Jupyter Book, enabling the execution of code within the book from the web browser, providing instant feedback and a dynamic learning experience that stands in contrast to traditional educational resources. The book represents a significant step towards modernizing programming education, offering insights into practical strategies for generating the textbook through advanced AI tools.
暂无评论