Journal of Engineering Education Transformations ,

Volume 38 , No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707

10.16920/jeet/2024/v38i2/24193

Visualization and Comparative Simulation of Pathfinding,

Searching and Sorting Algorithms

Subhash Rathod1, Abhinav Mishra2, Akshay Patil3, Ashutosh Dhanawade4, Gaurav Dalvi5
1,2,3,4,5
Computer Department, Marathwada Mitramandal's Institute of Technology, Maharashtra, India
1
[email protected]
2
[email protected]
3
[email protected]
4
[email protected]
5
[email protected]

Abstract :This study addresses the need for enhanced Algorithm Visualizer e-learning application serves as
algorithms learning through the utilization of a valuable resource for learners, enhancing
comparative simulation and visualization. Motivated algorithmic comprehension through comparative
by the challenge of comprehending complex simulation and visualization techniques.
algorithms, we emphasize the efficacy of
visualization tools. Our research explores the real- Keywords: algorithm visualization; searching;
time rendering of algorithms in a visual format, sorting; pathfinding; digital learning; heuristic
facilitating a deeper understanding of their underlying algorithms; educational technology.
mechanisms. In addition, we introduce a novel
comparative simulation feature within our Algorithm 1. Introduction
Visualizer e-learning application, enabling learners to
contrast the performance of diverse algorithms, In the vast landscape of computer science, the
discern their strengths and weaknesses, and evaluate study of algorithms is often encapsulated as the
their applicability to different data sets. Specifically, "Design and Analysis of Algorithms." Proficiency in
this application accommodates various algorithms, computational thinking and programming is a
including Dijkstra's algorithm, DFS, BFS, Binary prerequisite for excelling in this field. Nevertheless,
Search, and more. Learners can employ this tool to the intricate nature of algorithms can pose a
scrutinize algorithmic differences and efficiency, formidable challenge, even to seasoned programmers.
exemplified through scenarios like comparing Conventional pedagogical methods employed to
Dijkstra's algorithm and A* algorithm for pathfinding teach algorithms can often be tedious, failing to
on a map. Furthermore, this feature extends to the provide the essential tools required for efficient and
evaluation of sorting algorithms, such as Quick Sort effective learning. As such, there exists a conspicuous
and Merge Sort, allowing users to visualize their gap, waiting to be bridged by a visualization-centric
performance on large data sets. In conclusion, the approach to algorithm learning.

This study seeks to address this critical void in the

realm of algorithm education by venturing into the
realm of dynamic visualization. The foundational
Gaurav Dalvi5 motivation for this research stems from an extensive
Computer Department, exploration and dialogue with leading experts, all of
Marathwada Mitramandal's Institute of Technology, Maharashtra
[email protected]
whom concur on the pressing need for a robust, user-
friendly application with dynamic visualization
Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707 97

