# Algorithm and flowchart with pseudo code

Algorithm with flow chart and pseudo code

1 of 56

## Recommended

Algorithm and flowchart
Algorithm and flowchartSachin Goyani

Unit 1-problem solving with algorithm
Unit 1-problem solving with algorithmrajkumar1631010038

What is an algorithm?
What is an algorithm?Angela DeHart

Algorithm and flowchart
Algorithm and flowchartRabin BK

Introduction to programming
Introduction to programmingNeeru Mittal

Introduction to computer Powerpoint Presentation
Introduction to computer Powerpoint PresentationJibin Sr. Plamoottukada

## What's hot

Algorithms and flowcharts
Algorithms and flowchartsSamuel Igbanogu

Algorithm and Programming (Introduction of Algorithms)
Algorithm and Programming (Introduction of Algorithms)Adam Mukharil Bachtiar

Algorithms and Flowcharts
Algorithms and FlowchartsDeva Singh

Problem solving using Computer
Problem solving using ComputerDavid Livingston J

Lecture-1: Introduction to Computer - Basic Definitions & Concepts- Computer ...
Lecture-1: Introduction to Computer - Basic Definitions & Concepts- Computer ...Mubashir Ali

Flowcharts and algorithms
Flowcharts and algorithmsStudent

Control structures repetition
Control structures repetitionOnline

Exercise Word 3
Exercise Word 3Jack Frost

Introduction to data structures and Algorithm
Introduction to data structures and AlgorithmDhaval Kaneria

Pseudocode algorithim flowchart
Pseudocode algorithim flowchartfika sweety

Word practical questions for exercises
Word practical questions for exercisesHari993901

Unit 1. Problem Solving with Computer
Unit 1. Problem Solving with Computer Ashim Lamichhane

Algorithms Lecture 1: Introduction to Algorithms
Algorithms Lecture 1: Introduction to AlgorithmsMohamed Loey

Introduction to vb.net
Introduction to vb.netJaya Kumari

### What's hot(20)

Algorithms and flowcharts
Algorithms and flowcharts

Algorithm and Programming (Introduction of Algorithms)
Algorithm and Programming (Introduction of Algorithms)

Algorithms and Flowcharts
Algorithms and Flowcharts

Problem solving using Computer
Problem solving using Computer

Lecture-1: Introduction to Computer - Basic Definitions & Concepts- Computer ...
Lecture-1: Introduction to Computer - Basic Definitions & Concepts- Computer ...

Flowcharts and algorithms
Flowcharts and algorithms

Control structures repetition
Control structures repetition

Exercise Word 3
Exercise Word 3

Introduction to data structures and Algorithm
Introduction to data structures and Algorithm

Programming Fundamentals
Programming Fundamentals

chapter 1
chapter 1

Introduction to problem solving in C
Introduction to problem solving in C

Pseudocode algorithim flowchart
Pseudocode algorithim flowchart

Word practical questions for exercises
Word practical questions for exercises

Unit 1. Problem Solving with Computer
Unit 1. Problem Solving with Computer

Algorithms Lecture 1: Introduction to Algorithms
Algorithms Lecture 1: Introduction to Algorithms

Writing algorithms
Writing algorithms

Introduction to vb.net
Introduction to vb.net

VB.net
VB.net

## Similar to Algorithm and flowchart with pseudo code

ALGORITHM AND FLOW CHART
ALGORITHM AND FLOW CHARTDereck Downing

Algorithm Design and Complexity - Course 1&2
Algorithm Design and Complexity - Course 1&2Traian Rebedea

Algorithms notes 2 tutorials duniya
Algorithms notes 2 tutorials duniyaTutorialsDuniya.com

Algorithms and how to write an algorithms
Algorithms and how to write an algorithmsAhmed Nobi

Types of Algorithms.ppt
Types of Algorithms.pptALIZAIB KHAN

Visual Problem Solving (Lecture)
Visual Problem Solving (Lecture)Lawrence Wachs

Algorithm for computational problematic sit
Algorithm for computational problematic sitSaurabh846965

01 Notes Introduction Analysis of Algorithms Notes
01 Notes Introduction Analysis of Algorithms NotesAndres Mendez-Vazquez

Ic lecture6 architecture and algo
Ic lecture6 architecture and algoAttaullahRahimoon

Chapter 3 introduction to algorithms handouts (with notes)
Chapter 3 introduction to algorithms handouts (with notes)mailund

