You are on page 1of 15

University Name

Theme:

Name:
Roll Number:
Index
1. Algorithm
2. Characteristics or Properties of Algorithm
3. Examples of Algorithm
4. Basic Steps to write an Algorithm
5. Flowchart
6. Characteristics or Properties of Flowchart
7. Examples of Flowchart
8. Pseudocode
9. Basic Structure of Pseudocode
10. Examples of Pseudocode
11. Difference between algorithm, flowchart & pseudocode
12. Applications of DAA
13. Types of Asymptotic Notations in Complexity Analysis of Algorithms
Algorithm

1. An algorithm is a step-by-step procedure or set of rules designed to solve a specific


problem or perform a particular task.
2. It serves as a blueprint for solving a problem and can be expressed in natural language,
mathematics, or a programming language.
3. Algorithms are independent of any specific programming language and are more focused
on the logic of solving a problem.
Characteristics or Properties of Algorithm
Example of an Algorithm
Basic Steps to write an Algorithm
Flowchart

 A flowchart is a graphical
representation of an algorithm that
uses different shapes to represent
various steps and decision-making
points in a process.
 It visually depicts the flow of
control or the sequence of steps in
solving a problem.
 Common flowchart symbols include
rectangles for processes, diamonds
for decisions, arrows for flow
direction, and ovals for start and
end points.
Characteristics or Properties of Flowchart

1. It is an easy method of communication.

2. It is independent of any programming language.

3. It is the key to correct and accurate programming.

4. It helps to plan and design a new system.

5. It clearly indicates the task to be performed at each level.


Example of a Flowchart
Pseudocode

• Pseudocode is a high-level, informal description of a computer program or algorithm.

• It uses a mixture of natural language and some programming language-like constructs


to express the logic of the algorithm.

• Pseudocode is meant to be easily understandable by humans and is not bound by the


syntax rules of any specific programming language.
Basic Structure of Pseudocode
Example of a Pseudocode
Difference Between Algorithm, Flowchart and
Pseudocode
Applications Of DAA
Types of Asymptotic Notations in Complexity Analysis of Algorithms

There are mainly three asymptotic notations:

Big-o/ o-Notation
Theta Notation Omega Notation

You might also like