HCHongxuan Chen

Hongxuan Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hongxuan Chen has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Novice Difficulties with Graph Problem Reduction in Algorithm Design

    by Hongxuan Chen, Katherine Braught, Geoffrey Herman, Jeff Erickson

  • Open Access

    Student Challenges in Advanced SQL: Misconceptions and Misapplications

    by Sophia Yang, Hongxuan Chen, Geoffrey L. Herman, Abdussalam Alawini

    As demand for data-centric skills grows across various fields, mastering Structured Query Language (SQL) has become increasingly important for both professionals and students. Despite SQL’s English-like syntax, students consistently struggle with advanced concepts like aggregation, joins, and subqueries. While quantitative studies analyzing large student submission datasets identify common errors, they fail to explain the underlying reasons for these difficulties, leaving a critical gap in understanding the root causes of SQL learning challenges. To address this gap, we conducted semi-structured think-aloud interviews with 12 students solving advanced SQL problems, analyzing our data using the Constant Comparative Method to explore how students define and understand SQL concepts, how they apply them in practice, and where understanding and application misalign. Our findings reveal that students confuse similar constructs ( WHERE vs. HAVING , JOIN types, etc.) due to linguistic similarities, over-rely on familiar yet inefficient or incorrect patterns, and demonstrate surface-level understanding of grouping and aggregation concepts, often resorting to trial-and-error and excessive subqueries rather than conceptual reasoning. These findings suggest that effective SQL instruction should provide side-by-side comparisons of similar constructs with identical sample data, teach SQL’s logical execution order explicitly, use query visualization exercises where students trace data transformations step-by-step, and implement scaffolded problem sets that require students to apply different SQL constructs rather than defaulting to familiar approaches.

  • Open Access

    Corrigendum: Teaching Algorithm Design: A Literature Review

    by Jonathan Liu, Seth Poulsen, Erica Goodwin, Hongxuan Chen, Grace Williams, Yael Gertner, Diana Franklin

    This is a corrigendum for the article “Teaching Algorithm Design: A Literature Review” published in ACM Trans. Comput. Educ. 25, 2 Article 17 (May 2025), 20 pages.

  • Open Access

    Measuring Students' Perceptions of an Autograded Scaffolding Tool for Students Performing at All Levels in an Algorithms Class

    by Yael Gertner, Brad Solomon, Hongxuan Chen, Eliot Robson, Carl Evans, Jeff Erickson

  • Open Access

    Teaching Algorithm Design: A Literature Review

    by Jonathan Liu, Seth Poulsen, Erica Goodwin, Hongxuan Chen, Grace Williams, Yael Gertner, Diana Franklin

    Algorithm design is a vital skill developed in most undergraduate Computer Science (CS) programs, but few research studies focus on pedagogy related to algorithms coursework. To understand the work that has been done in the area, we present a systematic survey and literature review of CS Education studies. We search for research that is both related to algorithm design (as described by the ACM Curricular Guidelines) and evaluated on post-secondary-level students. Across all venues we searched prior to July 2024, we only find 102 such papers. We first classify these papers by topic, evaluation metric, evaluation methods, and intervention target. Through our classification, we find a broad sparsity of papers which indicates that many open questions remain about teaching algorithm design. We also note the need for papers using rigorous research methods, as only 43 out of 92 papers presenting quantitative data use statistical tests, and only 16 out of 47 papers presenting qualitative data follow a coding scheme. Only 18 papers report controlled trials. In addition, almost all authors only contribute to one publication, an indication that few groups are specializing on these topics. We then synthesize the results of the existing literature to give insights into what the corpus reveals about how we should teach algorithms. Broadly, we find that much of the literature explores implementing well-established practices, such as active learning or automated assessment, in the algorithms classroom. However, there are algorithms-specific results as well: A number of papers find that students may under-utilize certain algorithmic design techniques, and studies describe a variety of ways to select algorithms problems that increase student engagement and learning. The results we present, along with the publicly available set of papers collected, provide a detailed representation of the current corpus of CS Education work related to algorithm design and can orient further research in the area.


  • Open Access

    Novice Difficulties in Graph Layering for Algorithm Design

    by Hongxuan Chen, Katherine Braught, Geoffrey L. Herman, Jeff Erickson

    Graph data structures and algorithms play an essential role in computer science, and one of the ultimate goals of learning graphs is to solve more complicated algorithm design problems with them. A common way to solve a novel, complex problem is to reduce the problem to a standard graph problem, which often requires modeling a graph, and one essential way to model a graph is a technique called graph layering. Graph layering is often considered difficult by students and rarely studied by computer science education researchers despite its significance in algorithm design. To understand students' struggles with graph layering and improve teaching of algorithm designs, we conducted this qualitative study using think-aloud interviews with current students from an algorithm course. Participants were asked to solve algorithm design problems meant to be solved with graph layering. We used thematic analysis to extract difficulties observed in these interviews. We share our preliminary findings in this poster, and propose next steps for this study and future research.


  • Open Access

    Measuring the Impact of Distractors on Student Learning Gains while Using Proof Blocks

    by Seth Poulsen, Hongxuan Chen, Yael Gertner, Benjamin Cosman, Matthew West, Geoffrey L. Herman

    Background: Proof Blocks is a software tool that enables students to construct proofs by assembling prewritten lines and gives them automated feedback. Prior work on learning gains from Proof Blocks has focused on comparing learning gains from Proof Blocks against other learning activities such as writing proofs or reading. Purpose: The study described in this paper aims to compare learning gains from variations of Proof Blocks. Specifically, we attempt to quantify the difference in learning gains for students who complete Proof Blocks problems with and without distractor lines. Methods: We conducted a randomized controlled trial with three experimental groups: a control group that completed an off-topic Proof Blocks activity, one that completed a Proof Blocks activity without distractor lines, and one that completed a Proof Blocks activity with distractor lines. All three groups read a book chapter on proof by induction before completing their activity. Findings: The group that completed the Proof Blocks activity with distractors performed better on the posttest than the group that completed the Proof Blocks without distractors, who in turn performed better than the group that completed the off-topic Proof Blocks activity. However, none of these differences were statistically significant. While the results are consistent with the idea that distractors could be beneficial for learning, future work will need to confirm.


  • Open Access

    Teaching Algorithm Design: A Literature Review

    by Jonathan Liu, Seth Poulsen, Hongxuan Chen, Grace Williams, Yael Gertner, Diana Franklin

    Algorithm design is a vital skill developed in most undergraduate Computer Science (CS) programs, but few research studies focus on pedagogy related to Algorithms coursework. To understand the work that has been done in the area, we present a systematic survey and characterization of existing studies in the CS Education literature related to the teaching of algorithm design at the undergraduate level. Across all papers in the ACM Digital Library, we only find 97 applicable papers. We classify these papers by topic, evaluation metric, evaluation methods, and intervention target. We present the results of these classifications alongside insights about existing knowledge, rigor, and contribution rates. We hope that this work not only provides a detailed representation of the current corpus of CS Education work related to algorithm design but also demonstrates that the body of knowledge is sparse and supports further research in the area. For future work, we intend to investigate and synthesize the conclusions reached by these papers.


  • Open Access

    Implementation of Split Deadlines in a Large CS1 Course

    by Hongxuan Chen, Ang Li, Geoffrey Challen, Kathryn Cunningham

    Office hour utilization in computer science courses can spike near deadlines, producing long wait times, frustrated students, and over-worked staff. To address this problem, a large CS1 course implemented a split deadlines policy. Students were randomly divided into two groups with staggered release and due dates. Each group had the same amount of time to complete assignments, but the number of students with each due date was reduced by half. Our study evaluates the effectiveness of this policy. We measure office hour utilization and staff efficiency near deadlines, examine the policy's impact on student performance, and investigate student perception of the policy's fairness and effectiveness. Overall we found that the split deadline policy increased office hour efficiency, resulted in no significant difference in performance between groups, and was considered fair and effective by most students. Our experience report includes reflections and student feedback indicating how to implement and further improve similar policies.


  • Open Access

    Disentangling the Learning Gains from Reading a Book Chapter and Completing Proof Blocks Problems

    by Seth Poulsen, Yael Gertner, Hongxuan Chen, Benjamin Cosman, Matthew West, Geoffrey L. Herman

    Background : Proof Blocks is a software tool that enables students to construct proofs by assembling prewritten lines and gives them automated feedback. Prior research has shown that students learn as much from an activity where they use Proof Blocks as where they write proofs. However, in both cases students first read a book chapter. Prior research was not able to differentiate between the learning gains achieved from reading versus proof practice. Purpose : This study aims to measure learning gains from reading a book chapter versus completing Proof Blocks. Methods : We conducted a randomized controlled trial with three experimental groups: one that only read a book chapter, one that only completed Proof Blocks, and one that did both. Findings : The group that completed only Proof Blocks had the smallest learning gains. The group that read the book chapter and completed the Proof Blocks activity performed marginally better than students who only read the book chapter, but it is not clear if the source of this improvement was the Proof Blocks or just exposure to more examples.