C LANGUAGE-FLOWCHARTS,PSEUDOCODE,ALGORITHMS APPROCHES
C LANGUAGE-FLOWCHARTS,PSEUDOCODE,ALGORITHMS APPROCHESHarshJha34

Architecture Algorithm Definition

Chapter-9.01-COMPUTING-(E)-Theory
Chapter-9.01-COMPUTING-(E)-TheorySTUDY INNOVATIONS

Introduction to Programming
Introduction to ProgrammingProf Ansari

Algorithm & data structure lec2
Algorithm & data structure lec2Abdul Khan

### Similar to Algorithm and flowchart with pseudo code(20)

ALGORITHM AND FLOW CHART
ALGORITHM AND FLOW CHART

Algorithm Design and Complexity - Course 1&2
Algorithm Design and Complexity - Course 1&2

Daa chapter4
Daa chapter4

Algorithms notes 2 tutorials duniya
Algorithms notes 2 tutorials duniya

Algorithms and how to write an algorithms
Algorithms and how to write an algorithms

Daa unit 1
Daa unit 1

Types of Algorithms.ppt
Types of Algorithms.ppt

Visual Problem Solving (Lecture)
Visual Problem Solving (Lecture)

Algorithm for computational problematic sit
Algorithm for computational problematic sit

01 Notes Introduction Analysis of Algorithms Notes
01 Notes Introduction Analysis of Algorithms Notes

Ic lecture6 architecture and algo
Ic lecture6 architecture and algo

Chapter 3 introduction to algorithms handouts (with notes)
Chapter 3 introduction to algorithms handouts (with notes)

C LANGUAGE-FLOWCHARTS,PSEUDOCODE,ALGORITHMS APPROCHES
C LANGUAGE-FLOWCHARTS,PSEUDOCODE,ALGORITHMS APPROCHES

Practical 01 (detailed)
Practical 01 (detailed)

Architecture Algorithm Definition
Architecture Algorithm Definition

Lesson 3
Lesson 3

Chapter-9.01-COMPUTING-(E)-Theory
Chapter-9.01-COMPUTING-(E)-Theory

Algorithms 1
Algorithms 1

Introduction to Programming
Introduction to Programming

Algorithm & data structure lec2
Algorithm & data structure lec2

Nexus - Final Day 12th February 2024.pptx
Nexus - Final Day 12th February 2024.pptxRohanAgarwal340656

【文凭定制】坎特伯雷大学毕业证学历认证
【文凭定制】坎特伯雷大学毕业证学历认证muvgemo

Deluck Technical Works Company Profile.pdf
Deluck Technical Works Company Profile.pdfartpoa9

PM24_Oral_Presentation_Template_Guidelines.pptx
PM24_Oral_Presentation_Template_Guidelines.pptxnissamant

Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...
Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...GauravBhartie

Architectural Preservation - Heritage, focused on Saudi Arabia
Architectural Preservation - Heritage, focused on Saudi ArabiaIgnacio J. Palma, Arch PhD.

CCW332-DIGITAL MARKETING QUESTION BANK WITH ANSWERS
CCW332-DIGITAL MARKETING QUESTION BANK WITH ANSWERSTamil949112

Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...
Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...GauravBhartie

Forged Fitting Socket Welding Standard- ASME-B16.11-2001.pdf
Forged Fitting Socket Welding Standard- ASME-B16.11-2001.pdfVikasKumar11936

ExtraordinAIre Monthly Newsletter Jan 2024Savipriya Raghavendra

Lesson2 Stoichiometry and mass balance.pdf
Lesson2 Stoichiometry and mass balance.pdff1002753214

Introduction to Binary Tree and Conersion of General tree to Binary Tree
Introduction to Binary Tree and Conersion of General tree to Binary TreeSwarupaDeshpande4

GE8073 - FUNDAMENTALS OF NANOSCIENCE.ppt
GE8073 - FUNDAMENTALS OF NANOSCIENCE.pptsrajece

GDSC Google Cloud Study jam Web Bootcamp - Day-4 Session 4

chap. 3. lipid deterioration oil and fat processign
chap. 3. lipid deterioration oil and fat processignteddymebratie

Energy Efficient Social Housing for One Manchester
Energy Efficient Social Housing for One Manchestermark alegbe

Center Enamel is the leading fire water tanks manufacturer in China.docx
Center Enamel is the leading fire water tanks manufacturer in China.docxsjzzztc

Introduction and replication to DragonflyDB
Introduction and replication to DragonflyDBMarian Marinov

CHAPTER 1_ HTML and CSS Introduction Module
CHAPTER 1_ HTML and CSS Introduction Modulessusera4f8281

