# data[].attributes.headline
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Data structures provide a means to manage large amounts of data efficiently. efficient data structures are a key to designing efficient algorithms. There are stack, queue and linked list data structure.

# data[].attributes.subject
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Data structures provide a means to manage large amounts of data efficiently. efficient data structures are a key to designing efficient algorithms. There are stack, queue and linked list data structure.

# data[].attributes.body
Data structures are used to store data in a computer in an organized fashion. Different types of data structures are:-

Stack- Works in first in last out order. The element inserted first in stack is removed last.

Queue- First in First out order. The element inserted first is removed first.

Linked list- Stored data in a linear fashion.

Trees- Stores data in a non linear fashion with one root node and sub nodes.

# data[].attributes.body
Data structures are used in computing to make it easy to locate and retrieve information. Primitive data structures are simple ways for programming languages to represent basic values. These include data types like integer, char (character), Boolean, pointers, and the like. Non-primitive data structures provide ways of storing multiple values in a single variable. These include arrays, lists, stacks, trees, and so forth. Data structures can also be used to group and organize other data

# data[].attributes.body
anything that can store data can be called as a data structure, hence Integer, Float, Boolean, Char etc, all are data structures. They are known as Primitive Data Structures.

Then we also have some complex Data Structures, which are used to store large and connected data. Some example of Abstract Data Structure are :

Linked List

Tree

Graph

Stack, Queue etc.

All these data structures allow us to perform different operations on data. We select these data structures based on which type of operation is required.

# data[].attributes.body
A data structure is a specialized format for organizing and storing data.

# data[].attributes.headline
Data structure is important in developing a complete program . We need to deal with a collection or bunch of array in implementing this method.

# data[].attributes.subject
Data structure is important in developing a complete program . We need to deal with a collection or bunch of array in implementing this method.

# data[].attributes.body
Data Structure is an implementation of Abstract Data Type.
Abstract data type is used to define high level features and operations for data structure.

# data[].attributes.body
Data structure is a specialized format for organizing and storing data so that it can be accessed and worked with in appropriate ways to make a program efficient

# data[].attributes.body
Data Structure are structure programmed to store ordered data, so that various operations can be performed on it easily. It represents the knowledge of data to be organized in memory. It should be designed and implemented in such a way that it reduces the complexity and increases the efficiency.

Example of data structure are tree, linked list and arrays.

# data[].attributes.body
Data structure is such a way that collecting and organizing data where we can perform an operation on these data in effective way. It is also about rendering data elements in terms of relationship for a better organization and storage.

# data[].attributes.body
Data structure is a scheme for organizing data in the memory of a computer. Commonly used data structures include lists, arrays, stacks, queues, heaps, trees, and graphs. The way in which the data is organized affects the performance of a program for different tasks.

# data[].attributes.body
that because to organize data and stored that can be accessed efficiently . Examples of data structure are lists, arrays, stacks, queues, heaps, trees, and graphs

Advantages,,

1) Allows easier processing of data.
2) Allows information stored on disk very efficiently .
3) These are necessary for designing an efficient algorithm.
4) We can access data anytime and anywhere.

Disadvantages,,

1) It is applicable only for advanced users.
2)Only can be solved by experts when any issues occurs.
3) Slow access in case of some data types

# data[].attributes.body
Data structure as we know way in which data are stored for efficient search and retrieval. Different data structures are suited for different problems. Some data structure are useful for simple general problems, such as retrieving data that has been stored with a specific identifier. For example, an online dictionary can be structured so that it can retrieve the definition of a word. On the other hand, specialized data structures have been devised to solve complex specific search problems.

# data[].attributes.body
Data structure is software artifacts which allow user to store and organize data in a computer, so that it can be used efficiently. Data structures are divided into many groups, which are primitive and non -primitive data structures. Integers, pointers, floats and characters are the example of primitive data structures, while examples of non-primitive are list, array,tree, heaps, stack and queue.

A data structure said to be linear if its elements are connected in linear or in sequence. Example of linear data structures are queue and stack. Non linear data structures are those data structure in which data items are not in sequence. For example, binary tree.

An Abstract Data Type (ADT) is a description on how we view the data and allow user to abstract away from implementation details. Advantages of ADT are modularity, which it is much easier to debug small routines than large routines and it also easier several people to work on a program simultaneously. Next, ADT also have encapsulation as it can access by well-defined interface only.

Disadvantages of ADT are insertion and deletion process is slow and it has redundant memory space as it will be difficult to estimate the size of array.

# data[].attributes.body
A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways.

# data[].attributes.body
Primitive data structure
-Primitive Data Structures are the basic data structures that directly operate upon the machine instructions.
-Integers, Floating point numbers, Character constants, String constants and Pointers come under this category.

Non-primitive data structure
-Non-primitive data structures are more complicated data structures and are derived from primitive data structures.
-Arrays, Lists and Files come under this category.

# data[].attributes.body
Data structure is important to find the best solution to optimize performance and utilize memory space in the best way. it is the study of data behaviour and data organization.

# data[].attributes.body
Data Structure is a way of collecting and organising data in such a way that we can perform operations on data in an effective way.

There are two types of data structure: primitive data structures and non-primitive data structure.

Pro and cons of different data structures:-

Array -

Pros:
-> Access to an array element is fast since we can compute its location quickly.
Cons:
-> If we want to insert or delete an element, we have to shift subsequent elements which slows our computation down.

Linked Lists –
Pros:
-> Inserting and deleting data does not require us to move/shift subsequent data elements.

Cons:

->Linked lists require more memory.

Stack –

Pros:

-> Not easily corrupted.

Cons:

-> Creating too many objects on the stack will increase the chances of stack overflow.

Queue -
Pros:

-> Not easily corrupted

Cons:
-> Random access not possible

Tree -
Pros:
-> Searching is faster (with some ordering e.g., BST). We can search for a given key in moderate time (quicker than Linked List and slower than arrays)

Cons:
-> High overhead

Heap -
Pros:

-> It can offer the maximum memory an OS can provide

Cons:
-> You must make sure to free the memory when you are done

Graph -
Pros:
-> Finding the path in efficient way
Cons:
-> High overhead

# data[].attributes.body
Data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently.

# data[].attributes.headline
What do knows about Data structure? Abstraction

# data[].attributes.subject
What do knows about Data structure? Abstraction

# data[].attributes.body
Data structure is a method of organizing large amount of data more efficiently so that any operation on that data becomes easy.

--> Every data structure is used to organize the large amount of data
--> Every data structure follows a particular principle
--> The operations in a data structure should not violate the basic principle of that data structure.

Based on the organizing method of a data structure, data structures are divided into two types.

- Linear Data Structures

- Non - Linear Data Structures

1. Linear Data Structures

If a data structure is organizing the data in sequential order, then that data structure is called as Linear Data Structure. For example:

- Arrays, List (Linked List), Stack, Queue

2. Non - Linear Data Structures

If a data structure is organizing the data in random order, then that data structure is called as Non-Linear Data Structure. For example:

- Tree, Graph, Dictionaries, Heaps, Tries