features. This demand has sparked our enthusiasm for algorithms to calculate the shortest route between
a novel project that leverages contemporary tools such designated start and end nodes. The visual
as ReactJs, its associated frameworks, and libraries to representation of this process proved instrumental in
craft a much-needed educational tool. Our fostering an intuitive understanding of these
overarching objective is the creation of a cutting-edge algorithms, underscoring the value of visualization as
algorithm visualization platform, designed to an educational tool.
facilitate efficient and effective learning.
(Goswami et al. 2021) made a significant stride in
By manifesting algorithms in a visual format, this the field by creating an innovative algorithm
software implementation promises to elevate visualization tool. Their tool encompassed a diverse
students' understanding of these intricate constructs. range of path-finding, sorting, and CPU scheduling
With dynamic visual representations of algorithms in algorithms. Notably, their research revealed a pivotal
action, we aim to revolutionize the pedagogical statistic: 60% of students preferred learning
landscape, ushering in a more comprehensive and algorithms through visualization rather than
effective approach to teaching. The paramount traditional textbooks. This insight shed light on the
importance of visualization in comprehending growing appetite for interactive and visually engaging
complex concepts, including algorithms, is learning tools to facilitate comprehension of intricate
championed by an array of prominent experts and algorithms.
educators, all of whom underscore the adage that "a
picture is worth a thousand words." Indeed, extensive (Senger et al. 2021) focused their efforts on the
research underscores the profound impact of development of a visualizer aimed at BFS and
visualization in enhancing our grasp of intricate Dijkstra's Algorithm, accentuating the need for
subject matter. comparisons and analysis between these two
algorithms. (B. Nagaria et al 2021) stressed the
In summation, our commitment is unwavering in necessity for an interactive teaching tool catering to
the development of an algorithm visualization visually inclined students. Their tool allowed students
platform that stands as a formidable asset for learners to submit path-finding formulas and receive visual
of all backgrounds and skill levels. By harnessing the feedback, further emphasizing the efficacy of
formidable power of visualization and comparative visualization in the learning process.
simulation, our application is poised to democratize
algorithmic comprehension, making it more Ghandge et al. 2021) presented AlgoAssist, a
accessible, enjoyable, and understandable to learners comprehensive platform with integrated features that
across the spectrum. enhanced students' coding abilities and facilitated
teachers' assessments of student work. A notable
2. Literature Review feature of AlgoAssist was its emphasis on "Algorithm
Visualization" to elucidate the flow and operations of
The realm of algorithm visualization has witnessed algorithms, consolidating lab functionality into a
several notable contributions by researchers and single accessible platform.
developers in recent years, underscoring the profound
impact of visualization in the understanding and (Jain 2021) contributed to the landscape of
learning of complex algorithms. algorithm visualization with a Sorting Algorithms
Visualizer. This tool facilitated the visualization of
(Prabhakar et al. 2022) embarked on the various sorting algorithms, such as Insertion Sort,
development of an algorithm visualizer using the Bubble Sort, and Selection Sort. It provided users with
Tkinter Module in Python. Their creation was a the ability to generate random arrays for visualization
desktop application, readily accessible through a user- and to control the sorting speed and array size,
friendly website. While their work laid the foundation enhancing user engagement and understanding.
for algorithm visualization, it also highlighted the
growing need for more interactive and accessible (Abedalrahim et al. 2020) focused their efforts on
learning tools. a desktop-based application developed using Java,
which centered on the simulation of various sorting
(Yadav et al. 2021) introduced a path-finding algorithms. However, this application had limitations
visualizer that harnessed A*, Dijkstra, and DFS as it could only be used on standalone PCs.
98 Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707

3. Proposed System and empowers users to tailor algorithms to

specific needs.
The research paper proposes a system for
visualizing and simulating searching and sorting 4. Offering comprehensive performance metrics,
algorithms, with a focus on comparative analysis. The including comparisons, swaps, time complexity,
system is designed to provide a user-friendly interface and space complexity. This level of detail equips
that allows users to compare the performance of users with a deeper understanding of algorithm
different algorithms under various conditions. efficiency and resource usage.

The selection of searching and sorting algorithms 5. Implementation of a modern and intuitive user
for this system is grounded in extensive literature interface that allows users to personalize their
research and prior research findings. Researchers experience, making the platform accessible and
such as (Prabhakar et al. 2022), (Yadav et al. 2021), enjoyable for learners, researchers, students, and
(Goswami et al. 2021), (Senger et al. 2021), and developers alike.
(Ghandge et al. 2021) have demonstrated the value of
algorithm visualization in enhancing understanding. The motivation for this research is rooted in the
These studies provide a strong justification for the desire to make algorithmic concepts more accessible
inclusion of specific algorithms, including linear and enjoyable. Existing literature, exemplified by the
search, binary search, bubble sort, insertion sort, work of Prabhakar et al. [1], Yadav et al. [2], Goswami
merge sort, quicksort, and heapsort. These algorithms et al. [3], and Ghandge et al. [6], underscores the
have proven their significance in both educational and effectiveness of algorithm visualization in enhancing
practical contexts, and their selection is informed by the understanding of algorithms. This work also
the broad applicability and relevance they hold. addresses the challenge of understanding and
comparing pathfinding algorithms, such as Dijkstra's
The central research question guiding this work is: algorithm and A*, without visual aids. The web-based
"How can we provide a comprehensive and accessible application aims to bridge this gap by providing
platform for users to visualize, simulate, and compare interactive simulations and visualizations of different
searching and sorting algorithms to facilitate pathfinding algorithms.
algorithmic comprehension and evaluation?"
In conclusion, this web-based application seeks to
A. Objectives provide a user-friendly platform for comparative
simulation and visualization of various searching,
The primary objectives of this research project sorting, and pathfinding algorithms. It leverages
encompass several key facets: modern web development technologies and tools to
ensure a responsive and interactive user experience,
1. The development of a user-friendly web-based empowering users on their journey to master and
platform that offers dynamic visualizations and evaluate these algorithms effectively.
simulations of searching and sorting algorithms.
The aim is to make these algorithms more B. Features
engaging and comprehensible to a diverse
audience. The system will have the following features:

