LECTURE-1

BASIC DATA STRUCTURES

10 21 28

11 20 25

12 21 30

13 22 20
 INTRODUCTION
• Data means value or set of values . Data items refers to a single unit
of values.
• Data is represented in the from of text/numbers/figures/
tables/graphs/pictures etc. A computer language is incomplete
without data.
• Information is derived from data, such as: Average Population of the
states ,percentage of the marks etc.
I
N
F
Method to O
Data Process data R
M
A
T
I
O
N
 DATA STRUCTURE
• A data structure is a way of storing data in a computer so that it can be
used efficiently and it will allow the most efficient algorithm to be
used.
• Different kinds of data structures are suited to different kinds of
applications, and some are highly specialized to specific tasks.
• Structure means a set of rules that holds the data together.
• Taking a combination of data and fit them into such a structure that we
can define its relating rules, we create a data structure.
• A data structure in computer science is a way of storing data in a
computer so that it can be used efficiently.
• An organization of mathematical and logical concepts of data
• Implementation using a programming language
• A proper data structure can make the algorithm or solution more
efficient in terms of time and space
• Data structure + algorithm = Program
 OPERATIONS ON DATA STRUCTURE
1) Traversing: Every data structure contains the set of data elements. Traversing the
data structure means visiting each element of the data structure in order to perform
some specific operation like searching or sorting.
Example: If we need to calculate the average of the marks obtained by a student in
6 different subject, we need to traverse the complete array of marks and
calculate the total sum, then we will divide that sum by the number of subjects
i.e. 6, in order to find the average.

2) Insertion: Insertion can be defined as the process of adding the elements to the data
structure at any location.

3) Deletion: The process of removing an element from the data structure is called
Deletion. We can delete an element from the data structure at any random location.
4) Searching: The process of finding the location of an element within the data
structure is called Searching. There are two algorithms to perform searching, Linear
Search and Binary Search.

5) Sorting: The process of arranging the data structure in a specific order is known as
Sorting. There are many algorithms that can be used to perform sorting, for example,
insertion sort, selection sort, bubble sort, etc.

6) Merging: When two lists List A and List B of size M and N respectively, of similar
type of elements, clubbed or joined to produce the third list, List C of size (M+N),
then this process is called merging
TYPES OF DATA STRUCTURE
 PRIMITIVE DATA STRUCTURE
• Data structures that normally are directly operated upon by machine-
level instructions are known as primitive data structures. Also called
built in data type.
• They are:
1. Integers
2. Boolean (true, false)
3. Floating (Decimal numbers)
4. Character and Strings
 NON PRIMITIVE DATA STRUCTURE
• Non-primitive data structures are more complicated data structures
and are derived from primitive data structures.
• They emphasize on grouping same or different data items
with relationship between each data item.
• Also called derived /compound data type.
• It can be designed by user.
• It can be classified as :
1) Linear data structure
2) Non-linear data structure
 LINEAR DATA STRUCTURE
• A data structure is called linear if all of its elements are arranged in
the linear order.
• In linear data structures, the elements are stored in non-hierarchical
way where each element has the successors and predecessors except
the first and last element.
ARRAY
• An array is a collection of similar type of data items and each data
item is called an element of the array. The data type of the element
may be any valid data type like char, int, float or double.
• The elements of array share the same variable name but each one
carries a different index number known as subscript. The array can be
one dimensional, two dimensional or multidimensional.
• The individual elements of the array age are:
• age[0], age[1], age[2], age[3],......... age[98], age[99].
LINKED LISTS
• Linked List: Linked list is a linear data structure which is used to
maintain a list in the memory. It can be seen as the collection of nodes
stored at non-contiguous memory locations. Each node of the list
contains a pointer to its adjacent node.
STACK
• Stack: Stack is a linear list in which insertion and deletions are
allowed only at one end, called top.
• It follows LIFO i.e. Last In First Out.
• It is named as stack because it behaves like a real-world stack, for
example: - piles of plates or deck of cards etc.
QUEUE
• Queue: Queue is a linear list in which elements can be inserted only
at one end called rear and deleted only at the other end called front.
• Queue is opened at both end therefore it follows First-In-First-Out
(FIFO) methodology for storing the data items.
 NON LINEAR DATA STRUCTURE
• This data structure does not form a sequence i.e. each item or element
is connected with two or more other items in a non-linear
arrangement. The data elements are not arranged in sequential
structure.
TREES
• Trees: Trees are multilevel data structures with a hierarchical
relationship among its elements known as nodes.
• The bottommost nodes in the hierarchy are called leaf node while the
topmost node is called root node.
• Each node contains pointers to point adjacent nodes.
• Tree data structure is based on the parent-child relationship among the
nodes.
• Each node in the tree can have more than one children except the leaf
nodes whereas each node can have at most one parent except the root
node.
GRAPHS
• Graphs: Graphs can be defined as the pictorial representation
of the set of elements (represented by vertices) connected by
the links known as edges. A graph is different from tree in the
sense that a graph can have cycle while the tree can not have
the one.