In this tutorial, we will learn about the theoretical aspect of * Data Structure*: Its

**Definition and Types of data structure in C Programming Langauge**.

A * data structure* is a way of organizing data that reflects not only the items stored but also their relation to each other. Advance familiarity about the relationship between data items allows designing of an efficient set of rules(algorithms) for the manipulation of data.

“In **computer science**, a **data structure** is a selective way of arranging data in a computer

so that it can be utilised efficiently” -(Wikipedia)

**These are the area where Data structure **is** mostly used:**

**Compiler Design****Operating System****Database Management System****Statistical analysis package****Numerical Analysis****Graphics****Artificial Intelligence****Simulation**

A * data structure* needs a certain volume of space for each data item it stores, a certain amount of time to make a single basic operation, and a

*.*

**certain amount of programming effort**Each problem has constraints on available space and time. Each solution to a problem makes use of the basic operations in some relative proportion.

A **data structure** is any data representation and its associated operations. Even an integer or floating point number stored on the computer can be viewed as a **simple data structure**.

**In C language Different types of data structures are mentioned below:**

**Array****Stack****Queue****Linked List**