Data Visualization of Algorithms

Authors

  • Aman Keskar  Department of Computer Engineering, Zeal College of Engineering and Research, Pune, Maharashtra, India
  • Asmita Kulkarni  Department of Computer Engineering, Zeal College of Engineering and Research, Pune, Maharashtra, India
  • Jinendra Kulkarni  Department of Computer Engineering, Zeal College of Engineering and Research, Pune, Maharashtra, India

Keywords:

Dijkstra’s Algorithm, Greedy Best First Search Algorithm, Breadth-First-Search Algorithm, A * Algorithm, Depth First Search.

Abstract

Developing a Visualization System for Algorithms where different algorithms will be implemented considered and their functionality of how the shortest route is determined from the variety obstacles and representation of the shortest route.

The user will have the opportunity here to provide a flexible input for each algorithm to visualize.After receiving the start node,destination node and the obstacles the shortest path will be generated and with the help of animation will be displayed on the screen .The different algorithms have different modules for each of them. Algorithms -

  • Dijkstra algorithm
  • Greedy Best First Search Algorithm
  • Breadth-First-Search Algorithm
  • A * Algorithm
  • Depth First Search Algorithm

This animation will introduce various algorithms used to determine the shortest route.

It will also show the various barriers that can be used to represent the shortest route. This project will help the user to understand the functionality of the various algorithms.

References

  1. S. Diehl. Software View. Number 2169 in Lecture Notes in Computer Science. Springer, 2002.
  2. E. Fouh, M. Akbar, and C.A. Shaffer. The importance of visualisation in computer science education. Computers in Schools, 29: 95–117, 2012.
  3. S. Hall, E. Fouh, D. Breakiron, M. Elshehaly, and C.A. Shaffer. New education for data structures and algorithms studies. In the plans for the ASEE Annual Conference, Atlanta GA, June 2013.
  4. C.D. Hundhausen, S.A. Douglas, and J.T. Stasko. Meta-analysis of algorithm recognition efficiency. Visual and Computer Languages Journal, 13: 259–290, June 2002.
  5. V. Karavirta. Seamless integration of hypertext and animation algorithm. ACM switch In Computer Education, 9 (2): 1–18, 2009.
  6. V. Karavirta. Location-based mobile reading of local algorithms. In IADIS forums 2013 International Telephone Learning Conference, pages 158–162, Lisbon, Portugal, March 2013.
  7. V. Karavirta, A. Korhonen, and O. Sepp¨al¨a. Misconceptions in visual algorithm comparisons updated: UI impact on student performance, attitudes, and erroneous ideas Macau, 2013.
  8. A. Korhonen. Visual Algorithm Simulation. Doctoral dissertation (tech rep. No. T4040), Helsinki University of Technology, 2003.
  9. M. Krebs, T. Lauer, T. Ottmann, and S. Trahasch. View algorithm designed for students testing: flexible production, feedback and grading. In the 10th year scenes SIGCSE Conference on Innovation and Technology in Computer Science Education, pages 282-285, New York, NY, USA, 2005.
  10. L. Malmi, V. Karavirta, A. Korhonen, J. Nikander, O. Sepp¨al¨a, and P. Silvasti. Visual algorithm simulates an exercise program with automation testing: TRAKLA2. Informatics Education, 3 (2): 267–288, September 2004.
  11. T.L. Naps. Jhav'e: Support algorithm detection. IEEE Computer Graphics as well Applications, 25: 49–55, September 2005.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2022-04-30

Issue

Volume 8, Issue 2, March-April-2022

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Aman Keskar, Asmita Kulkarni, Jinendra Kulkarni, " Data Visualization of Algorithms" International Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 8, Issue 2, pp.440-443, March-April-2022.