2. Enabling side-by-side comparisons of different 1. Auto-Generation and User Input: The system will
algorithms under various conditions, empowering allow users to auto-generate data or enter their data
users to assess the relative performance of these for visualization.
algorithms. This feature is vital in allowing users
to make informed choices in algorithm selection 2. Side-by-Side Comparison: The application allows
for their specific tasks. users to run two algorithms simultaneously for a
side-by-side comparison. This feature enables
3. Providing customization options that allow users users to compare the performance of different
to adjust algorithm parameters and observe their algorithms under various conditions.
impact on algorithm performance. Customization
fosters deeper insights into algorithm behavior 3. Algorithm Selection: The system will include the
Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707 99

following searching algorithms: researchers, students, and developers to evaluate the

performance of searching and sorting algorithms and
a. Linear Search gain a deeper understanding of their behavior. The
application's user-friendly interface and visualization
b. Binary Search tools make it easy for users to compare algorithms and
analyze their performance.
c. Depth First Search
The proposed web application aims to provide a
d. Breadth First Search platform for comparative simulation and visualization
of various pathfinding algorithms. Pathfinding is a
4. The following sorting algorithms will also be common problem in computer science, and there are
included: several algorithms available to solve it. However, it
can be difficult to understand and compare these
a. Bubble Sort algorithms without visual aids. This web application
aims to bridge that gap by providing users with
b. Selection Sort interactive simulations and visualizations of different
pathfinding algorithms.
c. Insertion Sort
The website will allow users to select from a
d. Quick Sort variety of pathfinding algorithms, such as Dijkstra's
algorithm, A* algorithm, and other variations. Users
e. Heap Sort can create maps with different obstacles and terrain
types to test the algorithms' performance in a 2D
f. Merge Sort space. The application will simulate the pathfinding
algorithm selected by the user on the map created by
5. Visualization Tools: The system will provide a them. It will visualize the algorithm's progress and
variety of visualization tools to help users show the path found by the algorithm. Users can also
understand the behavior of each algorithm. Users compare the performance of different algorithms side
can choose from several types of visualizations by side on the same page.
such as bar graphs, line graphs, or pie charts to
display the results of each algorithm. Customization options will be available, allowing
users to customize different parameters of the
6. Performance Metrics: The system will provide algorithms, such as the heuristic function, to see how it
detailed performance metrics for each algorithm. affects the algorithm's performance. The website will
Users can view the number of comparisons, swaps, also provide learning resources to help users
and other operations performed by each algorithm, understand the algorithms' underlying principles,
as well as the time and space complexities of each including tutorials and articles.
algorithm.
Overall, the website aims to provide a user-
7. Data Set and Algorithm Configuration Saving: The friendly platform for comparative simulation and
application will have a feature for users to save visualization of pathfinding algorithms, using modern
their data sets and algorithm configurations for web development technologies and tools to ensure a
future use. Users can save their results and compare responsive and interactive experience for users.
them with previous runs to track their progress over
time. C. System Architecture

