This document defines and describes various data structures. It explains that a data structure organizes data in a way that it can be used effectively. It categorizes data structures as linear and non-linear. Linear data structures arrange elements in a sequence, like arrays, stacks, and queues. Non-linear structures arrange elements hierarchically without a defined sequence, like trees and graphs. The document also discusses static versus dynamic data structures and their advantages.

3. DATA STRUCTURE
A data structure is a particular way of
organizing data in a computer so that it can be
used effectively. For example, we can store a list
of items having the same data-type using the
array data structure.

4. Types of Data Structure
• Linear data structure
• Non-linear data structure

5. Linear data structure
In linear data structures, the elements are
arranged in sequence one after the other. Since
elements are arranged in particular order, they
are easy to implement.

6. Array Data Structure
In an array, elements in memory are arranged in
continuous memory. All the elements of an
array are of the same type. And, the type of
elements that can be stored in the form of
arrays is determined by the programming
language.

7. Stack Data Structure
In stack data structure, elements are stored in
the LIFO principle. That is, the last element
stored in a stack will be removed first.

8. Queue Data Structure
Unlike stack, the queue data structure works in
the FIFO principle where first element stored
in the queue will be removed first.
It works just like a queue of people in the ticket
counter where first person on the queue will get
the ticket first.

9. Linked List Data Structure
In linked list data structure, data elements are
connected through a series of nodes. And,
each node contains the data items and
address to the next node.

10. Non-linear data structure
Unlike linear data structures, elements in non-
linear data structures are not in any sequence.
Instead they are arranged in a hierarchical
manner where one element will be connected
to one or more elements.

11. Graph Data Structure
In graph data structure, each node is called
vertex and each vertex is connected to other
vertices through edges.

12. Trees Data Structure
Similar to a graph, a tree is also a collection of
vertices and edges. However, in tree data
structure, there can only be one edge
between two vertices.

13. Dynamic Data Structure
In Static data structure the size of the structure
is fixed. The content of the data structure can
be modified but without changing the
memory space allocated to it.

14. Advantage of Static data structure
• Data type size is fixed
• Memory allocation before program execution.
• Stack is used.
• Less efficient than dynamic data structure.
• No memory reuse.
• Overflow is not possible.

15. Dynamic Data Structure
In Dynamic data structure the size of the
structure in not fixed and can be modified
during the operations performed on it.
Dynamic data structures are designed to
facilitate change of data structures in the run
time.

16. Advantage Of Dynamic Data Structure
• Memory allocation is done during program
execution.
• Heap is used.
• More efficient.
• Memory reuse.
• Overflow occurs.
• Data type size is not fixed

17. THANK YOU