Lect05 Algorithm PDF

Problem Solving and Algorithms Development
Dr. Odelu Vanga
Department of Computer Science and Information Systems

Birla Institute of Technology and Science Pilani
Hyderabad Campus
odelu.vanga@hyderabad.bits-pilani.ac.in
January 22, 2019
Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 1 / 41

Today’s Objectives
Understand the concept of an algorithm

Three constructs for developing algorithms:

(1). sequence, (2). decision, and (3). repetition

Three constructs for developing algorithms:

(1). sequence, (2). decision, and (3). repetition
Understand the concept of

modularity and subalgorithms

Problem Solving
Can you think of a day in your life which goes without problem solving?

Problem Solving
If someone asks you, what is time now?

Problem Solving

seeing time in your watch and telling him
a kind of problem solving

Problem Solving

A typical programming task can be divided into two phases

Problem Solving


1 Problem solving phase: The sequence of statements which will
produce the desired output for the given input.

Problem Solving


1 Problem solving phase: The sequence of statements which will
produce the desired output for the given input.
2 Implementation phase: Implement the program in some
programming language.

Algorithm Development

Properties of Algorithm
1) Finiteness: An algorithm must always terminate after a

finite number of steps.


2) Definiteness: Each step of an algorithm must be precisely

defined.



defined.
3) Input: The input is the data to be transformed during the

computation to produce the output.



defined.

4) Output: Always expects result in terms of output from an

algorithm.



defined.

4) Output: Always expects result in terms of output from an

algorithm.
5) Effectiveness: Algorithms to be developed/written using

basic operations.
1. Define the essential input to the algorithm.
2. Specify desired output after algorithm is executed.
3. Statements in the algorithm should define clearly.

Problem: Write an algorithm to find sum of two positive numbers

Inputs to the algorithm: two positive numbers.

Expected output: Positive number.

Algorithm:

Algorithm:
1: Start

Algorithm:
1: Start
2: Read n1

Algorithm:
1: Start
2: Read n1
3: Read n2

Algorithm:
1: Start
2: Read n1
3: Read n2
4: Sum ← n1 + n2

Algorithm:
1: Start
2: Read n1
3: Read n2
4: Sum ← n1 + n2
5: Print Sum

Algorithm:
1: Start
2: Read n1
3: Read n2
4: Sum ← n1 + n2
5: Print Sum
6: Stop
Finding the largest integer among five integers







Defining actions in FindLargest algorithm






FindLargest refined

Generalization of FindLargest

Three Constructs

Three Constructs

Three Constructs

Algorithm FindLargest of N numbers

Input: N positive integers
Output: Largest number

Start

Start
1: Set Largest to 0

Start
1: Set Largest to 0
2: Set Counter to 0

Start
1: Set Largest to 0
2: Set Counter to 0
3: while (Counter less than N)

Start
1: Set Largest to 0
2: Set Counter to 0
3.1: if (the integer is greater than Largest)
then

Start
1: Set Largest to 0
2: Set Counter to 0
then
3.1.1: Set Largest to the value of the integer
End if

Start
1: Set Largest to 0
2: Set Counter to 0
then
End if
3.2: Increment Counter

Start
1: Set Largest to 0
2: Set Counter to 0
then
End if
End while

Start
1: Set Largest to 0
2: Set Counter to 0
then
End if
End while
4: Return Largest

Start
1: Set Largest to 0
2: Set Counter to 0
then
End if
End while
4: Return Largest
End
Concept of Subalgorithm


Algorithm: FindLargest
Input: A list of positive integers
Start
1: Set Largest to 0
2: while (more integers)
2.1: FindLarger
End while
3: Return Largest
End

Subalgorithm: FindLarger
Algorithm: FindLargest Input: Largest and current
Input: A list of positive integers integer
Start Start
1: Set Largest to 0 1: if (the integer is greater than
2: while (more integers) Largest)
2.1: FindLarger then
End while 1.1: Set Largest to the value of
the integer
3: Return Largest
End if
End
End

Recursion
Iterative definition of factorial

Iterative factorial
Factorial
Input: A positive integer num

Iterative factorial
Factorial
Start

