This document introduces data structures and their classifications. It defines data structure as a structured way of organizing data in a computer so it can be used efficiently. Data structures are classified as simple, linear, and non-linear. Linear structures like arrays, stacks, and queues store elements in a sequence while non-linear structures like trees and graphs have non-sequential relationships. The document discusses common operations on each type and provides examples of different data structures like linked lists, binary trees, and graphs. It concludes by noting data structures should be selected based on the nature of the data and requirements of operations.

1. Introduction to Data
Structure

2. WHAT IS DATA AND STRUCTURE?
 Data is collection of facts and figures
 Structure is the way of organizing so that easily readable
We may defined: “Data structure is a form or organizing of data into
structurally defined format which may be readable or when ever it is
required it may retrieve”.
OR
A particular way of organizing data into computer so that it can be used
efficiently and effectively.
OR
A scheme or methodology for organizing the piece of information.

3. WHY DATA STRUCTURE
 Requirement
 Complexity
 Under one umbrella
 Fast solution
 Easily recall
 Collect all related information
 Generate a primary key for easily understanding
 Required low space
 Time efficient
 Cost Cutting Analysis
 Some time if it is required for remote places

4. WHAT WE WILL STUDY IN DATA
STRUCTURE
 As we defined data is collection of facts and figures: two main attributes which consist
of data either mathematical or logical or may be both
 For the implementation of data structure, computer uses different computer languages
 Quantitative data structure required space and time to store data in memory

5. CLASSIFICATION OF DATA STRUCTURE
Data Structure
Compound Data Structure
GraphTree Files
Non- Linear Data Structure
Linear Data Structure
Integer
Simple Data Structure
Pointer CharacterFloat
ArrayLinked List Stack Queue

6.  Simple Data Structure is constructed on primitive data which consist of simple or standard data
type in computer languages (integer, character (letters, numeric or common punctuation), float
(real numbers))
 Compound Data Structure can be constructed with primitive data and having a specific
functionality which can be defined by user and user may further classified it into Linear and non
linear Data Structure.
 Linear Data Structure if the elements of data in sequence further we will discuss it by their types.
 Non Linear Data Structure every data is attached to several data items and not in sequence or
arrange in proper manner.

7. OPERATIONS PERFORMED IN LINEAR
AND NON LINEAR DATA STRUCTURE
 Adding
 Deleting
 Display
 Retrieve
 Sorting of elements
 Searching of elements

8. TYPES OF LINEAR DATA STRUCTURE
 Array is a type of Linear data structure which is commonly used in Computer
programming it is collection of data having same data types
 Stack is another type of Linear Structure which works on the law of LIFO where
elements add in last can remove/ modify first.
 Queue is also another type which works on FIFO method elements added first can
remove/ modify first it is also known as two ended structure
 Linked List data is not given by their physical placement in memory. Instead, each
element points to the next. It is a data structure consisting of a collection of nodes
which together represent a sequence.

9. TYPES OF NON-LINEAR DATA
STRUCTURE
 Tree is mainly used to represent the data in hierarchical relationship between elements,
Binary tree is also used in non linear in which every node has 2child each of them is
labeled as either left or right child
 Graph is a collection of a finite number of vertices and an edges that connect these
vertices. Edges represent relationships among vertices that stores data elements.
 Undirected Graph: A graph whose edges are unordered pair of vertices.
 Directed Graph: In directed graph a directional edge connect two node/vertex.
 Weighted Graph: A graph having a weight, or number associated with each edge

10. HOW TO SELECT DATA STRUCTURE
 After the analysis of data we recognize its type and nature then the process of selection
comes.
 Determine the operation and the requirement of data user.
 Select the best structure to meet the requirement
 Save time.