Scribd
Upload
19 views23 pages

Lecture 1

Uploaded by

Abir Saha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views23 pages

Lecture 1

Uploaded by

Abir Saha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

Introduction to Data

Structures & Algorithms


Data Structures
• A data structure is an aggregation of data components that together
constitute a meaningful whole.
• It is a group of data elements that are put together under one name,
and which defines a particular way of storing and organizing data in a
computer so that it can be used efficiently
• It is a collection of data, organized so that items can be stored and
retrieved by some fixed techniques.
Contd.
• Data structure affects the design of both structural & functional
aspects of a program
• Program=algorithm + Data Structure
• Algorithm is a set of instruction written to carry out certain tasks &
the data structure is the way of organizing the data with their logical
relationship retained
• Algorithm and its associated data structures from a program
Classification of Data Structure
• primitive and Non-primitive Data Structure
Classification
• Non-primitive-Linear and Non-linear Data Structure
primitive Data Structure
• Fundamental data types which are supported by a programming
language
• Different representation on different OS and hardware
• E.g-Integer, floating point, character etc.
Non-primitive
• Derived from primitive data structure
• Emphasize on structuring of a group of homogeneous (same type) or
heterogeneous (different type) data items
Linear Data Structure
• The array, list, queue, and stack belong to this category
• Each of them is a collection that stores its entries in a linear sequence
or order
• Entries may be added or removed
• Follow specific rule to add, remove, or access items
Non-linear
• If elements of the data structure are not stored in a sequential order,
then it is non-linear data structure
• Relationship of adjacency is not maintained among elements
• Ex-tree, graphs
Operations on Data Structure
• Traversing
• Searching
• Inserting
• Deleting
• Sorting
• Merging
Abstract Data Type
• An ADT is a mathematical model of a data structure that specifies the
type of data stored, the operations supported on them, and the types
of parameters of the operations
• An ADT specifies what each operation does, but not how it does it
• Typically, an ADT can be implemented using one of many different
data structures
ADT
Steps to design ADT
• Understand and clarify the nature of the target information unit
• Identify and determine which data objects and operations to include in
the models.
• Express this property somewhat formally so that it can be understood
and communicate well.
• Translate this formal specification into proper language
• Upon finalized specification, write necessary implementation
• This includes storage scheme and operational detail. Operational detail
is expressed as separate functions (methods).
ADT
• A conceptual specification of a data type
• Includes description of object, description of operations on it
• No specification of how to implement the object, operations
• Could have many different implementations of the same ADT
• Programmers implement the ADT; can see internal variables, function
definitions, etc.

• Users instantiate and work with the ADT; can see only the external
operations / behavior
ADT Example
Example: Stack
• Contains various values of like type
• May have maximum size
• Values of appropriate type can be added to or removed from the stack
• Push operation adds a value to the stack
• Pop operation removes the last added value from the stack (LIFO)
• Is_Empty operation tells whether stack contains any values
• Is_Full operation tells whether stack is full (if applicable)
• It is an error to Pop from an empty stack
ADT implementation int Pop (stack* s)
{
typedef struct
if ( s -> cur_pos == 0 )
{
{printf("Stack empty!\n“);
int cur_pos ;
return -1; }
int array [ 100 ] ; // at most 100 elements in stack
else
} stack;
return s -> array [ -- s -> cur_pos ];
void Init ( stack* s )
}
{
void main()
s -> cur_pos = 0;
{
}
stack s1, s2; int x,y;
void Push ( stack* s, int x )
Init ( &s1 ); Init( &s2 );
{
Push ( &s1, 7 );
if ( s -> cur_pos == 100 )
Push ( &s2, 9 ); // Good...
printf("Stack full!\n“);
x = Pop ( &s2 );
else
y = Pop ( &s1 );
s -> array [ s -> cur_pos ++ ] = x;
x = s1.array[187];
}
s2.array[503] = 6; // ... and bad
s2.cur_pos = -
3;
}
Algorithms
• A process or a set of well-defined instructions to solve a particular
problem
• It takes a set of input and produces a desired output
Example
An algorithm to add two numbers:
• Take two number inputs
• Add numbers using the + operator
• Display the result
Properties of Algorithm
• Input and output should be defined precisely.
• Each step in the algorithm should be clear and unambiguous.
• Algorithms should be most effective among many different ways to
solve a problem.
• An algorithm shouldn't include computer code. Instead, the algorithm
should be written in such a way that it can be used in different
programming languages.
Pseudocode
• Pseudocode gives a high-level description of an algorithm without the
ambiguity associated with plain text but also without the need to
know the syntax of a particular programming language

• The running time can be estimated in a more general manner by using


Pseudocode to represent the algorithm as a set of fundamental
operations which can then be counted
• It is informal description of algorithm
Find Greatest of Two Numbers
Step 1: Start

Step 2: get a,b value

Step 3: check if(a>b) print a is greater

Step 4: else b is greater

Step 5: Stop
Flow Chart
• A flowchart is a type of
diagram that represents an
algorithm, workflow or
process.
• It shows the steps as boxes
of various kinds, and their
order by connecting the
boxes with arrows.
• Diagrammatic
representation illustrates a
solution model to a given
problem
Flow Chart: Maximum of two numbers
Example-Algorithm
Algorithm: Insertion-Sort
• Input: A list L of integers of length n
• Output: A sorted list L1 containing those integers present in L
• Step 1: Keep a sorted list L1 which starts off empty
• Step 2: Perform Step 3 for each element in the original list L
• Step 3: Insert it into the correct position in the sorted list L1.
• Step 4: Return the sorted list
• Step 5: Stop
Example-Pseudocode
for i <- 1 to length(A)
x <- A[i]
j <- i
while j > 0 and A[j-1] > x
A[j] <- A[j-1]
j <- j - 1
A[j] <- x

You might also like