0% found this document useful (0 votes)

19 views103 pages

DAA-Unit-1 Students (204-25)

Uploaded by

anushkamishra545

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

19 views103 pages

DAA-Unit-1 Students (204-25)

Uploaded by

anushkamishra545

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 103

DESIGN AND ANALYSIS OF ALGORITHMS

(DAA)

DEPARTMENT OF CSE &IT

@Dr. Shankar Thawkar-HOD

Introduction to Algorithms
▪ The word algorithm comes from the name of
Persian author “Abu Jafar Mohd. Ibn musa Al
Khawarizmi” ( 825 AD) , who wrote a text book on
Mathematics.

• Originally, “Algorisme” [old French] referred to just the Arabic number

system, but eventually it came to mean “Algorithm” as we know today.

@Dr. Shankar Thawkar-HOD

Introduction to Algorithms
▪ An Algorithm is a set of instructions to solve a particular problem.

Problem

algorithm

input “Computer” output

@Dr. Shankar Thawkar-HOD
Difference between Algorithm , Pseudocode & Program
• Algorithm :Systematic logical approach to solve any problem.It can
be written in natural language.

• Pseudocode : It is simple version of programming code that does

not require any strict programming language syntax.

• Program : it is exact code written in any particular programming

language

@Dr. Shankar Thawkar-HOD

Example of Algorithm

1. Input two positive integers, a and b.

2. If a<b, exchange a and b.
3. Divide a by b and get the remainder, r
4. If r=0, report b as the GCD of a and b
5. Replace a by b and replace b by r
6. Goto step 3

@Dr. Shankar Thawkar-HOD

Real-World Applications

Hardware design Compiler Search Engines Security

Computer Graphics AI and Robotics Satellite tracking

Machine Learning Computer

@Dr. Network
Shankar Thawkar-HOD Computational Biology
Characteristics of an Algorithm
▪ Input – it take zero or more quantity as input
▪ Output – produce at least one quantity as output
▪ Finiteness – it must terminate after finite steps
▪ Definiteness- every instruction must be clear and
unambiguous
▪ Effectiveness - every instruction must be basic

Example- 1. Input integer n

2. Divide n by 2 and get the remainder, r
3. If r=0, report n is even else n is odd
@Dr. Shankar Thawkar-HOD
Algorithm Design Techniques
▪ Divide and Conquer (DAC)
▪ Greedy method
▪ Dynamic Programming
▪ Backtracking
▪ Branch and Bound

▪ NP Problems

@Dr. Shankar Thawkar-HOD

Analysis of Algorithms

▪ A given problem can be solved using many

techniques. It means there are many ways to
solve a particular problem.

▪ So how will you decide which algorithm is

best.

@Dr. Shankar Thawkar-HOD

References
▪ Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to
Algorithms”, Printice Hall of India.
▪ E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms", 3. Aho,
Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson
Education, 2008.
▪ LEE "Design & Analysis of Algorithms (POD)",McGraw Hill
▪ Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
▪ Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.

@Dr. Shankar Thawkar-HOD

Complexity of an Algorithm
▪ Measured in two terms-
▪ Space complexity

▪ Time complexity

@Dr. Shankar Thawkar-HOD

Space Complexity
▪ It is measured in terms of the space required for the data
elements (variables and constant).

e.g.
Sum ( a, b)
{
int c;
c=a+b;
}
Space required= 3 unit ( for a, b, c)
@Dr. Shankar Thawkar-HOD
Time Complexity
▪ Time required for the execution of an Algorithm.
▪ Analysis are of two types-
▪ Priori Analysis

▪ Posterior Analysis

▪ Priori Analysis-
▪ Analyze the algorithm before execution on a machine.
▪ Use frequency count method.
▪ Time complexity of an algorithm is denoted by f(n), where n is input size.
▪ No unit for time
@Dr. Shankar Thawkar-HOD
Ex-2 Find the following algorithms-

a=b+c for i=1 to n

a=b+c
end

@Dr. Shankar Thawkar-HOD

Ex-3 consider the following algorithms-

for i=1 to n mat_mul(a,b)

for i=1 to n { int c;
a=b+c for i=1 to n
end for j=1 to n
end for k=1 to n
cij= aik* bkj
}

@Dr. Shankar Thawkar-HOD

Time Complexity
▪ Posterior Analysis- Analyze the algorithm after execution.
▪ It depends on following factors-
▪ Machine being used

▪ Language and its compiler

▪ Environment being used

▪ Unit of time is sec, ms, ns etc

@Dr. Shankar Thawkar-HOD

