As part of Pedagogical Innovation and Experiential Learning, a Role Play Activity on “Singly Linked List” was conducted for Second Year B.Tech Computer Engineering (Regional Language) students. The activity was designed to transform the abstract concepts of nodes, data, links, and pointer connections into an engaging and easy-to-understand classroom experience. During the activity, students actively represented different nodes of a singly linked list, demonstrating how nodes are connected through links and how data is organized sequentially. Through role play, students visualized important operations such as node traversal, insertion, deletion, and updating links between nodes. This activity encouraged active participation, teamwork, peer learning, and logical thinking while helping students understand the dynamic nature of linked data structures. 

To foster experiential understanding of the Merge Sort algorithm, a roleplay activity was conducted where students enacted each phase of the sorting process—dividing the array, recursive calls, and merging of subarrays. Through this interactive pedagogy, students visualized the internal working of Merge Sort in a real-time setting, promoting better retention and conceptual clarity. This active learning strategy aligns with Outcome-Based Education (OBE) and demonstrates effective use of innovative teaching practices in computer science education.