DS Unit-1

Prepared by D.
HIMAGIRI
Data Structures
----------------------------------------------------------------------------------------------------------
UNIT-1:
Basic concepts - Algorithm Specification, Data Abstraction , Performance analysis - time
complexity and space complexity, Asymptotic Notation - Big O, Omega and Theta notations,
Introduction to Linear and Non Linear data structures.
Linear list – Singly linked list implementation, insertion, deletion and searching operations on
linear list, Circular linked list implementation, Doubly linked list implementation, insertion,
deletion and searching operations. Applications of linked lists.
---------------------------------------------------------------------------------------------------------------------
Data Structure:
Data Structure is a way to store and organize data in a computer so that it can be used
efficiently.
A data structure is seen as a logical concept that address two fundamental concerns.
i) How the data will be stored, and
ii) What operations will be performed on it.
 There are two types of data structures-Linear and Non-Linear Data Structures.
 Examples:Arrays,Stack,Queues,Trees, etc..
1
Prepared by D.HIMAGIRI
Algorithm Specification
Algorithm:
 An Algorithm is a finite set of instructions that, if followed, accomplishes a particular
task.
 Characteristics of an Algorithm:
i. INPUT: Zero or more quantities are externally supplied.
ii. OUTPUT : At least one quantity is produced.
iii. DEFINITENESS : Each instruction is clear and unambiguous.
iv. FINITENESS : If we trace out the instructions of an algorithm, then for all cases,
the algorithm terminates after a finite number of steps.
v. EFFECTIVENESS : An algorithm is also generally expected to be effective. This

means that all of the operations to be performed in the algorithm must be
sufficiently basic that they can in principle be done exactly and in a finite length of
time.
2
Algorithm Specification....
Algorithm can be described in three ways:

Natural language like English: In this any natural language is used to describe the
algorithm. This is informal way of describing the algorithm.
Graphic representation called flowchart: This method will work well when the
algorithm is small and simple.
Pseudo-code Method: In this method, we should typically describe algorithms as
program, It uses the structural conventions of a normal programming language, but is
intended for human reading rather than machine reading. There is no need to follow all
the syntax rules of a programming language.
Data Abstraction:
Abstraction means displaying only essential information and hiding the details. Data
abstraction refers to providing only essential information about the data to the outside world,
hiding the background details or implementation. 3
Performance Analysis
Performance analysis of an algorithm depends upon two factors i.e. amount of memory used
and amount of compute time consumed on any CPU.
It can done using following two complexities:
i) Space Complexity:
 It is a function of the space needed by the algorithm to run to completion.
 It is calculated as sum of following two components:

i) Fixed Component- This includes space of simple variables, constants and instruction
space . It does not depend on input and output characteristics.
ii) Variable Component-This includes space of reference variables and the recursion
stack space. It depend on input and output characteristics.
Space(A)=Fixed Component(A) + Variable Component(A)
4
Performance Analysis....
ii) Time Complexity:

It is a function of time needed by the algorithm to complete its execution.
It is calculated by counting the no. of elementary steps performed by algorithm to
completes its execution.
Example 1 :Computing Space and Time complexity of an algorithm:
1. Algorithm Sum(a,n)
2.{
3. s=0.0;
4. for i=1 to n do
5. s=s+a[i];
6. return s;
7. }
Space Complexity:
Fixed Components are: s - 1 word Variable Component are: a - n words
i – 1 word
n- 1 word
Total=3 words
Space Complexity=(3+n) words=O(n) 5
Time Complexity:
1. Algorithm Sum(a,n) No. of elementary steps
2.{
3. s=0.0; -------------------------------- 1
4. for i=1 to n do ------------------------- n+1
5. s=s+a[i]; ------------------------------ n
6. return s; ------------------------------- 1
7. }
Total---------------------------- 2n+3
Time Complexity is given as O(n)
6
Example 2:
1. Algorithm Add(A,B,n) No. of elementary steps
2.{
3. for(i=0;i< n;i++) ------------------- n+1
4. {
5. for(j=0;j< n;j++)------------------- n*(n+1)
6. {
7. C[i,j]=A[i,j]+B[i,j] ------------ n*n
8. }
9. }
10. }
Total-------------------------n+1+n*(n+1)+n*n=2n2+ 2n+1
Time Complexity=O(n2)
Space Complexity is : Fixed components are i,j,n------each 1 word=3 words
Variable components are A-n*n,B-n*n and C-n*n=3n2
Total=3n2+3
Space complexity=O(n2)
7
Asymptotic Notations
Asymptomatic analysis of an algorithm refers to defining the mathematical boundation of its

