Data Structure is nothing but a collection of information and manipulation of collected information.
What is Information?
In Computer Science, information is the data that is specific,timely,used for a perform a task in the computer.The basic unit of information is bit having two values 0 or 1.0 represents 'OFF' Position and 1 represents 'ON' Position.
Why DataStructures are most important?
DataStructures are most important because of the following three reasons:
1. DataStructures are more important for every program and system software.
2. Datastructures are most important for generating effecient algorithms enabling best management of huge data collections such as integrated collection of database.
3. In software design, instead of algorithms Datastructures are used as key organising factor.
Applications:
In which areas Datastructures are applied?
Usually datastructures are applied in the areas where large data are collected and manipulated. Some of those areas are:
1. Database Management System
2. Operating System
3. Statistical Analysis Package
4. Numerical Analysis
5. Graphics.
Different Types of Datastructures:
We have large number of various forms of data structures. Among them the commonly used are:
1. Arrays: collection of elements having similar datatype.
2. Associative arrays: Also known as dictionary or map. Here name-value pair can be inserted or deleted easily. Hash table datastructure is commonly implemented.
3. Record: Also known as tuple or struct.Record is a collection of sequentially arranged values that are indexed with a fixed size.
4. Union: collection of values with various primitive types that can be stored at its instances.
5. Tagged Union: similar to union having a current datatype as its additional field.
6. Set: Abstract Data Structure having collection of values that are not repeated and not in order.
7. Graphs: Linked Abstract Data Structure having nodes.Used to represent networks.
8.Trees: Linked Abstract Data Structure having nodes.Used in sorting and searching.
Why DataStructures are most important?
DataStructures are most important because of the following three reasons:
1. DataStructures are more important for every program and system software.
2. Datastructures are most important for generating effecient algorithms enabling best management of huge data collections such as integrated collection of database.
3. In software design, instead of algorithms Datastructures are used as key organising factor.
Applications:
In which areas Datastructures are applied?
Usually datastructures are applied in the areas where large data are collected and manipulated. Some of those areas are:
1. Database Management System
2. Operating System
3. Statistical Analysis Package
4. Numerical Analysis
5. Graphics.
Different Types of Datastructures:
We have large number of various forms of data structures. Among them the commonly used are:
1. Arrays: collection of elements having similar datatype.
2. Associative arrays: Also known as dictionary or map. Here name-value pair can be inserted or deleted easily. Hash table datastructure is commonly implemented.
3. Record: Also known as tuple or struct.Record is a collection of sequentially arranged values that are indexed with a fixed size.
4. Union: collection of values with various primitive types that can be stored at its instances.
5. Tagged Union: similar to union having a current datatype as its additional field.
6. Set: Abstract Data Structure having collection of values that are not repeated and not in order.
7. Graphs: Linked Abstract Data Structure having nodes.Used to represent networks.
8.Trees: Linked Abstract Data Structure having nodes.Used in sorting and searching.
Advantages of DataStructures:
1. Data Structures are the best way to handle huge data in a secured manner.
2. To make changes in hardware, we need to change its datastructure instead of their application.
3. Data structures are highly used for their effeciency and code reusability.
Disadvantages of DataStructures:
1. It is hard to make changes in large data structures.
2.Quite complex to solve problems in data structures.
No comments:
Post a Comment