This document provides an introduction to data structures. It defines data as collections of numbers, symbols, and alphabets used to represent information. A data structure is a way of organizing this data for efficient storage and manipulation on a computer. Common data structures include linear structures like lists, stacks, and queues which arrange elements in one dimension, and non-linear structures like trees and graphs which arrange elements in multiple dimensions. Examples of where different data structures are used include operating systems, graphics, computer design, blockchain, genetics, image processing, and simulation. The document goes on to describe specific data structures like arrays, linked lists, stacks, queues, binary trees, and binary search trees.

1. DATA STRUCTURE
& ALGORITHM
TOPIC: INTRODUCTION TO DATA STRUCTURE
BY (Amit Singh)
UNIVERSITY ROLL NO.: 14501221093

2.  INTRODUCTION TO DATA STRUCTURE
WHAT IS DATA :
• Data is the collection of different numbers,
symbols, and alphabets to represent
information.
WHAT IS DATA STRUCTURE :
• A data structure is a group of data elements that
provides the easiest way to store and perform
different actions on the data of the computer.
A data structure is a particular way of organizing
data in a computer so that it can be used
effectively. The idea is to reduce the space and
time complexities of different tasks.

3.  TYPE OF DATA STRUCTURE
1. Linear Data Structure
2. Non-Linear Data Structure.
Linear Data Structure:
• Elements are arranged in one dimension ,also known as
linear dimension.
• Example: lists, stack, queue, etc.
Non-Linear Data Structure
• Elements are arranged in one-many, many-one and
many-many dimensions.
• Example: tree, graph, table, etc.

4. Operating system
Graphics
Computer Design
Blockchain
Genetics
Image Processing
Simulation etc.
 DATA STRUCTURES USED IN VARIOUS
FIELDS

5.  ARRAY AND LINKED LISTS
ARRAY: An array is a collection of data items
stored at contiguous memory locations. The idea is
to store multiple items of the same type together.
This makes it easier to calculate the position of
each element by simply adding an offset to a base
value, i.e., the memory location of the first
element of the array (generally denoted by the
name of the array).
LINKED LISTS: Like arrays, Linked List is a linear
data structure. Unlike arrays, linked list elements
are not stored at a contiguous location; the
elements are linked using pointers.

6.  STACK AND QUEUE
STACK: Stack is a linear data structure which follows
a particular order in which the operations are
performed. The order may be LIFO(Last In First Out)
or FILO(First In Last Out). In stack, all insertion and
deletion are permitted at only one end of the list.
QUEUE: Like Stack, Queue is a linear structure
which follows a particular order in which the
operations are performed. The order is First In First
Out (FIFO). In the queue, items are inserted at one
end and deleted from the other end

7.  BINARY TREE AND BINARY TREE SEARCH
BINARY TREE: A binary tree is a tree data structure in which
each node has at most two children, which are referred to as the
left child and the right child. It is implemented mainly using
Links.
BINARY SEARCH TREE: A Binary Search Tree is a Binary Tree
following the additional properties:
• The left part of the root node contains keys less than the root
node key.
• The right part of the root node contains keys greater than the
root node key.
• There is no duplicate key present in the binary tree.

8. THANK YOU
We are really grateful to our DATA STRUCTURE & ALGORITHM Professor ( MR. RAGHU NATH MANNA)
for advising us and introducing the assignment to us in a easy to understand way which has helped
us complete our assignment easily and effectively on time. We are dearly obliged for giving us an
opportunity to work on this assignment which has provided valuable information about (Topic:
INTRODUTION TO DATA STRUCTURE )Thank you.