runtime performance.
Using this we can conclude the best case, average case and worst case scenario of an algorithm.
The time required by an algorithm falls under three types:
Best case: Minimum time required for program execution
Average case: Average time required for program execution.
Worst case: Maximum time required for program execution.

Asymptomatic notations are the expressions that are used to represent the complexity of an
algorithm.
Types of Asymptomatic notations are:
i) Big-Oh Notation (O)
ii) Big-Omega Notation(Ω)
iii) Big -Theta Notation ( Θ)
8
Asymptotic Notations...
 Big-Oh Notation (O)

 It describes the worst case scenerio,it represents the upper bound running time
complexity of an algorithm .
 if f(n) ≤ cg(n) ∀ n≥n0 where c>0 and n0 >=1 then we can say that f(n) = O(g(n)) .
9
 Big-Omega Notation(Ω)
 It describes the best case scenerio,it represents the lower bound running time
complexity of an algorithm .
 if f(n)>=c.g(n) ∀ n≥n0 where c>0 and n0 >=1 then we can say that f(n) = Ω (g(n)) .
10
 Big -Theta Notation ( Θ)

 It describes the average case scenerio,it represents the lower bound and upper bound of
an algorithm .
 if c1g(n)<=f(n)<=c2.g(n) ∀ n≥n0 where c1,c2>0 and n0 >=1 then we can say that
f(n) = Θ (g(n)) .
11
Linear & Non-linear Data Structure
Linear Data Structure:

 In this data elements are arranged sequentially or in linear fashion.
 It involves single level ,therefore we can traverse all the elements in single run only.
 Linear data structures are easy to implement because computer memory is arranged in a
linear way.
Non -Linear Data Structure:
In this data elements are not arranged sequentially or linearly .
It does not involve single level, therefore, we can’t traverse all the elements in single run.
 They are not easy to implement in comparison to linear data structure.
 It utilizes computer memory efficiently in comparison to a linear data structure.
12
Linear & Non-linear Data Structure....
 Difference between Linear and Non-Linear Data structures :
Sr. No. Key Linear Data Structures Non-linear Data Structures
In linear data structure, data In non-linear data structure, data

Data Element elements are sequentially elements are hierarchically
1
Arrangement connected and each element is connected and are present at
traversable through a single run. various levels.
In linear data structure, all data In non-linear data structure, data

2 Levels elements are present at a single elements are present at multiple
level. levels.
Non-linear data structures are
Implementation Linear data structures are easier to difficult to understand and
3
complexity implement. implement as compared to linear
data structures.
Non-linear data structures are not
Linear data structures can be
4 Traversal easy to traverse and needs multiple
traversed completely in a single run.
runs to be traversed completely.
Linear data structures are not very

Non-linear data structures uses
5 Memory utilization memory friendly and are not
memory very efficiently.
utilizing memory efficiently.
6 Examples Array, List, Queue, Stack. Graph,Tree. 13

Linear / Linked List
 Types of linear/linked lists:
1) Single Linked List
2) Doubly Linked List
3) Circular Linked List
 Single Linked List :

 A linked list is a linear collection of data elements. These data elements are called
nodes.
 In single linked list every node contains two fields, data field and link field -a pointer to
the next node/address of next node.
14
Single Linked List....
 The node in a single linked list is declared as
struct node
{
int data;
struct node *next;
};
 The last node address field in the single linked list contains NULL.
 Operations performed on a single linked list:
I. Insertion
II. Deletion
III. Searching
IV. Traversing
15
 Insertion:
Case 1: The new node is inserted at the beginning
16
Case 2: The new node is inserted at the end
17
Case 3: The new node is inserted after a given node
18
Case 4: The new node is inserted before a given node
19
 Deletion : Case 1: The first node is deleted
Case 2: The last node is deleted
20
Case 3: The node after a given node is deleted
21
 Searching:
22
 Traversing:
Traversing a linked list means accessing the nodes of the list in order to perform some
processing on them.
23
Doubly Linked List
 A doubly linked list or a two-way linked list is a more complex type of linked list which