Nexus - Final Day 12th February 2024.pptx
Nexus - Final Day 12th February 2024.pptx

【文凭定制】坎特伯雷大学毕业证学历认证
【文凭定制】坎特伯雷大学毕业证学历认证

Deluck Technical Works Company Profile.pdf
Deluck Technical Works Company Profile.pdf

PM24_Oral_Presentation_Template_Guidelines.pptx
PM24_Oral_Presentation_Template_Guidelines.pptx

Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...
Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...

Architectural Preservation - Heritage, focused on Saudi Arabia
Architectural Preservation - Heritage, focused on Saudi Arabia

CCW332-DIGITAL MARKETING QUESTION BANK WITH ANSWERS
CCW332-DIGITAL MARKETING QUESTION BANK WITH ANSWERS

Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...
Microstrip Bandpass Filter Design using EDA Tolol such as keysight ADS and An...

Forged Fitting Socket Welding Standard- ASME-B16.11-2001.pdf
Forged Fitting Socket Welding Standard- ASME-B16.11-2001.pdf

Lesson2 Stoichiometry and mass balance.pdf
Lesson2 Stoichiometry and mass balance.pdf

Introduction to Binary Tree and Conersion of General tree to Binary Tree
Introduction to Binary Tree and Conersion of General tree to Binary Tree

GE8073 - FUNDAMENTALS OF NANOSCIENCE.ppt
GE8073 - FUNDAMENTALS OF NANOSCIENCE.ppt

GDSC Google Cloud Study jam Web Bootcamp - Day-4 Session 4
GDSC Google Cloud Study jam Web Bootcamp - Day-4 Session 4

chap. 3. lipid deterioration oil and fat processign
chap. 3. lipid deterioration oil and fat processign

Energy Efficient Social Housing for One Manchester
Energy Efficient Social Housing for One Manchester

Center Enamel is the leading fire water tanks manufacturer in China.docx
Center Enamel is the leading fire water tanks manufacturer in China.docx

Introduction and replication to DragonflyDB
Introduction and replication to DragonflyDB

CHAPTER 1_ HTML and CSS Introduction Module
CHAPTER 1_ HTML and CSS Introduction Module

### Algorithm and flowchart with pseudo code