8. User Interface: The system will have a modern and The visual representation of the major components
intuitive user interface that is easy to navigate. of our application, depicted in Fig. 1, provides an at-a-
Users will be able to choose from several color glance overview of the system's architecture,
schemes and themes to customize the appearance highlighting the core functionalities that have been
of the application. carefully designed to provide an intuitive and user-
friendly experience.
The proposed system will be an excellent tool for
100 Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707

these algorithms work to traverse the graph or tree and

discover all of its nodes.

Finally, the Sorting Algorithms component offers

an excellent way for users to observe how different
sorting algorithms work. The system generates bars
that represent an array's size, and each bar's height
indicates its value. Users can generate random arrays
or insert their arrays to visualize how each algorithm
sorts the array. With this visualization, users can gain a
deeper understanding of how algorithms such as
Merge Sort, Quick Sort, and Bubble Sort work to
arrange an array's elements in ascending or
descending order.

Overall, the system's components offer a diverse

Fig. 1 : System Architecture range of interactive features that allow users to learn
and explore algorithms in an engaging and accessible
The system's three main components, Pathfinding way. By providing a user-friendly interface and
Algorithms, Searching Algorithms, and Sorting interactive elements, users can gain a deeper
Algorithms, have been thoughtfully designed to offer understanding of how algorithms work and their
users an intuitive and engaging way to explore the applications in real-world scenarios.
fascinating world of algorithms.
D. Additional Features
The Pathfinding Algorithms component allows
users to interact with a grid-based visualization where Upon examining numerous similar projects, it was
they can create a maze and set their starting and ending observed that certain characteristics are absent,
points. By selecting an algorithm, users can watch as which, if integrated, can augment the visualizer's
the system employs a series of techniques to find the allure, user-friendliness, and overall user experience.
shortest path between these two points. The algorithm Our application endeavors to overcome these
can be customized by adjusting the speed, adding shortcomings by incorporating the following
barriers, or clearing the board. Additionally, the additional features:
system provides an interactive feature where users can
add a bomb to the maze as a barrier, making the 1. A superior and captivating User Interface (UI) is
visualization even more dynamic and exciting. incorporated to enhance the overall User
Experience (UX) of the application. Furthermore,
The Searching Algorithms component provides a the application is designed to be responsive,
comprehensive view of various algorithms used in facilitating a seamless and excellent user
searching, such as Linear Search and Binary Search. experience on both desktop and mobile devices,
The system generates blocks that represent an array's thereby ensuring accessibility for all users.
size, and each block contains a specific value. Users
can interact with these blocks and observe how each 2. To facilitate better visual comparisons, two
algorithm works to find a particular value within the algorithms can be executed simultaneously on the
array. To make the visualization more interactive, the screen. Furthermore, the application analyzes
system also offers an option to drag the blocks to algorithms' performance by conducting a
reorder them, providing a more hands-on experience. comprehensive analysis of factors such as run
times, complexity, and memory consumption, and
For DFS and BFS algorithms, the system generates comparing them to other algorithms to determine
circles to represent nodes and lines that represent the their efficacy and performance.
edges of a graph or tree. Users can interact with these
circles and lines by adding new nodes and connecting 3. The application also features a slider that enables
them with lines to form edges. This interactive feature users to adjust the visualization speed, thus
allows users to gain a deeper understanding of how facilitating better comprehension of the
Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707 101

algorithm's operations. Furthermore, pause and

play controls of the visualization are integrated
into the application, enabling users to analyze each
step of the algorithm in detail.

4. The application includes a dark mode option,

which not only adds aesthetic value but also
reduces eye strain and enhances visual appeal in
low-light conditions.

4. Results
Fig. 3 : Sorting Visualization Comparison Page
The implementation of our project has yielded
In Fig. 3, we can see the Sorting Visualization
significant results, which we are excited to share with
Comparison Page, which includes the following
you. Following are the results achieved after the
elements:
implementation of the project.
• Array Text field: shows the array to be visualized.

• Generate Button: generates a random array of

random lengths when clicked.

• Speed Slider: sets the speed of visualization.

• Algorithm Drop Down: Select the type of

algorithm to be visualized.

• Visualize Button: starts the visualization.

Fig. 2 : Sorting Visualization Page
The Sorting Visualization Page, shown in Fig. 2, • Reset Button: resets the visualization.
comprises the following elements:
• Two Timers: count the time required for
• Array Text field that displays the Array to be visualization of respective algorithms to be
visualized. completed.

• Generate Button, which generates a random array • Two Drop-Downs: select two algorithms of the
of random lengths when clicked. selected type to be visualized and compared.

• Speed Slider, used to set the speed of Visualization. • Two Visualization Areas: consist of bars that
represent the values of the array.
• Algorithm Drop Down, used to select the
Algorithm to be Visualized.

• Visualize Button, which initiates the visualization.

• Reset Button, used to reset the visualization.

• Timer, that counts the time required for

visualization to be completed.

• Visualization Area, comprising Bars that represent

the values of the array.
Fig. 4 : Searching Visualization Page
102 Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707

The Searching Visualization Page, shown in Fig. 4, • Speed Slider, used to set the speed of Visualization.
comprises the following elements:
• Algorithm Drop Down, used to select the
• Add Node Button to add a new Node. Algorithm to be Visualized.

• Add Edge Button to add a new Edge. • Visualize Button, which initiates the visualization.

• Delete Button to delete an edge or a node. • Reset Button, used to reset the visualization.

• Generate Button, which generates a random tree • Timer, that counts the time required for
when clicked. visualization to be completed.

• Speed Slider, used to set the speed of Visualization. • Visualization Area, comprising of a Grid that
shows a maze.
• Algorithm Drop Down, used to select the
Algorithm to be Visualized. Our project's advanced visualization features and
algorithmic capabilities enable users to easily analyze
• Visualize Button, which initiates the visualization. and compare various pathfinding, searching, and
sorting algorithms. With the ability to visualize and
• Reset Button, used to reset the visualization. compare algorithms, users can gain a deeper
understanding of their functions and operations,
• Timer, that counts the time required for enabling them to make more informed decisions when
visualization to be completed. selecting algorithms for specific tasks. This
functionality is especially useful in the field of
• Visualization Area, consisting of Nodes and Edges educational technology in higher education, where
that represent a Tree. algorithmic understanding and proficiency are
essential for success.

The implementation of our project has yielded

significant technical results, and the addition of user
experience and feedback further reinforces its
practical value. Throughout the development process,
we conducted extensive testing within our college
community, inviting classmates and friends to interact
with the application. The overwhelming response was
positive, with users praising the project as a valuable
tool for the study of Data Structures and Algorithms
(DSA).
Fig. 5. Pathfinding Visualization Page
The Pathfinding Visualization Page, shown in Fig. Most users found the interface intuitive, and the
5, comprises the following elements: visualization features instrumental in enhancing their
understanding of sorting, searching, and pathfinding
• Start Node Button to set the start node in the Grid.
Table 1 : Average Scores Given by
Teachers and Students
• End Node Button to set the end node in the Grid.
Average Score Average Score
Characteristics (Teachers)
• Add Wall Button to add walls to the Grid. (Students)
User Interface 9.1 8.7
• Add Obstacle Button to add obstacles in the Grid. Ease of Use 8.8 8.6
Functionality 9.2 9.1
• Generate Button, which generates a maze when Education Value 8.7 8.8
clicked. Overall 8.95 8.8
Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707 103

algorithms. Notably, teachers who evaluated the Acknowledgment