Best case, Average case and Worst case Analysis
• Consider a Linear search Algorithm
1. Read N of an Array A
2. Read searching element X
3. For I = 1 to N
4. If A[i]= X then display “ found X and exist”
5. End loop

Ex. -1 10 1 20 6 7 15 100 25 30

1. Best Case :
▪ It occur , if the searching element found at first position. i.e. f(n)=O(1)
▪ It indicate minimum time required for the algorithm.
@Dr. Shankar Thawkar-HOD
Best , Average and Worst case Analysis
Example- 10 1 20 6 7 15 100 25 30

2. Average case :
▪ In this, we assume that element may be found at any position. So we consider a
probability-
i.e. f(n)= 1/n + 2/n+ 3/n+……………..+n/n
= (n+1)/2= O(n)
▪ It indicate average time required for the algorithm.

3. Worst case :
▪ It occur , if the searching element is found at last position. Or does not found i.e.
f(n)=O(n)
▪ It indicate maximum time required for the algorithm.
@Dr. Shankar Thawkar-HOD
Asymptotic Notations
▪ Big oh ‘O’ Notation
▪ Omega ‘Ω’ Notation
▪ Theta ‘θ’ Notation

@Dr. Shankar Thawkar-HOD

Big oh ‘O’ Notation-
Definition-
f(n)= O(g(n)), if their exist positive constants c and n0 such that –
f(n) ≤ c g(n) ; for all n≥n0 , c is constant.

- It represent the worst case .

Example- 3n+2=O(n)

@Dr. Shankar Thawkar-HOD

Ex-2 : 10n2 + 2=O(n2) Ex-3 5n2 – 6n=O(n2)
We Know, We Know,
f(n) ≤ c g(n) f(n) ≤ c g(n)

@Dr. Shankar Thawkar-HOD

Omega ‘Ω’ Notation-
Definition-
f(n)= Ω(g(n)) if their exist positive constants c and n0 such that –
f(n) ≥ c g(n) ; for all n≥n0 , c is constant.

- It represent the best case .

Example- 3n+2= Ω(n)

@Dr. Shankar Thawkar-HOD

Theta ‘θ’ Notation-
Definition- f(n)= θ(g(n)) if their exist positive constants c1,c2 and n0 such that –
c1 g(n) ≤ f(n) ≤ c2 g(n) ; for all n≥n0

- It represent the Average case .

Ex- 5n+2= θ(n)
According to definition
c1 g(n) ≤ f(n) ≤ c2 g(n)

@Dr. Shankar Thawkar-HOD

@Dr. Shankar Thawkar-HOD
@Dr. Shankar Thawkar-HOD
Recurrence Relations
• It is used to express the complexity of an recursive algorithm.
Ex-1 Recursive algorithm to find factorial of number n
f(n)
{ if (n=0) return 1
else
return ( n * f(n-1))
}
So, Complexity is T(n)= T (n-1)+1

@Dr. Shankar Thawkar-HOD

Recurrence Relations
Ex-2 Recursive algorithm
fun (n)
{ if (n=1) return 1
else
return fun(n/2)
}
So, Complexity is T(n)= T (n/2)+c

Ex-3 Recursive algorithm

fun (n)
{ if (n=1) return 1
else
return (fun(n/2)+fun (n/2))
}
So, Complexity is T(n)= 2T (n/2)+c
@Dr. Shankar Thawkar-HOD
Recurrence Relations
Ex-4 : Recursive algorithm to generate Fibonacci series
f(n)
{ if (n ≤ 1) return 1
else
return (f (n-1)+f(n-2))
}

So, Complexity is T(n)= T (n-1)+ T (n-2)+ c

@Dr. Shankar Thawkar-HOD
Recurrence Relations
• Following methods are used to solve Recurrence relations-
▪ Master Method

▪ Iterative substitution method

▪ Recursion tree method

@Dr. Shankar Thawkar-HOD

Master Method / Master Theorem
Definition-
Let T(n)= a T(n/b)+ θ (nk logp n) where a≥1 , b>1, k ≥0 and p is a real number then

❑ Case 1 : if a>bk then T(n)= θ (nlogba )

❑ Case 2 : if a=bk
a. If p>-1 then T(n)= θ (nlogba logP+1 n)
b. If p= -1 then T(n)= θ (nlogba log log n)
c. If p< -1 then T(n)= θ (nlogba )
❑ Case 3 : a<bk
a. If p ≥ 0 then T(n)= θ (nk logP n)
b. If p<0 then T(n)= θ (nk)