Classification of Data Structure

  • Videos
  • January 12, 2022
  • 0

Tutorials Point

Topics: Data Structures, Generalized Indexing, Software

Transcript Summary

Data Structures and other collections are discussed. Data Structures are a specialized means of organizing and storing data in computers in such a way that can perform operations on the stored data more efficiently. Data structures can be classified into different categories. The collections can be of two types: linear and non-linear generalized indexing, direct access, sequential access, generalized indexing, with the community and hash table.

The first category is the shortage area and the second one is the uncharted. Data items are added in the ascending or descending order. This will be a direct access where the file has multiple records to access the integrated record. In order to access the integrated record, a user should have to go through minus one into the number. Next, the pointer will be reached at the start of the record. In case sequential access can be done, a list is presented inside the computer’s memory, either through a sequence presentation or the width link to the presentation. Completing this procedure makes a faster data structure and a priority queue available and includes stacks and lists.

In case of nonlinearity, there’s a hierarchical data structure with a tree and a heap. In the case of a group, we’ll be having sets and the groups. This concludes the data structures and generalized indexing topics that are discussed.

Share:

React JS Font-End Development Tutorial for Beginners

Scope In JavaScript