application also commended its potential for
educational use, stating that with further development We, the team behind this project, would like to take
and additional features, it could be effectively this opportunity to express our immense gratitude
employed in classrooms to teach students about towards all the individuals who have played an
algorithmic concepts. The combination of positive integral part in making this project a success.
user experiences and constructive feedback positions
our project as not only a robust technical solution but First and foremost, we extend our heartfelt
also a promising educational resource in the field of appreciation to Professor Subhash Rathod, who
DSA. served as our project mentor. We are incredibly
grateful for his unwavering support, valuable insights,
5. Conclusion and constant guidance throughout the project's course.
Professor Rathod's expertise and direction have been
In conclusion, our web application represents a invaluable in shaping our ideas and transforming them
valuable step in the realm of e-learning, offering users into a tangible reality.
a powerful tool for visualizing and comprehending
complex algorithms. The application is designed to be We would also like to express our profound
accessible to users of all levels, making it an effective gratitude to our families and friends at Marathwada
educational resource. Mitramandal’s Institute of Technology for their
unwavering encouragement, support, and
As we look to the future, there are exciting understanding during this project's journey. Their
possibilities for expanding our application's constant motivation and cooperation have been the
capabilities. One area of development that we driving force behind our perseverance, and we could
envision is the creation of a mobile application that not have achieved this without their unconditional
can operate offline, allowing users to access algorithm love and backing.
visualizations anytime and anywhere. The mobile
application will encompass all the features available Additionally, we would like to thank our
in the web version, ensuring users can visualize and colleagues and other experts who provided us with
compare algorithms conveniently on their mobile their valuable feedback and insights throughout the
devices. development of this project. Their suggestions and
constructive criticism have been instrumental in
Moreover, we plan to incorporate more advanced refining our ideas and making the project more
algorithms based on algorithmic strategies like Divide effective, user-friendly, and innovative.
and Conquer and Greedy Strategy. These advanced
algorithms are fundamental in tackling complex Lastly, we would like to thank the wider
problem-solving tasks, and their inclusion in our community of learners and educators who have shown
application will provide users with a deeper an interest in our project. It is your enthusiasm and
understanding of algorithmic strategies. feedback that will continue to inspire us to work
towards enhancing the project's capabilities and
While we acknowledge the potential for our making it an even more valuable resource for
application to contribute to e-learning, it's important everyone.
to emphasize that our work focuses on facilitating
algorithm understanding and comparison. The Once again, we extend our heartfelt appreciation to
ongoing development of our application aims to everyone who played a role in bringing this project to
enhance the educational experience and make fruition, and we hope that our efforts will continue to
algorithmic concepts more accessible to learners. benefit and inspire learners for years to come.

In summary, our application is an innovative References

educational tool with the potential to impact how
users learn about algorithms, and we are committed to G. Prabhakar, S. Gaur, L. Deshwal and P. Jain,
further development to meet the evolving educational "Analysis of Algorithm Visualizer to Enhance
needs of our audience. Academic Learning," 2022 2nd International
104 Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707

Conference on Innovative Practices in Rahman, A & Baharudin, Z.A. & Teknologi,

Technology and Management (ICIPTM), 2022, Fakulti & Elektrik, Kejuruteraan & Elektronik,
p p . 2 7 9 - 2 8 2 , d o i : Dan & Teknikal, Universiti & Melaka, Malaysia
10.1109/ICIPTM54933.2022.9753906. & Jaya, Hang & Tunggal, Durian. (2020). The
Development Of System For Algorithms
N. Yadav, K. Dhameja and P. Chaubey, "Path Finding Visualization Using Simjava. Journal of
Visualizer Application for Shortest Path Engineering and Applied Sciences. 15. 3024-
Algorithm" 2021 3rd International Conference 3034.
on Advances in Computing, Communication
Control and Networking (ICAC3N), 2021, pp. Hiwarekar, A. P. (2023). Innovative Teaching-
1 6 6 9 - 1 6 7 2 , D O I : Learning Method for Engineering Mathematics
10.1109/ICAC3N53548.2021.9725716. Through Video Lectures in Rural Areas. Journal
of Engineering Education Transformations,
B. Goswami, A. Dhar, A. Gupta and A. Gupta, 37(2), 209–220.
"Algorithm Visualizer: Its features and
working," 2021 IEEE 8th Uttar Pradesh Section Kavitha Devi, M. K., & Thendral, M. S. (2023). Using
International Conference on Electrical, Kolb’s Experiential Learning Theory to
Electronics and Computer Engineering Improve Student Learning in Theory Course.
(UPCON), 2021, pp. 1-5, DOI: Journal of Engineering Education
10.1109/UPCON52273.2021.9667586. Transformations, 37(1), 70–81.

