Prasun Dewan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Prasun Dewan has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Samuel George
Department of Computer Science, University of North Carolina at Chapel Hill, United States
3 shared publications - Andrew Wortas1 shared publication
- Chandler Robinson
Department of Computer Science, University of North Carolina at Chapel Hill, United States
1 shared publication Charles L. Isbell
1 shared publication- Charles Lee Isbell
Georgia Institute of Technology
1 shared publication - Gabriel Schell
Department of Computer Science, University of North Carolina at Chapel Hill, United States
1 shared publication
Latest Publications
- Open Access
- 18 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 74-77
Human-AI Collaboration in a Student Discussion Forum
- 18 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 74-77
Open AccessHuman-AI Collaboration in a Student Discussion Forum
- Open Access
- 18 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 62-65
NotebookGPT – Facilitating and Monitoring Explicit Lightweight Student GPT Help Requests During Programming Exercises
The success of GPT with coding tasks has made it important to consider the impact of GPT and similar models on teaching programming. Students’ use of GPT to solve programming problems can hinder their learning. However, they might also get significant benefits such as quality feedback on programming style, explanations of how a given piece of code works, help with debugging code, and the ability to see valuable alternatives to their code solutions. We propose a new design for interacting with GPT called Mediated GPT with the goals of (a) providing students with access to GPT but allowing instructors to programmatically modify responses to prevent hindrances to student learning and combat common GPT response concerns, (b) helping students generate and learn to create effective prompts to GPT, and (c) tracking how students use GPT to get help on programming exercises. We demonstrate a first-pass implementation of this design called NotebookGPT.
- 18 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 62-65
Open AccessNotebookGPT – Facilitating and Monitoring Explicit Lightweight Student GPT Help Requests During Programming Exercises
The success of GPT with coding tasks has made it important to consider the impact of GPT and similar models on teaching programming. Students’ use of GPT to solve programming problems can hinder their learning. However, they might also get significant benefits such as quality feedback on programming style, explanations of how a given piece of code works, help with debugging code, and the ability to see valuable alternatives to their code solutions. We propose a new design for interacting with GPT called Mediated GPT with the goals of (a) providing students with access to GPT but allowing instructors to programmatically modify responses to prevent hindrances to student learning and combat common GPT response concerns, (b) helping students generate and learn to create effective prompts to GPT, and (c) tracking how students use GPT to get help on programming exercises. We demonstrate a first-pass implementation of this design called NotebookGPT.
- Open Access
- 18 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 54-57
Assistant Dashboard Plus – Enhancing an Existing Instructor Dashboard with Difficulty Detection and GPT-based Code Clustering
As interest in programming as a major grows, instructors must accommodate more students in their programming courses. One particularly challenging aspect of this growth is providing quality assistance to students during in-class and out-of-class programming exercises. Prior work proposes using instructor dashboards to help instructors combat these challenges. Further, the introduction of ChatGPT represents an exciting avenue to assist instructors with programming exercises but needs a delivery method for this assistance. We propose a revision of a current instructor dashboard Assistant Dashboard Plus that extends an existing dashboard with two new features: (a) identifying students in difficulty so that instructors can effectively assist them, and (b) providing instructors with pedagogically relevant groupings of students’ exercise solutions with similar implementations so that instructors can provide overlapping code style feedback to students within the same group. For difficulty detection, it uses a state-of-the-art algorithm for which a visualization has not been created. For code clustering, it uses GPT. We present a first-pass implementation of this dashboard.
- 18 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 54-57
Open AccessAssistant Dashboard Plus – Enhancing an Existing Instructor Dashboard with Difficulty Detection and GPT-based Code Clustering
As interest in programming as a major grows, instructors must accommodate more students in their programming courses. One particularly challenging aspect of this growth is providing quality assistance to students during in-class and out-of-class programming exercises. Prior work proposes using instructor dashboards to help instructors combat these challenges. Further, the introduction of ChatGPT represents an exciting avenue to assist instructors with programming exercises but needs a delivery method for this assistance. We propose a revision of a current instructor dashboard Assistant Dashboard Plus that extends an existing dashboard with two new features: (a) identifying students in difficulty so that instructors can effectively assist them, and (b) providing instructors with pedagogically relevant groupings of students’ exercise solutions with similar implementations so that instructors can provide overlapping code style feedback to students within the same group. For difficulty detection, it uses a state-of-the-art algorithm for which a visualization has not been created. For code clustering, it uses GPT. We present a first-pass implementation of this dashboard.
- Open Access
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 324-334
Infrastructure for Writing Fork-Join Tests
We have developed a software infrastructure for testing multi-threaded programs that implement the fork-join concurrency model. The infrastructure employs several key ideas: The student solutions use print statements to trace the execution of the fork-join phases. The test writer provides a high-level specification of the problem-specific aspects of the traces, which is used by the infrastructure to handle the problem-independent and low-level details of processing the traces. During performance testing, trace output is disabled automatically. During functionality testing, fine-grained feedback is provided to identify the correct and incorrect implementation of the various fork-join phases. Tests written using our infrastructure have been used in an instructor-training workshop as an instructor agent clarifying requirements and checking in-progress work. The size of the code to check the concurrency correctness of final and intermediate results was far smaller than the code to check the serial correctness of such results.
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 324-334
Open AccessInfrastructure for Writing Fork-Join Tests
We have developed a software infrastructure for testing multi-threaded programs that implement the fork-join concurrency model. The infrastructure employs several key ideas: The student solutions use print statements to trace the execution of the fork-join phases. The test writer provides a high-level specification of the problem-specific aspects of the traces, which is used by the infrastructure to handle the problem-independent and low-level details of processing the traces. During performance testing, trace output is disabled automatically. During functionality testing, fine-grained feedback is provided to identify the correct and incorrect implementation of the various fork-join phases. Tests written using our infrastructure have been used in an instructor-training workshop as an instructor agent clarifying requirements and checking in-progress work. The size of the code to check the concurrency correctness of final and intermediate results was far smaller than the code to check the serial correctness of such results.
- 1 November 2021
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 157, 179-200
Techniques and tools for visually introducing freshmen to object-based thread abstractions
- 1 November 2021
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 157, 179-200
Techniques and tools for visually introducing freshmen to object-based thread abstractions
- 21 May 2018
- Published by Springer Nature in Computer Supported Cooperative Work (CSCW)
- Vol. 27 (3-6) , 983-1018
Towards Evolutionary Named Group Recommendations
- 21 May 2018
- Published by Springer Nature in Computer Supported Cooperative Work (CSCW)
- Vol. 27 (3-6) , 983-1018
Towards Evolutionary Named Group Recommendations
- Open Access
- 12 October 2013
- Published by Association for Computing Machinery (ACM)
- p. 435-438
Evolving friend lists in social networks
In a social network, users can sort members of their social graph into friend lists to both understand the social structures within the graph and control the flow of incoming and outgoing information. To reduce the user-effort required to create these lists, previous work has developed techniques for generating friend-lists in a static social graph. This paper considers the user effort required to create friend lists in an evolving graph. We have developed several new initial quantitative metrics to capture this effort, and identified an initial technique for modeling graph growth. We have used these metrics and model to compare two techniques for evolving friend lists when the social graph grows: manual evolution - the user evolves friend lists using no external tools -- and full recommendation -- an existing state of the art tool recommends a whole new set of friend lists. In these comparisons, we used the friend lists of 12 individuals, and simulated the growth of their social graphs and friend lists using our graph-growth model. Intuitively, when the graph evolves by a small (large) amount, the manual (automatic) approach should perform better. Our experiments show that full recommendation performs better than manual when the social graph changes by more than 1%, and yields an almost complete reduction in effort in the best cases.
- 12 October 2013
- Published by Association for Computing Machinery (ACM)
- p. 435-438
Open AccessEvolving friend lists in social networks
In a social network, users can sort members of their social graph into friend lists to both understand the social structures within the graph and control the flow of incoming and outgoing information. To reduce the user-effort required to create these lists, previous work has developed techniques for generating friend-lists in a static social graph. This paper considers the user effort required to create friend lists in an evolving graph. We have developed several new initial quantitative metrics to capture this effort, and identified an initial technique for modeling graph growth. We have used these metrics and model to compare two techniques for evolving friend lists when the social graph grows: manual evolution - the user evolves friend lists using no external tools -- and full recommendation -- an existing state of the art tool recommends a whole new set of friend lists. In these comparisons, we used the friend lists of 12 individuals, and simulated the growth of their social graphs and friend lists using our graph-growth model. Intuitively, when the graph evolves by a small (large) amount, the manual (automatic) approach should perform better. Our experiments show that full recommendation performs better than manual when the social graph changes by more than 1%, and yields an almost complete reduction in effort in the best cases.
- 1 January 2012
- Published by European Alliance for Innovation n.o.
Towards Hierarchical Email Recipient Prediction
- 1 January 2012
- Published by European Alliance for Innovation n.o.
Towards Hierarchical Email Recipient Prediction