Iterative factorial
Factorial
Start
1: Set FactN to 1

Iterative factorial
Factorial
Start
1: Set FactN to 1
2: Set i to 1

Iterative factorial
Factorial
Start
1: Set FactN to 1
2: Set i to 1
3: while (i is less than or equal to num)
3.1: Set FactN to FactN × i
3.2: Increment i
End while

Iterative factorial
Factorial
Start
1: Set FactN to 1
2: Set i to 1
3: while (i is less than or equal to num)
3.1: Set FactN to FactN × i
3.2: Increment i
End while
4: Return FactN
End

Recursion

Recursion
Recursive definition of factorial

Recursive factorial
Factorial

Recursive factorial
Factorial
Start

Recursive factorial
Factorial
Start
1: if (num is equal to 0)
then

Recursive factorial
Factorial
Start
then
1.1: return 1

Recursive factorial
Factorial
Start
then
1.1: return 1
else

Recursive factorial
Factorial
Start
then
1.1: return 1
else
1.2: return num × Factorial(num − 1)
End if

Recursive factorial
Factorial
Start
then
1.1: return 1
else
1.2: return num × Factorial(num − 1)
End if
End

Recursion
Tracing recursive solution to factorial problem

Recursion

Recursion

Recursion

Recursion

Recursion

Recursion

Recursion

Prime Number Testing
Problem: Write an algorithm which will test whether a given integer
value is prime or not.
Could you write this ?


Start
1: M ← 2
2: input N
3: MAX ← SQRT (N)


Start
1: M←2
2: input N
3: MAX ← SQRT (N)
4: while M ≤ MAX do
4.1: If (M × (N/M) = N then
4.1.1: Return “number is not a prime”
4.2: M ← M + 1


Start
1: M←2
2: input N
3: MAX ← SQRT (N)
4.1: If (M × (N/M) = N then
4.2: M ← M + 1
5: Return “number is prime”
Stop.


Start
1: M←2
2: input N
3: MAX ← SQRT (N)
4.1: If (M × (N/M) = N then
4.2: M ← M + 1
5: Return “number is prime”
Stop.
Could you develop recursive function ?

.
Thank You

Lect05 Algorithm PDF

Uploaded by

Document Information

Original Description:

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

Lect05 Algorithm PDF

Uploaded by

Copyright:

Available Formats

Problem Solving and Algorithms Development

Dr. Odelu Vanga

Department of Computer Science and Information Systems

January 22, 2019

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 1 / 41

Understand the concept of an algorithm

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 2 / 41

Understand the concept of an algorithm

Three constructs for developing algorithms:

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 2 / 41

Understand the concept of an algorithm

Three constructs for developing algorithms:

Understand the concept of

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 2 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 3 / 41

If someone asks you, what is time now?

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 3 / 41

If someone asks you, what is time now?

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 3 / 41

If someone asks you, what is time now?

A typical programming task can be divided into two phases

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 3 / 41

If someone asks you, what is time now?

A typical programming task can be divided into two phases

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 3 / 41

If someone asks you, what is time now?

A typical programming task can be divided into two phases

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 3 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 4 / 41

1) Finiteness: An algorithm must always terminate after a

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 5 / 41

1) Finiteness: An algorithm must always terminate after a

2) Definiteness: Each step of an algorithm must be precisely

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 5 / 41

1) Finiteness: An algorithm must always terminate after a

2) Definiteness: Each step of an algorithm must be precisely

3) Input: The input is the data to be transformed during the

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 5 / 41

1) Finiteness: An algorithm must always terminate after a

2) Definiteness: Each step of an algorithm must be precisely

3) Input: The input is the data to be transformed during the

4) Output: Always expects result in terms of output from an

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 5 / 41

1) Finiteness: An algorithm must always terminate after a

2) Definiteness: Each step of an algorithm must be precisely

3) Input: The input is the data to be transformed during the

4) Output: Always expects result in terms of output from an

5) Effectiveness: Algorithms to be developed/written using

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 6 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 7 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 7 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 8 / 41

Dr. Odelu Vanga (BITS-Pilani Hyderabad) CS F111 January 22, 2019 9 / 41