Jahan, F., & LeBlanc, H. J. (2025, June), Colorful Connections: Building Linked Lists with Playdough  Paper presented at 2025 ASEE Annual Conference & Exposition , Montreal, Quebec, Canada . 10.18260/1-2--56111

\bibitem{asee_peer_56111}
  Jahan, F., \& LeBlanc, H. J. (2025, June), \emph{Colorful Connections: Building Linked Lists with Playdough}
  Paper presented at 2025 ASEE Annual Conference \& Exposition , Montreal, Quebec, Canada .
  10.18260/1-2--56111

Farha Jahan and Heath Joseph LeBlanc.  "Colorful Connections: Building Linked Lists with Playdough".  2025 ASEE Annual Conference & Exposition , Montreal, Quebec, Canada , 2025, June.  ASEE Conferences, 2025.  https://peer.asee.org/56111 Internet.  27 Aug, 2025

\bibitem{asee_peer_56111}
  Farha Jahan and Heath Joseph LeBlanc.
  "Colorful Connections: Building Linked Lists with Playdough".
  \emph{2025 ASEE Annual Conference \& Exposition , Montreal, Quebec, Canada , 2025, June}.
  ASEE Conferences, 2025.
  https://peer.asee.org/56111 Internet.  27 Aug, 2025

@INPROCEEDINGS{asee_peer_56111
author = "Farha Jahan and Heath Joseph LeBlanc"
title = "Colorful Connections: Building Linked Lists with Playdough"
booktitle = "2025 ASEE Annual Conference \& Exposition "
year = "2025"
month = "June"
address = "Montreal, Quebec, Canada "
publisher = "ASEE Conferences"
note = {https://peer.asee.org/56111}
number = {10.18260/1-2--56111}
}

TY  - CPAPER
AB  - Teaching complex data structures like linked lists can be challenging for students new to programming. It is also difficult to apply kinesthetic learning to a Computer Science course. This paper introduces a novel pedagogical approach using a Play-Doh train model to simplify the concept of linked lists in computer science education. The tangible, hands-on activity allows students to visualize how nodes (train cars) are connected in memory, with each car (node) holding both data and a pointer to the next car (node). By physically building and modifying the Playdoh train, students can better grasp concepts such as traversal, insertion, and deletion in linked lists. This method enhances engagement, fosters deeper understanding, and bridges the gap between abstract programming concepts and real-world analogies. Results from classroom trials show improved student comprehension and retention, making this an effective teaching tool for data structure course.
AU  - Farha Jahan
AU  - Heath Joseph LeBlanc
CY  - Montreal, Quebec, Canada 
DA  - 2025/06/22
PB  - ASEE Conferences
TI  - Colorful Connections: Building Linked Lists with Playdough
UR  - https://peer.asee.org/56111
DO  - 10.18260/1-2--56111
ER  -