Computers

# Data Structure Applied Areas on Computer

Data Structure Applied Areas on Computer

Definition of Data Structure Applied Areas on Computer – A data structure is a way of organizing data that not only store data Items, but also establish relationship among each other. Deep knowledge regarding the relationship between data items allows designing of efficient algorithms for the manipulation of data items. They are designed to organize data to suit specific purpose such that it can be accessed and operate in appropriate manner. The efficiency to store, access and process data in excellent manner gave rise to the concept of data structure. Alternatively data structure is a way of organising data in computer so that it can be used efficiently.

What are the Types of Data Structure?

There are generally two types of data structure. They are built in data Structure and User defined Data structure.

Built In Data Structure – Integer, float, Pointer, Char etc.

User Defined data Structure – Graphs, Tree, Array, Stack, Queue etc.

In which areas Data Structure is applied?

The data Structure is extensively used in number of field or areas some of them are –

1. Artificial Intelligence
2. Operating System
3. Simulation
4. Graphics
5. Statistical analysis
6. Compiler Design
7. Database Management System
8. Numerical Analysis

Popular Examples of Data Structure

1. Array
– Array is a data structure used to store homogeneous data values at contiguous locations. The Size of the array must be provided before storing the data. Alternatively, an array is systematic order of same objects which are arranged in rows and columns. Example – Let we look an example for declaring an array –

Int lookarray (50); – This is an integer array named lookarray where upto 50 elements can be stored.

1. Linked List – This is the data structure which store data not in contiguous location and uses pointers for linking or locating the data. It has dynamic size and easy to insert or delete the data. There are various types of functions that linked list create like delete, insert, update etc.
2. Stack
– Stack is a linear data structure which play a particular order in which the operations are performed. The order may be LIFO (Last in First Out) or FILO (First in Last Out). There are three basic operations performed in stack. They are Push, Pop and Isempty.
3. Push: Adds an item into the stack. If the stack is full, then declared to be an Overflow condition.
4. Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then declared to be an Underflow condition. Peek or Top: Returns top element of stack.
5. isEmpty: Returns true if stack is empty, else false.
6. Queue – A queue or FIFO (first in, first out) is a collection of elements, with two main operations:
1. Enqueuer – The process of adding an element to the collection.(The element should added from the rear side)
2. Dequeuer – The process of removing the first element that was added. (The element is removed from the front side).
7. Hashing – Hashing is used to search data according to related keyed used therein. Like storing employee name keyed using phone no. What next to do are –
8. Insert a phone number and corresponding name.
9. Search a phone number and fetch the name.
10. Delete a phone number and related name.

So there are many other data structure used in computer organisation to use data efficiently. So this is a short description regarding Data Structure Applied Areas on Computer.