**|Data structure tutorial|**Data structure is the programmatic way of storing data so data can be used efficiently almost every enterprise application uses various types of data structures in one or another way.

The following terms are the foundation terms of a data structure.

**Interface**

Each data structure has an interface. the interface represents the set of the operation that a data structure supports .an interface only provides the list of supported operations type of parameters they can accept and return the type of this operation.

**Implementation**

The implementation provides the internal representation of the data structure. The implementation also provides the definition of the algorithms used in the operation of the data structure.

**Characteristics of data structure.**

**Correctness**

Data structure implementation should implement its interface correctly.

**Time complexity**

Memory usage of a data structure operation should be as little as possible.

**Need for the data structure.**

As applications are getting complex and data-rich there are three common problem applications face nowadays.

**Data search.**

Consider an inventory of 1 million items of a store. If the application is to search an item. It has to search for items in 1 million items every time slowing down the search. As data grows search will become slower.

**Processor speed**

Processor speed although being very high falls limited if data grows to billion records

**Multiple requests.**

As thousands of users can search for data simultaneously on a web the server even a very fast server fails while searching the data.

To solve the above problems data structure comes to reuse .data can be organized in a data structure in such a way that all items may not be required to be searched and the required data can be searched almost instantly.

**Execution time cases**

**There are three cases which are usually used to compare various data structure execution time in a relative manner.**

**Worst case.**

This is the scenario where a particular data structure operation takes the maximum time it can take. if operations worst-case time is f(n) then this the operation will not take time more than f(n) time where f(n) represents a function of n.

**Average case**

This is the scene depicting the average execution time of an operation of a data structure. if an operation takes f(n) time in execution then the operation will take m f(n)Time.

**Best case**

This is the scene depicting the least possible execution time of operation of a data structure. if an operation takes f(n) time in execution then the actual operation may take time as a random number which would be maximum asf(n)

**.**

**Data:**Are values or a set of values

**Data item data**: Refers to a single unit of values.

**Group items data**: The item that is divided into sub-items is called as group items.

**Elementary item data**: An item that cannot be divided is called elementary items.

**Attribute and entity:**An entity is that which contains certain attributes or properties which may be assigned values.

**Entity set:**

**Entities of similar attributes from an entity set**

**Field**: The field is a single elementary unit of information representing an attribute of an entity.

**Records**: Record is a collection of field values of a given entity.

File: The file is a collection of records of the entities in a given entity set.

**DATA STRUCTURE TUTORIAL REFERENCE LINK.**

**RELATED TUTORIALS FOR LEARNING.**

## Post a Comment

THANKS FOR COMMENT