Advancements in Data Structures: Bridging the Gap between Theory and Real-world Applications

Year : 2024 | Volume :02 | Issue : 01 | Page : 14-20
By

    Ushaa Eswaran

  1. Vivek Eswaran

  2. Keerthna Murali

  3. Vishal Eswaran

  1. Principal and Professor, Department of Electrical Communication Engineering, Indira Institute of Technology and Sciences, Markapur, Andhra Pradesh, India
  2. Senior Software Engineer, Tech Lead at Medallia, Austin, Texas, United States
  3. Secure Connection: Cybersecurity, Site Reliability Engineer II (SRE) at Dell EMC | CKAD | AWS CSAA, Austin, Texas, United States
  4. Senior Data Engineer, CVS Health Centre, Dallas, Texas, United States

Abstract

In the rapidly advancing landscape of computer science, this journal paper unfolds a comprehensive exploration of Data Structures, spanning from foundational principles to cutting-edge innovations. Data Structures form the backbone of computational processes, and this paper aims to dissect and illuminate their pivotal role. Beginning with fundamental concepts such as Arrays, Linked Lists, Stacks, and Queues, the narrative progresses to intricate structures like Trees, Graphs, and Hash Tables. Practical applications in real-world scenarios are highlighted through case studies and tangible examples, offering a bridge between theory and application. The abstract encapsulates the dynamic essence of the field, providing insights into ongoing research and innovative trends, including the integration of machine learning and the application of bio-inspired structures. As we navigate the intricate web of Data Structures, this paper seeks to unravel their significance and foster a deeper understanding of their implications in addressing contemporary computational challenges.

Keywords: Data Structures, Fundamental Data Structures, Advanced Data Structures, Real-world Applications, Research Trends, Innovations.

[This article belongs to International Journal of Data Structure Studies(ijdss)]

How to cite this article: Ushaa Eswaran, Vivek Eswaran, Keerthna Murali, Vishal Eswaran , Advancements in Data Structures: Bridging the Gap between Theory and Real-world Applications ijdss 2024; 02:14-20
How to cite this URL: Ushaa Eswaran, Vivek Eswaran, Keerthna Murali, Vishal Eswaran , Advancements in Data Structures: Bridging the Gap between Theory and Real-world Applications ijdss 2024 {cited 2024 Feb 21};02:14-20. Available from: https://journals.stmjournals.com/ijdss/article=2024/view=133430


References

  1. Clark, A., & Eyraud, R. (2007). Polynomial identification in the limit. Journal of Machine Learning Research, 8(5).
  2. Benesch, J., Pratt, B., Wang, Y., Wang, Z., Tang, H., Sun, X., & Wang, L. (2022). Self-optimizing data structures. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management (pp. 1-11).
  3. Simon, P., Losilla, F., Oliver, A., & Garcia-Pichel, F. (2020). An introduction to quantum machine learning for engineers. Engineering Reports, 2(8), e12208.
  4. Jones, T., & Forrest, S. (1995). Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proceedings of the 6th International Conference on Genetic Algorithms (pp. 184-192).
  5. Merrill, D. (2022). Tree data structures: An analog and quantum computing perspective. Applied Sciences, 12(11), 5421.
  6. Gandomi, A. H., Haider, M., Ghanbari, A., & Haider, M. S. (2020). Beyond the hype: Evolutionary algorithms and swarm intelligence. Minds and Machines, 30(4), 413-450.
  7. Bader, D. A., & Madduri, K. (2006). Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Proceedings 35th International Conference on Parallel Processing (pp. 523-530).
  8. Melhorn, K., & Sanders, P. (2008). Algorithms and Data Structures: The Basic Toolbox. Springer Science & Business Media.
  9. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms. MIT press.
  10. Knuth, D. E. (1997). The Art of Computer Programming, volume 1:(3rd Ed.). sorting and searching. Pearson Education India.
  11. Sedgewick R, Wayne K. Algorithms. Addison-wesley professional; 2011.

Regular Issue Subscription Review Article
Volume 02
Issue 01
Received January 19, 2024
Accepted January 21, 2024
Published February 21, 2024