The Backbone of Computing: An Exploration of Data Structures-Reference-Cited by-同舟云学术

The Backbone of Computing: An Exploration of Data Structures

Published:2023-04-12 Issue: Volume: Page:155-163
ISSN:2581-9429
Container-title:International Journal of Advanced Research in Science, Communication and Technology
language:en
Short-container-title:IJARSCT

Author:

I. Dwaraka Srihith ¹,A. David Donald ²,T. Aditya Sai Srinivas ²,D. Anjali ³,R. Varaprasad ⁴

Affiliation:

1. Alliance University, Bangalore

2. Ashoka Women’s Engineering College, Kurnool

3. G. Pulla Reddy Engineering College, Kurnool

4. G. Pullaiah College of Engineering and Technology, Pudur

Abstract

Data structures are the foundation of computing, providing efficient ways to store and manipulate data. They are essential for designing and implementing algorithms that can handle large amounts of information quickly and accurately. In this paper, we explore the world of data structures, examining their basic principles, properties, and uses. We start by introducing the most common data structures, such as arrays, linked lists, stacks, queues, trees, and graphs, and discuss their advantages and limitations.

Publisher

Naksh Solutions

Subject

General Medicine

Reference21 articles.

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms. MIT Press.

2. Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. (2015). Data Structures and Algorithms in Java. John Wiley & Sons.

3. Sahni, S. (2014). Data Structures, Algorithms, and Applications in C++. S. K. Kataria & Sons.

4. Sedgewick, R. (2011). Algorithms. Addison-Wesley Professional.

5. Weiss, M. A. (2014). Data Structures and Algorithm Analysis in Java. Pearson Education.