Sengar, Nishant. (2021). Pathfinder Visualizer of Sreevani, K. (2020). Innovative teaching-learning

Shortest Paths Algorithms. International process: Categorical clustering data. Journal of
Journal for Modern Trends in Science and Engineering Education Transformations,
Te c h n o l o g y. 6 . 4 7 9 - 4 8 3 . 33(Special Issue), 360–363.
10.46501/IJMTST061293.
Shingan, G., Lokare, V., & Dharwadkar, N. (2020). A
B. Nagaria, B. C. Evans, A. Mann and M. Arzoky, novel approach to teach design and analysis of
"Using an Instant Visual and Text Based algorithms course. Journal of Engineering
Feedback Tool to Teach Path Finding Education Transformations, 33(3), 87–91.
Algorithms: A Concept," 2021 Third
I n t e r n a t i o n a l Wo r k s h o p o n S o f t w a r e Deb, R., & Bhatt, D. K. (2020). Technology
Engineering Education for the Next Generation integration through digital learning hub in skill-
(SEENG), 2021, pp. 11-15, doi: oriented entrepreneurial education. Journal of
10.1109/SEENG53126.2021.00009. Engineering Education Transformations,
33(Special Issue), 503–509.
A. B. Ghandge, B. P. Udhane, H. R. Yadav, P. S.
Thakare, V. G. Kottawar and P. B. Deshmukh, Chakraborty, P., Arora, U., Goel, V., Shikhar, S.,
"AlgoAssist: Algorithm Visualizer and Coding Takhar, R., & Mukhija, N. (2019). OSAVA: An
Platform for Remote Classroom Learning," android app for teaching a course on operating
2021 5th International Conference on systems. Journal of Engineering Education
Computer, Communication and Signal Transformations, 32(4), 20–30.
Processing (ICCCSP), 2021, pp. 1-6, doi:
10.1109/ICCCSP52374.2021.9465503. Tharakan, J. (2020). Using educational technology to
enhance creative and critical thinking skills
Jain, "Realizing Algorithms Using GUI," 2021 10th through open ended design projects. Journal of
International Conference on System Modeling Engineering Education Transformations,
& Advancement in Research Trends (SMART), 33(Special Issue), 225–232.
2 0 2 1 , p p . 4 5 1 - 4 5 5 , d o i :
10.1109/SMART52563.2021.9676269. Gañán-Rojo, P., Barajas-Gamboa, J., Forero-Gaviria,
L. A., & Castrillón-Hernández, F. (2024). The
Abedalrahim, Jamil & Alsayaydeh, Jamil & Zainon, Impact of the Chemical Engineering Faculty’s
Maslan & Oliinyk, A. & Aziz, Azwan & Research Activity at Universidad Pontificia
Journal of Engineering Education Transformations , Volume 38, No. 2 , October 2024 , ISSN 2349-2473, eISSN 2394-1707 105

Bolivariana: A Bibliometric Analysis. Journal of Pinto, C. A. S., & Reis, A. C. (2023). Characteristics of
Engineering Education Transformations, 37(4), Education 4.0 and its Application in Industry
102–110. 4.0. Journal of Engineering Education
Transformations, 37(1), 51–61.
Dol, S. M., Jawandhiya, P. M., & Satav, P. R. (2024).
Use of Microsoft Excel for Data Collection and Dol, S. M., & Jawandhiya, P. M. (2022). A Review of
Processing to Predict Students’ Performance in Data Mining in Education Sector. Journal of
EDM. Journal of Engineering Education Engineering Education Transformations,
Transformations, 37(Special Issue 2), 22–43. 36(Special Issue 2), 13–22.