The document discusses the program development cycle, including problem statements, algorithms, flowcharts, and their purposes. It provides examples of algorithms to find the largest of three numbers and the sum of the first five natural numbers. Flowcharts graphically represent algorithms using standard symbols like rectangles, diamonds, and arrows. While flowcharts help with communication, analysis, and documentation, they can be time-consuming for complex logic and difficult to modify.
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Moore machine to Mealy machine
For every Moore machine there exists a Mealy machine such that both are equivalent by ignoring the extra character generated by the Moore machine.
Examples of conversion Mo
Fundamental of Information Technology - UNIT 6Shipra Swati
Computer Programming and Languages : algorithm, Flow Chart, Pseudo Code, Program
Control Structures, Programming Languages, Generation of Programming Languages and
etc.
The document discusses different programming techniques, including algorithms, flowcharts, and pseudocode. It provides examples of writing algorithms to solve problems like making maggi noodles, making tea, and calculating simple interest. Algorithms have advantages like being step-by-step and language independent, while disadvantages include being time-consuming. Flowcharts also help visualize programs and aid in development and maintenance but can become complex. Both algorithms and flowcharts break problems down into smaller steps before coding.
Concept of Problem Solving, Introduction to Algorithms, Characteristics of Algorithms, Introduction to Data Structure, Data Structure Classification (Linear and Non-linear, Static and Dynamic, Persistent and Ephemeral data structures), Time complexity and Space complexity, Asymptotic Notation - The Big-O, Omega and Theta notation, Algorithmic upper bounds, lower bounds, Best, Worst and Average case analysis of an Algorithm, Abstract Data Types (ADT)
The document discusses algorithms and flowcharts for solving problems. It defines an algorithm as a set of sequential steps to solve a problem and notes that there are various techniques for specifying algorithms, including formally, informally, mathematically, or through graphical flowcharts. The document provides examples of algorithms to solve common problems and explains the properties and steps involved in algorithm development. It also describes flowcharts as a visual representation of an algorithm using standard symbols like ovals, rectangles, and diamonds to indicate starts/stops, processes, and decisions.
This document discusses algorithms and flowcharts. It defines an algorithm as a step-by-step process to solve a problem and a flowchart as a graphical representation of the steps using standard symbols. The document outlines the characteristics and advantages of algorithms, including being unambiguous, terminating in finite time, and easy to understand. It also discusses the history and advantages of flowcharts, such as being easy to analyze problems, develop programs, and maintain systems. Examples of algorithms and flowcharts are provided to find the sum of two numbers, area and perimeter of a square, and to determine if a number is even or odd.
This document provides an introduction to algorithms including definitions, characteristics, and the design process. It defines an algorithm as a finite set of unambiguous instructions to solve a problem. Key points:
- Algorithms must have input, output, be definitive, finite, and effective.
- The design process includes understanding the problem, developing a solution algorithm, proving correctness, analyzing efficiency, and coding.
- Examples of algorithm types are approximate, probabilistic, infinite, and heuristic.
- Pseudocode is commonly used to specify algorithms more clearly than natural language alone.
The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”.
flowchart is a type of diagram that represents an algorithm, workflow or process.
This document discusses algorithms, flowcharts, and pseudocode. It defines algorithms as a set of well-defined steps to solve a problem and notes they should be unambiguous and effective. Flowcharts are described as using shapes and arrows to visually represent algorithmic processes and common symbols are shown. Pseudocode is an informal language similar to English used to develop algorithms. Examples of each are provided, including an algorithm and flowchart to calculate the area of a circle from a radius input.
The document provides an overview of computational thinking and problem solving. It discusses key concepts like algorithms, the building blocks of algorithms including statements, state, control flow, functions. It also covers different notations for representing algorithms - pseudocode, flowcharts, programming languages. Some key aspects covered include the definition of an algorithm, properties and qualities of a good algorithm. Examples are provided for different algorithm concepts like finding the minimum/maximum value, sorting cards etc.
The document discusses algorithms and their building blocks. It defines an algorithm as a collection of well-defined, unambiguous and effectively computable instructions that return a proper output. The three building blocks of algorithms are identified as sequence, selection, and iteration. Sequence refers to a series of actions performed in order. Selection allows a program to choose between different actions or conditions. Iteration allows a block of code to be repeated while a condition is true. Pseudocode and flowcharts are introduced as common ways to express algorithms and illustrate the control flow and logic of a program.
An algorithm is a set of steps to solve a problem. It has four characteristics: finiteness, definiteness, effectiveness, and inputs/outputs. To develop an algorithm, one identifies the inputs, outputs, logic, breaks the logic into simple steps, and writes the steps in order. A flowchart is a pictorial representation of an algorithm that uses standard symbols like rectangles, diamonds, and arrows. It shows the flow of instructions and is easier to understand than an algorithm. Examples are provided to write algorithms and flowcharts to convert feet to centimeters and calculate the area of a rectangle.
Algorithm for computational problematic sitSaurabh846965
A computer requires precise instructions from a user in order to perform tasks correctly. It has no inherent intelligence or ability to solve problems on its own. For a computer to solve a problem, a programmer must break the problem down into a series of simple steps and write program code that provides those step-by-step instructions in a language the computer can understand. This process involves understanding the problem, analyzing it, developing a solution algorithm, and coding the algorithm so the computer can execute it. Flowcharts can help visualize algorithms and problem-solving logic in a graphical format before writing program code.
The document defines an algorithm as a set of finite rules or instructions to solve a problem in a finite number of steps. It lists the key characteristics of an algorithm as being clear, having well-defined inputs and outputs, being finite, feasible, and language independent. The properties of an algorithm are that it must terminate, produce at least one output, take zero or more inputs, be deterministic, and have effective steps. The steps to design an algorithm are to define the problem, constraints, inputs, outputs, and solution. An example algorithm is given to add three numbers and print the sum.
Design and Analysis of Algorithm ppt for unit onessuserb7c8b8
The document outlines an algorithms course, including course details, objectives, and an introduction. The course code is 10211CS202 and name is Design and Analysis of Algorithms. It has 4 credits and meets for 6 hours per week. The course aims to teach fundamental techniques for effective problem solving, analyzing algorithm performance, and designing efficient algorithms. It covers topics like sorting, searching, and graph algorithms.
Introduction
The term problem solving is used in many disciplines, sometimes with different perspectives and
often with different terminologies. The problem-solving process starts with the problem
specification and end with a correct program.
The steps to follow in the problem-solving process are:
Problem definition
Problem Analysis
Algorithm development
Coding
Testing & Debugging
Documentation & Maintenance
The stages of analysis, design, programming, implementation and maintenance form the life cycle
of the system.
C LANGUAGE-FLOWCHARTS,PSEUDOCODE,ALGORITHMS APPROCHESHarshJha34
The document discusses various topics related to unit 1 of a programming course, including flowcharts, algorithm design using top-down and bottom-up approaches, and pseudocode. It covers elements of flowcharts like input/output, branching, and iteration. It describes problem solving in two phases - problem solving and implementation. It also explains algorithm development, properties of algorithms, and constructs like sequence, decision, and iteration. Pseudocode representation and writing pseudocode from algorithms and flowcharts is also mentioned.
This document introduces algorithms and the process of program development. It defines an algorithm as a precise list of instructions that terminates after a finite number of steps to solve a problem. It discusses methods of specifying algorithms like pseudocode and flowcharts. Properties of algorithms include being finite, unambiguous, and having a defined sequence of execution and input/output. The steps of program development are stated as understanding the problem, planning instructions, coding the program, running and debugging it. Flowcharting guidelines and common symbols are provided. Sample exercises demonstrate writing programs to calculate simple formulas.
Here are the steps to solve the problems using IPO table, pseudo code and flowchart:
1. Define the problem and understand requirements
2. Make IPO table:
- Input, Process, Output
3. Write pseudo code using proper indentation and comments
4. Draw flowchart using standard symbols
5. Test and debug the program
This systematic approach helps analyze the problem, design the algorithm and implement it properly. The key is breaking down the problem into smaller understandable steps.
An algorithm is a sequence of steps to solve a problem, and may or may not require input or produce output. A flowchart is a graphical representation of an algorithm that visually shows the flow of data and sequence of operations. It is useful for communicating program logic, analyzing problems, and maintaining programs. Debugging is the process of detecting and correcting errors in a program, which can include syntax, logical, or runtime errors.
The document discusses algorithms and their characteristics. It defines an algorithm as a step-by-step procedure for solving a problem. Algorithms must have a finite number of unambiguous steps and result in the desired output. The document also discusses the building blocks of algorithms like statements, control flow, functions. It provides examples of different algorithm structures like sequence, selection, iteration. Finally, it discusses representations of algorithms using pseudocode, flowcharts and programming languages.
This document discusses algorithms and flowcharts. It defines an algorithm as a step-by-step process to solve a problem and a flowchart as a graphical representation of the steps using standard symbols. The document outlines the characteristics and advantages of algorithms, including being unambiguous, terminating in finite time, and easy to understand. It also discusses the history and advantages of flowcharts, such as being easy to analyze problems, develop programs, and maintain systems. Examples of algorithms and flowcharts are provided to find the sum of two numbers, area and perimeter of a square, and to determine if a number is even or odd.
This document provides an introduction to algorithms including definitions, characteristics, and the design process. It defines an algorithm as a finite set of unambiguous instructions to solve a problem. Key points:
- Algorithms must have input, output, be definitive, finite, and effective.
- The design process includes understanding the problem, developing a solution algorithm, proving correctness, analyzing efficiency, and coding.
- Examples of algorithm types are approximate, probabilistic, infinite, and heuristic.
- Pseudocode is commonly used to specify algorithms more clearly than natural language alone.
The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”.
flowchart is a type of diagram that represents an algorithm, workflow or process.
This document discusses algorithms, flowcharts, and pseudocode. It defines algorithms as a set of well-defined steps to solve a problem and notes they should be unambiguous and effective. Flowcharts are described as using shapes and arrows to visually represent algorithmic processes and common symbols are shown. Pseudocode is an informal language similar to English used to develop algorithms. Examples of each are provided, including an algorithm and flowchart to calculate the area of a circle from a radius input.
The document provides an overview of computational thinking and problem solving. It discusses key concepts like algorithms, the building blocks of algorithms including statements, state, control flow, functions. It also covers different notations for representing algorithms - pseudocode, flowcharts, programming languages. Some key aspects covered include the definition of an algorithm, properties and qualities of a good algorithm. Examples are provided for different algorithm concepts like finding the minimum/maximum value, sorting cards etc.
The document discusses algorithms and their building blocks. It defines an algorithm as a collection of well-defined, unambiguous and effectively computable instructions that return a proper output. The three building blocks of algorithms are identified as sequence, selection, and iteration. Sequence refers to a series of actions performed in order. Selection allows a program to choose between different actions or conditions. Iteration allows a block of code to be repeated while a condition is true. Pseudocode and flowcharts are introduced as common ways to express algorithms and illustrate the control flow and logic of a program.
An algorithm is a set of steps to solve a problem. It has four characteristics: finiteness, definiteness, effectiveness, and inputs/outputs. To develop an algorithm, one identifies the inputs, outputs, logic, breaks the logic into simple steps, and writes the steps in order. A flowchart is a pictorial representation of an algorithm that uses standard symbols like rectangles, diamonds, and arrows. It shows the flow of instructions and is easier to understand than an algorithm. Examples are provided to write algorithms and flowcharts to convert feet to centimeters and calculate the area of a rectangle.
Algorithm for computational problematic sitSaurabh846965
A computer requires precise instructions from a user in order to perform tasks correctly. It has no inherent intelligence or ability to solve problems on its own. For a computer to solve a problem, a programmer must break the problem down into a series of simple steps and write program code that provides those step-by-step instructions in a language the computer can understand. This process involves understanding the problem, analyzing it, developing a solution algorithm, and coding the algorithm so the computer can execute it. Flowcharts can help visualize algorithms and problem-solving logic in a graphical format before writing program code.
The document defines an algorithm as a set of finite rules or instructions to solve a problem in a finite number of steps. It lists the key characteristics of an algorithm as being clear, having well-defined inputs and outputs, being finite, feasible, and language independent. The properties of an algorithm are that it must terminate, produce at least one output, take zero or more inputs, be deterministic, and have effective steps. The steps to design an algorithm are to define the problem, constraints, inputs, outputs, and solution. An example algorithm is given to add three numbers and print the sum.
Design and Analysis of Algorithm ppt for unit onessuserb7c8b8
The document outlines an algorithms course, including course details, objectives, and an introduction. The course code is 10211CS202 and name is Design and Analysis of Algorithms. It has 4 credits and meets for 6 hours per week. The course aims to teach fundamental techniques for effective problem solving, analyzing algorithm performance, and designing efficient algorithms. It covers topics like sorting, searching, and graph algorithms.
Introduction
The term problem solving is used in many disciplines, sometimes with different perspectives and
often with different terminologies. The problem-solving process starts with the problem
specification and end with a correct program.
The steps to follow in the problem-solving process are:
Problem definition
Problem Analysis
Algorithm development
Coding
Testing & Debugging
Documentation & Maintenance
The stages of analysis, design, programming, implementation and maintenance form the life cycle
of the system.
C LANGUAGE-FLOWCHARTS,PSEUDOCODE,ALGORITHMS APPROCHESHarshJha34
The document discusses various topics related to unit 1 of a programming course, including flowcharts, algorithm design using top-down and bottom-up approaches, and pseudocode. It covers elements of flowcharts like input/output, branching, and iteration. It describes problem solving in two phases - problem solving and implementation. It also explains algorithm development, properties of algorithms, and constructs like sequence, decision, and iteration. Pseudocode representation and writing pseudocode from algorithms and flowcharts is also mentioned.
This document introduces algorithms and the process of program development. It defines an algorithm as a precise list of instructions that terminates after a finite number of steps to solve a problem. It discusses methods of specifying algorithms like pseudocode and flowcharts. Properties of algorithms include being finite, unambiguous, and having a defined sequence of execution and input/output. The steps of program development are stated as understanding the problem, planning instructions, coding the program, running and debugging it. Flowcharting guidelines and common symbols are provided. Sample exercises demonstrate writing programs to calculate simple formulas.
Here are the steps to solve the problems using IPO table, pseudo code and flowchart:
1. Define the problem and understand requirements
2. Make IPO table:
- Input, Process, Output
3. Write pseudo code using proper indentation and comments
4. Draw flowchart using standard symbols
5. Test and debug the program
This systematic approach helps analyze the problem, design the algorithm and implement it properly. The key is breaking down the problem into smaller understandable steps.
An algorithm is a sequence of steps to solve a problem, and may or may not require input or produce output. A flowchart is a graphical representation of an algorithm that visually shows the flow of data and sequence of operations. It is useful for communicating program logic, analyzing problems, and maintaining programs. Debugging is the process of detecting and correcting errors in a program, which can include syntax, logical, or runtime errors.
The document discusses algorithms and their characteristics. It defines an algorithm as a step-by-step procedure for solving a problem. Algorithms must have a finite number of unambiguous steps and result in the desired output. The document also discusses the building blocks of algorithms like statements, control flow, functions. It provides examples of different algorithm structures like sequence, selection, iteration. Finally, it discusses representations of algorithms using pseudocode, flowcharts and programming languages.
Electrical and Electronics Engineering: An International Journal (ELELIJ)elelijjournal653
Call For Papers...!!!
Electrical and Electronics Engineering: An International Journal (ELELIJ)
Web page link: https://wireilla.com/engg/eeeij/index.html
Submission Deadline: June 08, 2025
Submission link: [email protected]
Contact Us: [email protected]
Module4: Ventilation
Definition, necessity of ventilation, functional requirements, various system & selection criteria.
Air conditioning: Purpose, classification, principles, various systems
Thermal Insulation: General concept, Principles, Materials, Methods, Computation of Heat loss & heat gain in Buildings
Tesia Dobrydnia brings her many talents to her career as a chemical engineer in the oil and gas industry. With the same enthusiasm she puts into her work, she engages in hobbies and activities including watching movies and television shows, reading, backpacking, and snowboarding. She is a Relief Senior Engineer for Chevron and has been employed by the company since 2007. Tesia is considered a leader in her industry and is known to for her grasp of relief design standards.
This research presents a machine learning (ML) based model to estimate the axial strength of corroded RC columns reinforced with fiber-reinforced polymer (FRP) composites. Estimating the axial strength of corroded columns is complex due to the intricate interplay between corrosion and FRP reinforcement. To address this, a dataset of 102 samples from various literature sources was compiled. Subsequently, this dataset was employed to create and train the ML models. The parameters influencing axial strength included the geometry of the column, properties of the FRP material, degree of corrosion, and properties of the concrete. Considering the scarcity of reliable design guidelines for estimating the axial strength of RC columns considering corrosion effects, artificial neural network (ANN), Gaussian process regression (GPR), and support vector machine (SVM) techniques were employed. These techniques were used to predict the axial strength of corroded RC columns reinforced with FRP. When comparing the results of the proposed ML models with existing design guidelines, the ANN model demonstrated higher predictive accuracy. The ANN model achieved an R-value of 98.08% and an RMSE value of 132.69 kN which is the lowest among all other models. This model fills the existing gap in knowledge and provides a precise means of assessment. This model can be used in the scientific community by researchers and practitioners to predict the axial strength of FRP-strengthened corroded columns. In addition, the GPR and SVM models obtained an accuracy of 98.26% and 97.99%, respectively.
Forensic Science – Digital Forensics – Digital Evidence – The Digital Forensi...ManiMaran230751
Forensic Science – Digital Forensics – Digital Evidence – The Digital Forensics Process – Introduction – The
Identification Phase – The Collection Phase – The Examination Phase – The Analysis Phase – The
Presentation Phase.
Kevin Corke Spouse Revealed A Deep Dive Into His Private Life.pdfMedicoz Clinic
Kevin Corke, a respected American journalist known for his work with Fox News, has always kept his personal life away from the spotlight. Despite his public presence, details about his spouse remain mostly private. Fans have long speculated about his marital status, but Corke chooses to maintain a clear boundary between his professional and personal life. While he occasionally shares glimpses of his family on social media, he has not publicly disclosed his wife’s identity. This deep dive into his private life reveals a man who values discretion, keeping his loved ones shielded from media attention.
UNIT-5-PPT Computer Control Power of Power SystemSridhar191373
Introduction
Conceptual Model of the EMS
EMS Functions and SCADA Applications.
Time decomposition of the power system operation.
Open Distributed system in EMS
OOPS
This presentation provides a comprehensive overview of a specialized test rig designed in accordance with ISO 4548-7, the international standard for evaluating the vibration fatigue resistance of full-flow lubricating oil filters used in internal combustion engines.
Key features include:
UNIT-4-PPT UNIT COMMITMENT AND ECONOMIC DISPATCHSridhar191373
Statement of unit commitment problem-constraints: spinning reserve, thermal unit constraints, hydro constraints, fuel constraints and other constraints. Solution methods: priority list methods, forward dynamic programming approach. Numerical problems only in priority list method using full load average production cost. Statement of economic dispatch problem-cost of generation-incremental cost curve –co-ordination equations without loss and with loss- solution by direct method and lamda iteration method (No derivation of loss coefficients)
Optimize Indoor Air Quality with Our Latest HVAC Air Filter Equipment Catalogue
Discover our complete range of high-performance HVAC air filtration solutions in this comprehensive catalogue. Designed for industrial, commercial, and residential applications, our equipment ensures superior air quality, energy efficiency, and compliance with international standards.
📘 What You'll Find Inside:
Detailed product specifications
High-efficiency particulate and gas phase filters
Custom filtration solutions
Application-specific recommendations
Maintenance and installation guidelines
Whether you're an HVAC engineer, facilities manager, or procurement specialist, this catalogue provides everything you need to select the right air filtration system for your needs.
🛠️ Cleaner Air Starts Here — Explore Our Finalized Catalogue Now!
This presentation outlines testing methods and equipment for evaluating gas-phase air filtration media using flat sheet samples, in accordance with ISO 10121 standards—specifically designed for assessing the performance of media used in general ventilation and indoor air quality applications.
5. • A set of rules that must be followed when
solving a particular problem.
• An algorithm is a procedure or formula for
solving a problem, based on conducting a
sequence of specified actions.
• The word Algorithm means “a process or set
of rules to be followed in calculations or other
problem-solving operations”
Algorithm
6. Characteristics of Algorithm :-
1)Input specified
An algorithm should have 0 or more well-defined inputs.Input precision requires that you know
what kind of data, how much and what form the data should be.
2)Output specified
An algorithm should have 1 or more well-defined outputs, and should match the desired
output.Output precision also requires that you know what kind of data, how much and what form the output
should be.
3)Definiteness
Algorithms must specify every step and the order the steps must be taken in the
process.Definiteness means specifying the sequence of operations for turning input into output. Algorithm
should be clear and unambiguousYou could not expect a computer to understand something if you yourself are
ambiguous about it.
4)Effectiveness
For an algorithm to be effective, it means that all those steps that are required to get to output must
be feasible with the available resources.It should not contain any unnecessary and redundant steps which could
make an algorithm ineffective.
7. Basic Convenctions for writing Alogorithms
1.Algorithm Name
Each algorith must have name so programer comes to know that what
algorithm is for.
2.Comments.
The Contains folled by is known as comments.
3.Input and Output
Proper input should be given to algorith so expected output is taken.
4.Steps
Numbers should be provided each rule or step.
8. Algorithm for Making Tea
Algorithm Name-Making Tea
Input- Water,Tea Leaves,Sugar,Gas,Stove,Utensil,Milk,cup.
Output- Tea
Step 1- Start
Step 2- Light Stove.
Step 3- Boil Water in utensil,put tea leaves and sugar in it.
Step 4- After Boiling it properly put milk in it.
Step 5- After boiling it properly serve it in Cup.
Step 6- Stop
9. Algorithm for Addition.
Algorithm Name-Addition of two Numbers.
Input- Two Numbers
Output- Addition of two Numbers.
Step 1- Start
Step 2- Declare variable NUM1,NUM2,ADD.
Step 3- Read values of NUM1 and NUM 2.
Step 4- Do addition of numbers and store it in third variable i.e.ADD.
ADD=NUM1+NUM2.
Step 5- Display ADD.
Step 6- Stop
10. Algorithm for Multiplication
Algorithm Name-Multiplication of two Numbers.
Input- Two Numbers
Output- Multiplication of two Numbers.
Step 1- Start
Step 2- Declare variable NUM1,NUM2,MUL.
Step 3- Read values of NUM1 and NUM 2.
Step 4- Do multiplication of numbers and store it in third variable i.e.MUL.
MUL=NUM1 * NUM2.
Step 5- Display MUL.
Step 6- Stop
11. Algorithm for Arithmetic Operations
Algorithm Name-Arithmetic Operations
Input- Two Numbers
Output- Addition,Substraction,Division,Multiplication of two Numbers.
Step 1- Start
Step 2- Declare variable NUM1,NUM2,ADD,SUB,DIV,MUL.
Step 3- Read values of NUM1 and NUM 2.
Step 4- Do addition of numbers and store it in third variable i.e.ADD.
ADD=NUM1+NUM2.
Step 5- Display ADD.
Step 6-Do Substraction of numbers and store it in third variable i.e.SUB.
SUB=NUM1 - NUM2.
Step 7- Display SUB.
Step 8-Do Division of numbers and store it in third variable i.e.DIV.
ADD=NUM1 / NUM2.
Step 9- Display DIV.
Step 10- Do multiplication of numbers and store it in third variable i.e.MUL.
MUL=NUM1 * NUM2.
Step 11- Display MUL.
Step 12- Stop
12. Examples for Home Work
• Write a algorithm for Finding Square of given
Number.
• Write a algorithm for Finding Cube of given
Number.
13. Algorithm for Area of Circle
Algorithm Name-Finding Area of Circle.
Input- Radius,AOC.
Output- Area of Circle.
Step 1- Start
Step 2- Declare variable RADIUS,AOC
Step 3- Read values of RADIUS.
Step 4- Calculate area of circle by using formulae
AOC=3.14 * Radius * Radius
Step 5- Display AOC.
Step 6- Stop
14. Examples for Home Work
• Write a algorithm for Finding Area of Triangle
• Write a algorithm for Finding Area of
Cylinder.
15. Algorithm for finding greatest number from given 2
numbers
Algorithm Name-Finding Greatest number.
Input- NUM1 , NUM2.
Output- Display Greatest Number.
Step 1- Start
Step 2- Declare variable NUM1 ,NUM2
Step 3- Read values of NUM1 ,NUM2
Step 4- if NUM1 > NUM2
Display NUM1 is greater.
else,
Display NUM2 is greater.
Step 5- Stop
16. Examples for Home Work
• Write a algorithm to check whether number is
even or odd.
• Write a algorithm to check whether number is
divisible by 5 or not.
18. Flowchart
A flowchart is simply a graphical representation of
steps. It shows steps in sequential order and is widely
used in presenting the flow of algorithms, workflow or
processes.
Typically, a flowchart shows the steps as boxes of
various kinds, and their order by connecting them with
arrows.
25. Advantages Of Flowchart
• It is a convenient method of communication.
• It indicates very clearly just what is being done, where a program has
logical complexities.
• A key to correct programming.
• It is an important tool for planning and designing a new system.
• It clearly indicates the role-played at each level.
• It saves the inconveniences in future and serves the purpose of
documentation for a system.
• It provides an overview of the system and also demonstrates the
relationship between various steps.
• Facilitates troubleshooting.
• It promotes logical accuracy.
• It makes sure that no logical path is left incomplete without any action
being taken.
26. Disadvantages Of Flowchart
• The flowchart is a waste of time and slows down the process of software
development.
• The flowchart is quite costly to produce and difficult to use and manage.
• Flowcharts are not meant for man to computer communication.
• Sometimes the Complex logic of the program logic is quite complicated to
draw out on by using different defined shapes. In that case, flowchart
becomes complex and clumsy. This will become a pain for the user,
resulting in a waste of time and money trying to correct the problem
• If you need to modify or alternate the process then it will be very hard to do
in the flowchart. Because either you will have to erase the end of the
flowchart or start.