Algorithm Visualizer: Its features and working

Design and Analysis of Algorithms is one of the most important subjects in the field of Computer Science. We have observed that it is one of those typical subjects, which when understood well can be very interesting, but for learners who are not able to understand the concepts clearly, it can become...

Full description

Saved in:
Bibliographic Details
Published in:IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics (Online) pp. 1 - 5
Main Authors: Goswami, Barnini, Dhar, Anushka, Gupta, Akash, Gupta, Antriksh
Format: Conference Proceeding
Language:English
Published: IEEE 11.11.2021
Subjects:
algorithms
Computer science
Conferences
CPU-scheduling
e-learning
Games
Knowledge engineering
path finding
Productivity
Scheduling algorithms
sorting
Visualization
ISSN:2687-7767
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Design and Analysis of Algorithms is one of the most important subjects in the field of Computer Science. We have observed that it is one of those typical subjects, which when understood well can be very interesting, but for learners who are not able to understand the concepts clearly, it can become a burden. Through our work we intend to change the perception of this subject from complex and hard to grasp, to interesting and fun. Our work aims to engage the students by providing self-paced hands-on experience, fun filled games through mazes and patterns and interactive, perceivable visualizations for their better concept understanding of various algorithms. Our work presently focuses on path-finding, sorting and CPU scheduling algorithms as these are the most widely taught and used algorithms in the computer science domain. Our idea would not only help the students and learners get a better hold on the concepts of algorithms but also provide an innovative way for teachers and educators to portray their ideas more clearly and interactively through to the students.
ISSN:2687-7767
DOI:10.1109/UPCON52273.2021.9667586