Data structures definition: In computer science, a data structure is a particular way of storing and organizing data in a computer so that

it can be used efficiently. Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. Data structures are used in almost every program or software system. Data structures provide a means to manage huge amounts of data efficiently, such as large databases and internet indexing services. It is basic building block of a program.

Algorithm+Data structure=Program

Types: 1.Primitive types

Boolean (for boolean values True/False) Char (for character values) Float (for storing real number values) Double (a larger size of type float) int (for integral or fixed-precision values) String (for string of chars) Enumerated type

2.Composite types(non primitive)

Array

Record (also called tuple or struct)

Union Tagged union (also called a variant, variant record, discriminated union, or disjoint union) Plain old data structure

3.Abstract data types

List Set Priority queue Queue Deque Stack String Tree Graph Hash