contains a pointer to the next as well as the previous node in the sequence.
 It is a collection of node , in which each node will contain three fields- a pointer to the
previous node ,data, a pointer to the next node.
 The declaration of node in double linked list is given as

struct node
{
struct node *prev;
int data;
struct node *next;
};
The PREV field of the first node and the NEXT field of the last node will contain NULL.
The NEXT field is used to traverse the list in forward direction and PREV field is used to
traverse the list in backward direction. 24
Doubly Linked List....
 Operation on Doubly linked list are
I. Insertion
II. Deletion
III. Searching
IV. Traversing
 Insertion:
Case 1: The new node is inserted at the beginning.
25
 Case 2: The new node is inserted at the end.
26
 Case 3: The new node is inserted after a given node.
27
 Case 4: The new node is inserted before a given node.
28
 Deletion:
Case 1: The first node is deleted.
29
 Deletion:
Case 2: The last node is deleted.
30
 Deletion:
Case 3: The node after a given node is deleted.
31
 Deletion:
Case 4: The node before a given node is deleted.
32
Circular Linked List
 Circular Linked List Types:
I. Circular Single Linked List
II. Circular Doubly Linked List
 Circular Single Linked List:
 In a circular single linked list, the last node contains a pointer to the first node of the
list i,e the last node address field contains the address of the first node.
 Operation on circular single linked list are:

I. Insertion
II. Deletion
III. Searching
IV. Traversing
33
Circular Single Linked List.....
 Insertion:
Case 1: The new node is inserted at the beginning of the circular linked list.
34
 Insertion:
Case 2: The new node is inserted at the end of the circular linked list.
35
 Deletion:
Case 1: The first node is deleted.
36
 Deletion:
Case 2: The last node is deleted.
37
Circular Doubly Linked List
 Circular Doubly Linked List:
 Circular doubly linked list doesn't contain NULL in any of the node.
 The last node NEXT field of the list contains the address of the first node of the list.
 The first node PREV field of the list contain address of the last node of the list.
 Operations:
I. Insertion
II. Deletion
III. Searching
IV. Traversing
 Implementation is more complex than other linked lists.
38
Applications of Linked Lists
 Polynomial Representation
 Implementation of different data structures like stack ,queues etc.

 Dynamic Memory allocation.
 Used in Image viewer-previous and next images are linked , hence we can access by using
next and previous buttons.
 In Operating System, all the running applications are kept in a circular linked list and the OS
gives a fixed time slot to all for running.
 Used in web browser to access the next and previous web pages while browsing.
************
39

DS Unit-1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DS Unit-1

Uploaded by

Copyright:

Available Formats

Prepared by D.

i. INPUT: Zero or more quantities are externally supplied.

ii. OUTPUT : At least one quantity is produced.

iii. DEFINITENESS : Each instruction is clear and unambiguous.

v. EFFECTIVENESS : An algorithm is also generally expected to be effective. This

Algorithm can be described in three ways:

algorithm. This is informal way of describing the algorithm.

algorithm is small and simple.

Pseudo-code Method: In this method, we should typically describe algorithms as

program, It uses the structural conventions of a normal programming language, but is

the syntax rules of a programming language.

It can done using following two complexities:

 It is a function of the space needed by the algorithm to run to completion.

 It is calculated as sum of following two components:

Space(A)=Fixed Component(A) + Variable Component(A)

ii) Time Complexity:

Time Complexity is given as O(n)

Asymptomatic analysis of an algorithm refers to defining the mathematical boundation of its

Average case: Average time required for program execution.

Worst case: Maximum time required for program execution.

ii) Big-Omega Notation(Ω)

iii) Big -Theta Notation ( Θ)

 Big-Oh Notation (O)

 Big -Theta Notation ( Θ)

Linear Data Structure:

In linear data structure, data In non-linear data structure, data

In linear data structure, all data In non-linear data structure, data

Linear data structures are not very

6 Examples Array, List, Queue, Stack. Graph,Tree. 13

2) Doubly Linked List

3) Circular Linked List

 Single Linked List :

 Operations performed on a single linked list:

Case 2: The last node is deleted

 The declaration of node in double linked list is given as

 Operation on circular single linked list are:

 Implementation of different data structures like stack ,queues etc.

You might also like