• 2. Solving Problems (1) When faced with a problem: 1. We first clearly define the problem 2. Think of possible solutions 3. Select the one that we think is the best under the prevailing circumstances 4. And then apply that solution 5. If the solution works as desired, fine; else we go back to step 2
• 3. Solving Problems (2)  It is quite common to first solve a problem for a particular case  Then for another  And, possibly another  And watch for patterns and trends that emerge  And to use the knowledge form those patterns and trends in coming up with a general solution
• 4. Solving Problems (3)  It helps if we have experienced that problem or similar ones before  Generally, there are many ways of solving a given problem; the best problem- solvers come-up with the most appropriate solution more often than not!  The process that can be used to solve a problem is termed as the “algorithm”
• 5. Examples  Addition  Conversion from decimal to binary  The process of boiling an egg  The process of mailing a letter  Sorting  Searching
• 6. Let us write down the algorithm for a problem that is familiar to us Converting a decimal number into binary
• 7. Convert 75 to Binary 752 37 12 18 12 9 02 4 12 2 02 1 02 0 1 1001011 remainder
• 8. Algorithm for Decimal-to-Binary Conversion 1. Write the decimal number 2. Divide by 2; write quotient and remainder 3. Repeat step 2 on the quotient; keep on repeating until the quotient becomes zero 4. Write all remainder digits in the reverse order (last remainder first) to form the final result
• 9. Points to Note: 1. The process consists of repeated application of simple steps 2. All steps are unambiguous (clearly defined) 3. We are capable of doing all those steps 4. Only a limited no. of steps needs to be taken 5. Once all those steps are taken according to the prescribed sequence, the required result will be found 6. Moreover, the process will stop at that point
• 10. Algorithm (Better Definition) 1st Definition: Sequence of steps that can be taken to solve a problem Better Definition: A precise sequence of a limited number of unambiguous, executable steps that terminates in the form of a solution
• 11. Three Requirements: 1. Sequence is: a. Precise b. Consists of a limited number of steps 2. Each step is: a. Unambiguous b. Executable 3. The sequence of steps terminates in the form of a solution
• 12. Why Algorithms are Useful?  Once we find an algorithm for solving a problem, we do not need to re- discover it the next time we are faced with that problem  Once an algorithm is known, the task of solving the problem reduces to following (almost blindly and without thinking) the instructions precisely  All the knowledge required for solving the problem is present in the algorithm
• 13. Analysis of Algorithms  Analysis in the context of algorithms is concerned with predicting the resources that are requires:  Computational time  Memory  Bandwidth  Logic functions  However, Time – generally measured in terms of the number of steps required to execute an algorithm - is the resource of most interest  By analyzing several candidate algorithms, the most efficient one(s) can be identified
• 14. Selecting Among Algorithms When choosing among competing, successful solutions to a problem, choose the one which is the least complex This principle is called the “Ockham’s Razor,” after William of Ockham - famous 13-th century English philosopher
• 15. Syntax & Semantics An algorithm is “correct” if its:  Semantics are correct  Syntax is correct Semantics: The concept embedded in an algorithm (the soul!) Syntax: The actual representation of an algorithm (the body!) WARNINGS: 1. An algorithm can be syntactically correct, yet semantically incorrect – very dangerous situation! 2. Syntactic correctness is easier to check as compared with semantic
• 16. Now onto Algorithm Representation  We have said enough about algorithms – their definition, their types, etc.  But, how do we actually represent them?  Generally, SW developers represent them in one of three forms:  Pseudo code  Flowcharts  Actual code
• 17. Pseudo Code  Language that is typically used for writing algorithms  Similar to a programming language, but not as rigid  The method of expression most suitable for a given situation is used:  At times, plain English  At others, a programming language like syntax
• 18. Flowchart  A graphical representation of a process (e.g. an algorithm), in which graphic objects are used to indicate the steps & decisions that are taken as the process moves along from start to finish  Individual steps are represented by boxes and other shapes on the flowchart, with arrows between those shapes indicating the order in which the steps are taken
• 19. Start or stop Process Input or output Connector Decision Flow line Off-page connector Flowchart Elements
• 20. Algorithm Building Blocks All problems can be solved by employing any one of the following building blocks or their combinations 1. Sequences 2. Conditionals 3. Loops
• 21. Sequences A sequence of instructions that are executed in the precise order they are written in: statement block 1 statement block 2 statement block 3 statement block 1 statement block 2 statement block 3
• 22. Conditionals Select between alternate courses of action depending upon the evaluation of a condition If ( condition = true ) statement block 1 Else statement block 2 End if statement block 1 condition True False statement block 2
• 23. Loops Loop through a set of statements as long as a condition is true Loop while ( condition = true ) statement block End Loop condition True False statement block
• 24. Problem Statement Convert a decimal number into binary
• 25. Convert 75 to Binary 752 37 12 18 12 9 02 4 12 2 02 1 02 0 1 1001011 remainder
• 26. Solution in Pseudo Code 1. Let the decimal number be an integer x, x > 0 2. Let the binary equivalent be an empty string y 3. Repeat while x > 0 { Determine the quotient & remainder of x ÷ 2 y = CONCATENATE( remainder, y ) x = quotient } 4. Print y 5. Stop
• 27. Start Find quotient & remainder of x ÷ 2 Get x x>0 ? Print y Stop y = CONC(remainder, x) x = quotient x is the decimal number y is the binary equivalent Flowchart of Decimal to Binary Conversion Yes No
• 28. Another Example: Sorting Sort the following objects w.r.t. their heights
• 30. Strategy There are many strategies for solving this problem. We demonstrate a simple one: Repeat the following steps while the list is un- sorted: Start with the first object in the list Swap it with the one next to it if they are in the wrong order Repeat the same with the next to the first object Keep on repeating until you reach the last object in the list
• 31. Back to the Objects to be Sorted
• 39. Q: Is the list sorted? A: No
• 45. Q: Is the list sorted? A: No
• 49. Q: Is the list sorted? A: Yes
• 52.  A number is even if it can be divided by 2 without remainder. Such numbers are 2, 4, 6, 8.. and so on. The numbers that leave a remainder are called odd. They are 1, 3, 5, 7.. and so on.  In programming we find the remainder of a division with the operator %. Also we use the double equals “==” to compare values for equality.
• 54.  Summing two numbers was easy – the calculation was one block from the flow chart. But how about 50? Do you have to write 50 blocks to solve this task? Happily – no.  You can automate this process by repeatedly incrementing the value of a variable and checking it every time if it exceeds the last value – 50. Then sum that number every step and... there you go! This construction is called loop.
• 56. Find the biggest of 100 prices and reduce it by 10%
Current LanguageEnglish
Español
Portugues
Français
Deutsche