Ushaa Eswaran
Vivek Eswaran
Keerthna Murali
Vishal Eswaran
- Principal and Professor, Department of Electrical Communication Engineering, Indira Institute of Technology and Sciences, Markapur, Andhra Pradesh, India
- Senior Software Engineer, Tech Lead at Medallia, Austin, Texas, United States
- Secure Connection: Cybersecurity, Site Reliability Engineer II (SRE) at Dell EMC | CKAD | AWS CSAA, Austin, Texas, United States
- Senior Data Engineer, CVS Health Centre, Dallas, Texas, United States
Abstract
In the rapidly advancing landscape of computer science, this study 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 study 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 study 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 study 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)]
References
- Clark A, Eyraud R. Polynomial identification in the limit. J Mach Learn Res. 2007; 8(5):1725–1745.
- Benesch J, Pratt B, Wang Y, Wang Z, Tang H, Sun X, Wang L. Self-optimizing data structures. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 2022; 1–11.
- Knuth DE. The Art of Computer Programming. Vol. 1: sorting and searching. 3rd Edn. India: Pearson Education; 1997.
- Jones T, Forrest S. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proceedings of the 6th International Conference on Genetic Algorithms. 1995;184–192.
- Merrill D. Tree data structures: An analog and quantum computing perspective. Appl Sci. 2022; 12(11): 5421.
- Gandomi AH, Haider M, Ghanbari A, Haider MS. Beyond the hype: Evolutionary algorithms and swarm intelligence. Minds Mach. 2020; 30(4): 413–450.
- Sedgewick R, Wayne K. Algorithms. Addison-Wesley professional; Boston, USA. 2011.
- Bader DA, Madduri K. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Proceedings 35th International Conference on Parallel Processing. 2006; 523–530.
- Melhorn K, Sanders P. Algorithms and Data Structures: The Basic Toolbox. Berlin, Heidelberg: Springer Science & Business Media; 2008.
- Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms. MIT press; Massachusetts, United States. 2009.
- Simon P, Losilla F, Oliver A, Garcia-Pichel F. An introduction to quantum machine learning for engineers. Eng Rep. 2020; 2(8): e12208.
| Volume | 02 |
| Issue | 01 |
| Received | January 19, 2024 |
| Accepted | January 21, 2024 |
| Published | February 21, 2024 |