Computer Science

Data Structures and Algorithm

Data Structures and Algorithm

  • ISBN
  • Price
  • Publication Year
  • Publisher
  • Binding
  • Description
  • About the Editor
    • Discusses the development and implementation of data structures and algorithms using C.
    • Provides logical method of explaining various complicated concepts and stepwise methods to explain the important topics.
    • Presents some general techniques for solving recurrence equations that arise in the analysis of the running times of recursive algorithms.

In computer science, a data structure is a particular way of organizing data in a computer so that it can be used e ciently. Data structures can implement one or more particular abstract data types (ADT), which specify the operations that can be performed on a data structure and the computational complexity of those operations. In comparison, a data structure is a concrete implementation of the speci cation provided by an ADT. Data Structures are the programmatic way of storing data so that data can be used e ciently. Almost every enterprise application uses various types of data structures in one or the other way. This text will give you a great understanding on Data Structures needed to understand the complexity of enterprise level applications and need of algorithms, and data structures. Data structures provide a means to manage large amounts of data e ciently for uses such as large databases and internet indexing services. Usually, e cient data structures are key to designing e cient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory.