Algorithm Visualization Using CI/CD

Open Access

Year : 2022 | Volume : | Issue : 1 | Page : 37-42
By

    Anjali Kumari

  1. Sankalp Dwivedi

  2. Vikrant Chauhan

  3. Shreya Sharma

  1. Student, Computer Science and Engineering Department, ABES Institute of Technology, Uttar Pradesh, India

Abstract

The visualization of algorithms demonstrates how algorithms work more efficiently. Essentially, it seeks to simplify and automate the visualization of the algorithm. Using algorithm visualizations, we have discussed how standard algorithms can be taught more effectively and efficiently with automation and further can be used as open source. Our aim is to present a way to deploy our project using CI/CD which will be a far more efficient platform. Therefore, to achieve this, we are using Amazon Web Service to not only automate but it will be also used for hosting website. Elastic Beanstalk will be utilised as a manager and will take care of everything from building an EC2 instance to deploy a service on an EC2 instance, as well as monitoring, scaling, updating, and management. Elastic Beanstalk is a service of AWS which is used to host dynamic website like a website which will use node image to be hosted. It is the fastest way to get web application running on AWS. As we can have integrated it with GitHub webhook so that any merges in branch will trigger to latest deployment itself. We can also create different environment for testing so that it will lead to more stability in release, and we can get notified by SNS service of AWS which will send a mail regarding the triggered pipeline. This project not only helps in visualization but also how to automate or work using different services, which is beneficial for us and helps in improving our release of product.

Keywords: Algo viz, animation platform, online learning tool, CI/CD, EC2 instance

[This article belongs to Journal of Computer Technology & Applications(jocta)]

How to cite this article: Anjali Kumari, Sankalp Dwivedi, Vikrant Chauhan, Shreya Sharma Algorithm Visualization Using CI/CD jocta 2022; 13:37-42
How to cite this URL: Anjali Kumari, Sankalp Dwivedi, Vikrant Chauhan, Shreya Sharma Algorithm Visualization Using CI/CD jocta 2022 {cited 2022 May 06};13:37-42. Available from: https://journals.stmjournals.com/jocta/article=2022/view=97254

Full Text PDF Download

Browse Figures

References

  1. Katarzyna Romanowska, Gurpreet Singh. Towards Developing an Effective Algorithm Visualization Tool for Online Learning, IEEE. , 2018; 2011–2016.
  2. Baker AA, Milanovic B. A Universal Extensible Architecture for Algorithm Visualisation Systems. In 2008 International Conference on Computer Science and Software Engineering, Hubei. , 2008; 737–740.
  3. Naser SSA. Developing Visualisation Tool for Teaching Artificial Intelligence Searching Algorithms. Inf Technol J. , 2008; 3: 351–352.
  4. Dixit RK, Yalagi PS. Visualization based intelligent tutor system to improve study of Computer Algorithms. J Eng Educ Transform. , 2017; 30(3): 157–163.
  5. Vrachnos E, Jimoyiannis A. Design and evaluation of a web-based dynamic algorithm visualization environment for novices. Procedia Comput Sci. , 2014; 27: 229–239.
  6. Naser SSA. Developing Visualization Tool for Teaching AI Searching Algorithms. Inf Technol J. 2008; 7(2): 350–355. 7. Guo JP. Online Python Tutor: Embeddable Web-Based Program Visualization for Computer Science Education. In SIGCSE Technical Symposium on Computer Science Education, New York, USA. , 2013; 579–584.
  7. Adamchik Victor. Data structures and algorithms in pen-based computing environments. Paper presented at the Global Engineering Education Conference (EDUCON), IEEE. , 2011; 1211–1214.
  8. Hundhausen Christopher, Douglas Sarah. A language and system for constructing and presenting low fidelity algorithm visualizations Software Visualization. Springer; , 2002; 227–240.
  9. Becker K, Beacham M. A tool for teaching advanced data structures to computer science students: an overview of the BDP system. J Comput Sci. , 2001; 16(2): 65–71.

Regular Issue Open Access Article
Volume 13
Issue 1
Received April 29, 2022
Accepted May 2, 2022
Published May 6, 2022