top of page

Data Structures

Data Structure can be defined as the group of data elements which provides an efficient way of storing and organizing data in the computer so that it can be used efficiently. Data Structure is a way to store and organize data so that it can be used efficiently. Some examples of Data Structures are arrays, Linked List, Stack, Queue, etc. algorithms describe the way the data is to be transformed. The reason for learning about data structures is because adding structure to our data can make the algorithms much simpler, easier to maintain, and often faster.

Data Structures are a specialized means of organizing and storing data in computers in such a way that we can perform operations on the stored data more efficiently. Data structures have a wide and diverse scope of usage across the fields of Computer Science and Software Engineering

Basically, data structures are divided into two categories:

  1. Linear data structure.

  2. Non-linear data structure.

Data Types - Nominal, Ordinal, Discrete, Continuous

structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms.

Classes of data types

Machine data types :Boolean type. Enumerations. Numeric types. String and text types. Pointers and references. Function types. Meta types.

  1. Static data structure: It is a type of data structure where the size is allocated at the compile time. Therefore, the maximum size is fixed.

  2. Dynamic data structure: It is a type of data structure where the size is allocated at the run time. Therefore, the maximum size is flexible.

Features of Data Structures

  1. Searching: We can search for any element in a data structure.

  2. Sorting: We can sort the elements of a data structure either in an ascending or descending order.

  3. Insertion: We can also insert the new element in a data structure.

  4. Updation: We can also update the element, i.e., we can replace the element with another element.

  5. Deletion: We can also perform the delete operation to remove the element from the data structure.

The advantages of a data structure:

  1. Efficiency: If the choice of a data structure for implementing a particular ADT is proper, it makes the program very efficient in terms of time and space.

  2. Reusability: The data structure provides reusability means that multiple client programs can use the data structure.

  3. Abstraction: The data structure specified by an ADT also provides the level of abstraction. The client cannot see the internal working of the data structure, so it does not have to worry about the implementation part. The client can only see the interface.

Lakshminarasimman V Rao | DM306|LGMA|Lead Management |Digital Marketing| Study notes | Study Material | MBA | Corporate Neeti Consulting | Mysuru|

All data above is a combination of data from Internet, purpose of this doc is for research and education only and responses received from Class students and interaction.

Recent Posts

See All


bottom of page