Sort:
Open Access Issue
Research on the pedagogical path of AI programming assistants in EDA software development education
Experimental Technology and Management 2026, 43(5): 246-257
Published: 20 May 2026
Abstract PDF (2.4 MB) Collect
Downloads:0
Objective

The teaching of large-scale Electronic Design Automation (EDA) software development faces substantial challenges, including massive codebases, complex architectures, and steep algorithm learning curves, which severely constrain students' engineering practice capabilities. While AI programming assistants such as GitHub Copilot or Cursor offer unprecedented opportunities to transform software engineering education, critical questions remain: How can these tools be rationally integrated into complex software development pedagogy? What are the optimal usage patterns that enhance learning without undermining independent problem-solving capabilities? This study systematically investigates the pedagogical pathways and application boundaries of AI programming assistants in EDA software development education.

Methods

Grounded in progressive capability construction and intelligent augmentation enhancement principles, this research designed a three-tiered task system: source code analysis (tracing Yosys synthesis flow), algorithm comprehension (reverse engineering ABC's And-Inverter Graph rewriting algorithms), and functional extension (developing Yosys statistical commands). A controlled experiment with 30 undergraduate students stratified by programming proficiency involved three groups: Git Hub Copilot–assisted, Cursor-assisted (with Claude 3.5), and non-AI-assisted control. The four-week experiment assessed pre-and posttest task completion quality, time efficiency, comprehension depth, and subjective experience via Likert-scale questionnaires. AI interaction frequencies were logged to analyze usage patterns.

Results

AI-assisted groups demonstrated substantial improvements: task quality increased from 16.9% (Copilot) to 21.2% (Cursor), with Cursor showing particular advantages in architecture analysis (20.3%) and algorithm comprehension (20.7%). Time efficiency gains were remarkable—Cursor reduced completion time by 71.0% and Copilot by 47.3%. Post-test scores measuring deep comprehension increased by 8.7 points (Copilot) and 10.8 points (Cursor), representing 1.9× and 2.3× improvements over the control group's 4.6-point gain. Subjective metrics showed enhanced self-efficacy and reduced frustration. Critically, correlation analysis identified an optimal usage range of 18–22 interactions; students exceeding this threshold exhibited declining performance, suggesting that excessive reliance undermines independent development capabilities.

Conclusions

This study establishes an empirically validated pathway integrating AI programming assistants into EDA education through progressive task design, moderate AI assistance, and process-based monitoring. The findings reposition AI tools as cognitive scaffolds rather than knowledge providers, offering actionable insights for complex software engineering pedagogy and providing empirical evidence for AI integration in computing education.

Regular Paper Issue
Method for Processing Graph Degeneracy in Dynamic Geometry Based on Domain Design
Journal of Computer Science and Technology 2021, 36(4): 910-921
Published: 05 July 2021
Abstract Collect

A dynamic geometry system, as an important application in the field of geometric constraint solving, is widely used in elementary mathematics education; moreover, the dynamic geometry system is also a fundamental environment for automated theorem proving in geometry. In a geometric constraint solving process, a situation involving a critical point is often encountered, and geometric element degeneracy may occur at this point. Usually, the degeneracy situation must be substantively focused on during the learning and exploration process. However, many degeneracy situations cannot be completely presented even by the well-known dynamic geometry software. In this paper, the mechanisms causing the degeneracy of a geometric element are analyzed, and relevant definitions and formalized descriptions for the problem are provided according to the relevant modern Euclidean geometry theories. To solve the problem, the data structure is optimized, and a domain model design for the geometric element and the constraint relationships thereof in the dynamic geometry system are formed; furthermore, an update algorithm for the element is proposed based on the novel domain model. In addition, instances show that the proposed domain model and the update algorithm can effectively cope with the geometric element degeneracy situations in the geometric constraint solving process, thereby achieving unification of the dynamic geometry drawing and the geometric intuition of the user.

Total 2