DATA STRUCTURES

Ms. Anuradha A. More, Asst. Professor CSE Department, aamore@coe.sveri.ac.in

SVERI’s College of Engineering, Pandharpur

  

Introduction

 A data structure is a special way of organizing and storing data in a computer so that it can be used efficiently.

Data structure is a representation of logical relationship existing between individual elements of data.

Data structure is a way of organizing all data items that considers not only the elements stored but also their relationship to each other. We can also define data structure as a mathematical or logical model of a particular organization of data items.

The representation of particular data structure in the main memory of computer is called storage structure representation in auxiliary m\m is called ale structure.

Description

 

Data structure is mainly specifies following four things

1.  Organization of data

2.  Accessing methods

3.  Degree of associatively

4.  Processing alternatives for information

 Data structure study covers the following points

1. Amount of memory required to store

2. Amount of time required to process.

3. Representation of data in memory operation performed

Classification of data structure

 

Data structure is normally classified in to two broad categories: Primitive data structure Non-primitive data structure.

       Data types

A Particular kind of data items as defined by the values it can be take the programming language used or the operations that can be performed on it.

Primitive data Structure

Primitive data structure has different representation on different computer Integers, floats, character & pointers are example of primitive data structure

 

Application of data structure

1.  In web browsers where it creates a linked list of web pages visited so that when you check history or press basic button the previous model data is retched.

2.  Compilers syntax check for matching braces B implemented by using stack.

3.   Queue are more useful in OS,

A Processor management creates ready queue or the process by the CPU Scheduler

a.   Algorithm

b. Batch Processing

c.   File Manager

d. Job scheduling & Device scheduling

e. Every IO device has their own queue to collect requests from different application or processing.

 

f.    Various real-life application like railway ticket reservation is the example of queue

 

 

4.  Arrays are used for different sorting algorithms such as insertion sort, quick sort, bubble sort &merge sort.

5. Graphs can be used to represent locations and routes in GPS. Locations are vertices and the routes connecting locations are edges, also use to calculate the shortest route between two locations.

Conclusion

 

Data structure is the key part of many computer algorithms as they allow the programmers to do data management in an efficient way.

 

References

 

https://tutorialink.com/ds/types-of-data-structures.ds http://www.javatpoint.com/data-structure-tutorial

https://towardsdatascience.com/8-common-data-structure-every- programmer-must- know-171acf6a1a42