This document discusses algorithms and flowcharts. It defines an algorithm as a sequence of steps to solve a problem and get output from given input. A flowchart represents an algorithm using common symbols like rectangles, diamonds and arrows. The document explains properties of algorithms, provides examples of algorithms, and discusses the advantages of using flowcharts which include effective communication, analysis, documentation and program maintenance.
This document provides an overview of programming and computational thinking concepts including algorithms and flowcharts. It defines algorithms and their key properties such as finiteness, definiteness, inputs, outputs, and effectiveness. Common flowchart symbols are explained and examples of algorithms and flowcharts are provided to illustrate simple problems and their solutions. The document discusses advantages of algorithms like effective problem solving and consistency, and advantages of flowcharts like communication and documentation. Limitations of flowcharts with respect to complexity and modifications are also noted.
This document provides information about algorithms and flowcharts. It begins with defining an algorithm as a sequence of steps to solve a problem and discusses properties like finiteness, definiteness, inputs, outputs, and effectiveness. Examples of algorithms are provided for tasks like making noodles and checking voter eligibility. Flowcharts are introduced as a way to visually represent algorithms using standard symbols like rectangles, diamonds, and arrows. Advantages of algorithms and flowcharts are that they improve problem solving, communication, and programming. The document concludes with flowchart examples and a short class test.
EXPLAINS ABOUT ALGORITHM and FLOWCHART.pptxssuser4ff612
?
This ppt explains about the algorithm and its flowchart form for solving any computer problem. Before coding a programming issue or a problem, it needs to be described for a non-programmer to understand what is going on. That is why algorithm is important before coding. Picture speaks a lot than writing that is why flowchart representation of algorithm is important.
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, flowcharts, pseudocode, and decision structures. It begins by defining algorithms and their purpose in problem solving. It then explains flowchart symbols and how to represent algorithms visually using flowcharts. Several examples are provided of writing pseudocode, detailed algorithms, and corresponding flowcharts to solve problems. The document also covers decision structures like if-then-else statements and relational operators. It provides examples of algorithms using nested if statements. Finally, it presents an example of determining an employee bonus based on overtime worked and absences.
The document discusses basic elements of the C programming language including flow charts, algorithms, constants, variables, data types, and the structure of a C program. It provides definitions and examples of key concepts such as:
- Flow charts depict the sequence of instructions in an algorithm using standard symbols like rectangles, diamonds, and arrows.
- An algorithm is a precise set of instructions to solve a problem with inputs, unambiguous processing rules, basic instructions, and finite time and outputs.
- Constants in C include integers, characters, strings, and floating-point numbers. Variables are named values that can change.
- C has primary data types like int, char, float, and void, and derived types are built from the
The document provides information about flowcharts including:
- Flowcharts use symbols to represent steps in a process or program and the flow from one to the next.
- Common symbols include shapes for processes, decisions, inputs/outputs, and connecting arrows.
- Examples of flowcharts are given for finding the sum of two numbers, determining if a number is positive or negative, and finding the greatest of two numbers.
- Flowcharts can model sequential, selection, and repetitive program logic.
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.
The document discusses algorithms, flowcharts, and problem solving. It provides examples of writing pseudocode and algorithms to solve problems. It also explains the basic symbols used in flowcharts and provides examples of flowcharts. Key points include:
- Algorithms are step-by-step solutions to problems, while flowcharts show the logic visually using standard symbols.
- Pseudocode is an informal language similar to English that helps develop algorithms.
- Examples show algorithms and flowcharts for calculating grades, converting feet to centimeters, and finding the area of a rectangle.
- Standard flowchart symbols include shapes for start/end, processes, inputs/outputs, and decisions.
The document discusses key concepts in programming including algorithms, flowcharts, pseudocode, and the program development life cycle (PDLC). It provides definitions and examples of each concept. The main points covered are:
- An algorithm is a series of steps to solve a problem with properties like finiteness and definiteness. Qualities of a good algorithm and levels of algorithm description are explained.
- Flowcharts use symbols to visually represent algorithms and program logic with benefits like clear communication. Examples of flowchart symbols and structures are given.
- Pseudocode resembles a simplified programming language and can be used to design algorithms with advantages like readability and ease of conversion to code.
- The PDLC is
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.
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.
Jagannath Institute Of Management Sciences, Vasant Kunj-II is one of the best BCA colleges in Delhi. Dr. Arpana Chaturvedi shares here the Notes of C- Algorithms. This subject is taught to semester I students of BCA
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.
This document discusses algorithms and provides examples of pseudocode and flowcharts. It begins by defining an algorithm as a sequence of instructions to solve a problem. It then explains that pseudocode specifies the steps of an algorithm using a structured English format without formal syntax. Examples of pseudocode are provided to find averages, squares, cubes, and largest numbers. The document also introduces flowcharts as a graphical way to represent algorithms using standard symbols like rectangles, diamonds, and arrows. Basic flowchart structures like sequence, selection, and loops are demonstrated. Overall, the document provides an overview of algorithms and shows how pseudocode and flowcharts can be used to design and visualize the logic and processes of algorithms.
The document discusses algorithms and flowcharts. It defines algorithms as step-by-step solutions to problems and flowcharts as graphical representations of algorithms using standard symbols. It provides examples of pseudocode algorithms and corresponding flowcharts to calculate student grades, convert between feet and centimeters, and calculate rectangle area. The key flowchart symbols are defined including start/end, input/output, decision, and process symbols connected by flow lines.
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.
Pseudocode is a detailed description of an algorithm or program expressed in plain language rather than a programming language. It allows programmers to design programs at a high level before writing code. The document provides examples of pseudocode for control structures like conditionals and loops, and calculating sales tax and weekly wages. It also defines flowcharts as diagrams that show the sequence of operations to solve a problem and lists common flowchart symbols like rectangles, diamonds, and circles. Guidelines are given for drawing flowcharts and examples are provided of flowcharts to find the largest of three numbers and sum the first 50 natural numbers.
This document discusses algorithms, flowcharts, and problem solving. It provides examples of writing pseudocode algorithms and creating corresponding flowcharts. Key points:
- Algorithms are step-by-step solutions to problems, while flowcharts use symbols to visually represent algorithm logic and flow.
- Pseudocode uses everyday language to describe algorithms before implementation.
- Common flowchart symbols include shapes for start/end, input/output, decisions, and processes connected by arrows showing flow.
- Examples show algorithms and flowcharts for calculating grades, converting units, finding a rectangle area, and other problems.
This document provides an introduction to JavaScript programming. It defines JavaScript as a popular programming language used to make web pages interactive. It discusses algorithms, variables, and flowcharts that are used to help program in JavaScript. It provides examples of algorithms, rules for creating flowcharts, and defines common symbols used in flowcharts like decision boxes, flow lines, input/output boxes, and process boxes. It concludes with an activity to create a flowchart for finding the perimeter of a square based on given algorithm steps.
The document discusses algorithms and flowcharts. It defines an algorithm as a sequence of steps to solve a problem and notes they can be expressed in various notations like pseudocode and programming languages. It then defines a flowchart as a diagram that represents an algorithm using symbolic shapes and describes the common shapes used in flowcharts like rectangles, diamonds, and arrows. Examples of flowcharts that compute sums and averages are provided.
A Brief Introduction About David CrowderDavid Crowder
?
David Crowder is a trailblazer in Contemporary Christian Music, blending bluegrass, rock, and electronic influences into an unforgettable sound. His many achievements speak volumes about his impact, and he’s known for his live performances that interweave genres.
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.
The document discusses algorithms, flowcharts, and problem solving. It provides examples of writing pseudocode and algorithms to solve problems. It also explains the basic symbols used in flowcharts and provides examples of flowcharts. Key points include:
- Algorithms are step-by-step solutions to problems, while flowcharts show the logic visually using standard symbols.
- Pseudocode is an informal language similar to English that helps develop algorithms.
- Examples show algorithms and flowcharts for calculating grades, converting feet to centimeters, and finding the area of a rectangle.
- Standard flowchart symbols include shapes for start/end, processes, inputs/outputs, and decisions.
The document discusses key concepts in programming including algorithms, flowcharts, pseudocode, and the program development life cycle (PDLC). It provides definitions and examples of each concept. The main points covered are:
- An algorithm is a series of steps to solve a problem with properties like finiteness and definiteness. Qualities of a good algorithm and levels of algorithm description are explained.
- Flowcharts use symbols to visually represent algorithms and program logic with benefits like clear communication. Examples of flowchart symbols and structures are given.
- Pseudocode resembles a simplified programming language and can be used to design algorithms with advantages like readability and ease of conversion to code.
- The PDLC is
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.
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.
Jagannath Institute Of Management Sciences, Vasant Kunj-II is one of the best BCA colleges in Delhi. Dr. Arpana Chaturvedi shares here the Notes of C- Algorithms. This subject is taught to semester I students of BCA
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.
This document discusses algorithms and provides examples of pseudocode and flowcharts. It begins by defining an algorithm as a sequence of instructions to solve a problem. It then explains that pseudocode specifies the steps of an algorithm using a structured English format without formal syntax. Examples of pseudocode are provided to find averages, squares, cubes, and largest numbers. The document also introduces flowcharts as a graphical way to represent algorithms using standard symbols like rectangles, diamonds, and arrows. Basic flowchart structures like sequence, selection, and loops are demonstrated. Overall, the document provides an overview of algorithms and shows how pseudocode and flowcharts can be used to design and visualize the logic and processes of algorithms.
The document discusses algorithms and flowcharts. It defines algorithms as step-by-step solutions to problems and flowcharts as graphical representations of algorithms using standard symbols. It provides examples of pseudocode algorithms and corresponding flowcharts to calculate student grades, convert between feet and centimeters, and calculate rectangle area. The key flowchart symbols are defined including start/end, input/output, decision, and process symbols connected by flow lines.
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.
Pseudocode is a detailed description of an algorithm or program expressed in plain language rather than a programming language. It allows programmers to design programs at a high level before writing code. The document provides examples of pseudocode for control structures like conditionals and loops, and calculating sales tax and weekly wages. It also defines flowcharts as diagrams that show the sequence of operations to solve a problem and lists common flowchart symbols like rectangles, diamonds, and circles. Guidelines are given for drawing flowcharts and examples are provided of flowcharts to find the largest of three numbers and sum the first 50 natural numbers.
This document discusses algorithms, flowcharts, and problem solving. It provides examples of writing pseudocode algorithms and creating corresponding flowcharts. Key points:
- Algorithms are step-by-step solutions to problems, while flowcharts use symbols to visually represent algorithm logic and flow.
- Pseudocode uses everyday language to describe algorithms before implementation.
- Common flowchart symbols include shapes for start/end, input/output, decisions, and processes connected by arrows showing flow.
- Examples show algorithms and flowcharts for calculating grades, converting units, finding a rectangle area, and other problems.
This document provides an introduction to JavaScript programming. It defines JavaScript as a popular programming language used to make web pages interactive. It discusses algorithms, variables, and flowcharts that are used to help program in JavaScript. It provides examples of algorithms, rules for creating flowcharts, and defines common symbols used in flowcharts like decision boxes, flow lines, input/output boxes, and process boxes. It concludes with an activity to create a flowchart for finding the perimeter of a square based on given algorithm steps.
The document discusses algorithms and flowcharts. It defines an algorithm as a sequence of steps to solve a problem and notes they can be expressed in various notations like pseudocode and programming languages. It then defines a flowchart as a diagram that represents an algorithm using symbolic shapes and describes the common shapes used in flowcharts like rectangles, diamonds, and arrows. Examples of flowcharts that compute sums and averages are provided.
A Brief Introduction About David CrowderDavid Crowder
?
David Crowder is a trailblazer in Contemporary Christian Music, blending bluegrass, rock, and electronic influences into an unforgettable sound. His many achievements speak volumes about his impact, and he’s known for his live performances that interweave genres.
https://crackedstore.co/after-verification-click-go-to-download-page/
Overview of Parallels Desktop Business Edition for macOS It allows you to run Windows and Mac applications side by side. Choose your view to make Windows ...
?? ? COPY & PASTE LINK https://up-community.net/dl/
Minitab Crack is a powerful statistical software that helps you analyze data and find solutions to your business problems.
Best IPTV Services for 2025:Top (10) Ranks in the USAdorothymcalister2
?
IPTV delivers high-quality streaming over the internet, offering thousands of channels, on-demand content, and pay-per-view events at a fraction of traditional cable costs. But with so many IPTV providers available, choosing the right one can be overwhelming.
That’s where we come in! We’ve researched and compared the best IPTV subscription services to help you find the perfect fit. In this guide, we’ll break down the top providers, their pricing, features, pros, and cons—so you can make an informed decision.
Whether you’re looking for 4K streaming, sports coverage, international channels, or budget-friendly options, we’ve got you covered.
Say goodbye to cable hassles and hello to endless entertainment with the best IPTV services for you! Let’s dive in! ?
What is IPTV (Internet Protocol Television)?
IPTV is a modern way to stream TV shows, movies, and live channels using the internet instead of cable or satellite. Unlike traditional TV, IPTV offers on-demand content across multiple devices like Smart TVs, smartphones, Firestick, and Android boxes. Enjoy 4K streaming, live sports, international channels, and a vast content library—all at a fraction of the cost of cable.
What to Look for When Shopping for IPTV Service.
Types of IPTV Services
Live IPTV – Streaming live TV channels in real time, similar to traditional broadcasts.
Time-Shifted IPTV – Allows users to watch previously aired content (like catch-up TV).
Video-On-Demand (VOD) – On-demand access to movies, shows, and other content.
Key Features of IPTV Subscription:
Live TV Streaming: Watch live broadcasts of news, sports, or entertainment channels.
Video on Demand (VOD): Access a library of movies and TV shows to watch whenever you want.
Time-Shifted Content: Pause, rewind, or watch previously aired shows (Catch-Up TV).
High-Quality Streaming: Often includes HD or 4K resolution options, depending on the provider and your internet connection.
Device Compatibility: Works on a range of devices, including Smart TVs, streaming boxes (like Roku or Amazon Fire Stick), and mobile devices.
Common Requirements:
A stable and fast internet connection (minimum of 10 Mbps recommended for HD streaming).
A compatible IPTV player app or device (e.g., VLC, Kodi, or a dedicated IPTV box).
An IPTV service provider offering subscriptions tailored to your content needs.
Legality of IPTV Subscription Online Service
While IPTV technology itself is legal, the legitimacy of the service depends on the provider. Some providers may stream unauthorized or pirated content. To ensure legality, choose an IPTV subscription from reputable, licensed service providers.
Ableton Live Suite Crack Free Download 2025emaanhashmi468
?
COPY & PASTE LINK??? https://up-community.pro/dl/
Ableton Live Suite 12 Crack is a powerful and highly versatile digital audio workstation (DAW) that is widely used for music production and live performances.
World777 Com Login – Access Your Account & Start Betting!world7co
?
Log in to World777 and enjoy seamless access to online cricket betting, live match updates, and exciting casino games. With a fast and secure login process, you can manage your account, place bets in real-time, and withdraw your winnings effortlessly.
Most Reliable IPTV Service Providers in the USA in 2025dorothymcalister2
?
Let’s dive in and find the perfect IPTV Service providers for you!
What is IPTV?
IPTV delivers television content over the internet rather than through conventional cable or satellite formats. This allows users to stream media on demand or through scheduled broadcasts using an internet connection. Unlike traditional TV, IPTV offers a personalized viewing experience, enabling users to watch what they want, when they want.
There are three main types of IPTV services:
Live IPTV – Real-time streaming of TV channels, similar to traditional broadcasting.
Video on Demand (VOD) – Access to a library of movies, shows, and other content at any time.
Time-Shifted TV – The ability to replay previously aired programs at convenience.
Advantages of IPTV
On-Demand Viewing – Watch favorite shows, movies, and events anytime.
Cost-Effectiveness – More affordable than traditional cable with flexible subscription options.
Interactivity – Pause, rewind, and record live TV for a customized experience.
Multi-Device Compatibility – Stream on smart TVs, smartphones, tablets, and computers.
Global Accessibility – Enjoy IPTV from anywhere with an internet connection.
Higher Quality Streaming – HD and UHD content for superior picture and sound.
Cloud-Based Storage – Digital video recording (DVR) without the need for physical storage.
https://crackedtech.net/after-verification-click-go-to-download-page/
Get stuck in MiniTool Partition Wizard online install? Download the offline installer here to complete the installation successfully!
VR_AR_Video_Production_Vastvik_Films.pptxVastvik Films
?
Virtual Reality (VR) and Augmented Reality (AR) are transforming video production by creating immersive and interactive storytelling experiences. VR offers a fully digital environment, while AR overlays digital elements onto the real world. These technologies enhance audience engagement by allowing them to step inside the story, making content more dynamic and emotionally compelling.
IObit Malware Fighter Pro Crack 12 Free Download Latestinfintypro03
?
COPY & PASTE LINK ?? https://up-community.pro/dl/ <---
IObit Malware Fighter Pro Crack is an advanced and powerful malware and spyware removal utility that detects, removes the deepest infections, and protects your PC.
With the Best IPTV Service Enjoy Live TV, Sports & Movies!dorothymcalister2
?
What is an IPTV Service?
An IPTV service delivers TV content via the internet, allowing users to stream live channels and on-demand videos on devices like smart TVs and smartphones. It offers features like catch-up TV, video-on-demand, and customizable channel options, giving users more control over their viewing experience.
How does IPTV Work?
IPTV works by delivering television content through the internet rather than traditional satellite or cable methods. Here’s how it works:
Content Acquisition: IPTV providers get content from multiple sources such as cable, satellite, or live events. This content could include TV shows, movies, sports events, etc.
Encoding & Compression: The content is then encoded and compressed into a digital format that can be transmitted over the internet.
Transmission over IP Network: Instead of using satellite or coaxial cables, IPTV uses the internet to send the content to users. It uses a private IP-based network.
Set-Top Box or App: To watch IPTV, you need a device that can decode the transmitted data. This could be a set-top box or an app on your smart TV, computer, or smartphone.
On-Demand & Live Streaming: IPTV can offer both live channels and on-demand content. Users can stream live TV channels or choose from a library of content..
Interactive Features: Many IPTV services include interactive features like pause, rewind, or fast-forward live TV.
3. ALGORITHM AND FLOW CHART
? able to define problem;
? able to define algorithm;
? write algorithms for simple problems;
? explain properties of an algorithm;
? the meaning of flowchart;
? explain the need of flow chart;
? explain different symbols used in flow chart;
? draw flow chart for simple problems; and
convert a flow chart into an algorithm and
vice versa.
OBJECTIVES
4. ALGORITHM AND FLOW CHART
Intelligence is one of the key
characteristics which differentiate a human
being from other living creatures on the
earth. Basic intelligence covers day to day
problem solving and making strategies to
handle different situations which keep
arising in day to day life.
INTRODUCTION
5. ALGORITHM AND FLOW CHART
One person goes Bank to withdraw money.
After knowing the balance in his account,
he/she decides to withdraw the entire
amount from his account but he/she has to
leave minimum balance in his account.
INTRODUCTION
6. ALGORITHM AND FLOW CHART
Here deciding about how much amount
he/she may withdraw from the account is
one of the example of the basic
intelligence. During the process of solving
any problem, one tries to find the
necessary steps to be taken in a sequence.
INTRODUCTION
7. ALGORITHM AND FLOW CHART
What is Algorithm?
Algorithm can be defined as: “A sequ
ence of activities to be processed for getti
ng desired output from a given input.”
8. ALGORITHM AND FLOW CHART
What is Algorithm?
Webopedia defines an algorithm as:
“A formula or set of steps for solving a
particularproblem. To be an algorithm, a set
of rules must be unambiguous and have a cl
ear stopping point”.
9. MUHAMMAD IBN MUSA AL-
KHWARIZMI
Mu?ammad ibn Mūsā al-
Khwārizmī (Persian: ??????
????
??????
?;???????? c. 780 – c. 850),
Formerly Latinized as Algoritmi, was
a Persian scholar who produced
works in mathematics, astronomy,
& geography under the patronage
of the Caliph Al-Ma'mun of
the Abbasid Caliphate.
Around 820 AD he was appointed as the astronomer
and head of the library of the House of
Wisdom in Baghdad.
10. PROPERTIES OF ALGORITHM
Donald Ervin Knuth has given a list of five
properties for an algorithm, these
properties are:
1) FINITENESS
2) DEFINITENESS
3) INPUT
4) OUTPUT
5) EFFECTIVENESS
11. PROPERTIES OF ALGORITHM
1) FINITENESS:
An algorithm must always terminate
after a finite number of steps. It
means after every step one reach
closer to solution of the problem and
after a finite number of steps
algorithm reaches to an end point.
12. PROPERTIES OF ALGORITHM
2) DEFINITENESS
Each step of an algorithm must be
precisely defined. It is done by well
thought actions to be performed at
each step of the algorithm. Also the
actions are defined unambiguously for
each activity in the algorithm.
13. PROPERTIES OF ALGORITHM
3) INPUT
Any operation you perform need
some beginning value/quantities
associated with different activities in
the operation. So the value/quantities
are given to the algorithm before it
begins.
14. PROPERTIES OF ALGORITHM
4) OUTPUT:
One always expects output/result
(expected value/quantities) in terms of output
from an algorithm. The result may be obtained
at different stages of the algorithm. If some
result is from the intermediate stage of the
operation then it is known as intermediate
result and result obtained at the end of
algorithm is known as end result. The output
is expected value/quantities always have a
specified relation to the inputs.
15. PROPERTIES OF ALGORITHM
5) EFFECTIVENESS:
Algorithms to be developed/written
using basic operations. Actually operations
should be basic, so that even they can in
principle be done exactly and in a finite
amount of time by a person, by using paper
and pencil only.
16. PROPERTIES OF ALGORITHM
Any algorithm should have all these five
properties otherwise it will not fulfil the
basic objective of solving a problem in finite
time. As you have seen in previous
examples, every step of an algorithm puts
you closer to the solution
17. ALGORITHM EXAMPLES
Let us take one simple day-to-day example
by writing algorithm for making, “Maggi
Noodles? as a food.
Step 1: Start
Step 2: Take pan with water
Step 3: Put pan on the burner
Step 4: Switch on the gas/burner
Step 5: Put magi and masala
Step 6: Give two minutes to boil
Step 7: Take off the pan
Step 8: Take out the magi with the help of
fork/spoon
Step 9: Put the maggi on the plate and serve it
Step 10: Stop.
19. ALGORITHM EXAMPLES
Write an algorithm to find area of a rectangle.
Step 1: Start
Step 2: Take length and breadth and
store them as L and B?
Step 3: Multiply by L and B and store it
in area
Step 4: Print area
Step 5: Stop
20. ALGORITHM EXAMPLES
Write an algorithm to check whether he is
eligible to vote? (more than or equal to 18
years old).
Step 1: Start
Step 2: Take age and store it in age
Step 3: Check age value, if age >= 18 then go
to step 4 else step 5
Step 4: Print “Eligible to vote” and go to
step 6
Step 5: Print “Not eligible to vote”
Step 6: Stop
21. ALGORITHM EXAMPLES
Write an algorithm to check whether given
number is +ve, -ve or zero.
Step 1: Start
Step 2: Take any number and store it in n.
Step 3: Check n value, if n > 0 then go to
step 5 else go to step 4
Step 4: Check n value, if n < 0 then go to
step 6 else go to step 7
22. ALGORITHM EXAMPLES
Write an algorithm to check whether given
number is +ve, -ve or zero.
Step 5: Print “Given number is +ve”and go
to step 8
Step 6: Print “Given number is -ve” and go
to step 8
Step 7: Print “Given number is zero”
Step 8: Stop
24. sually presents the flow of data thr
ough processing
systems. This means by seeing a flo
w chart one can know the operatio
ns performed and
the sequence of these operations i
n a system. Algorithms are nothing
but sequence of
steps for solving problems. So a flo
w chart can be used for representin
g an algorithm. A
flowchart, will describe the operati
25. A flowchart is a type
of diagram that represents
an algorithm, workflow or process.
The flowchart shows the steps as
boxes of various kinds, and their
order by connecting the boxes with
arrows. This diagrammatic
representation illustrates a solution
model to a given problem.
Flowcharts are used in analyzing,
designing, documenting or
27. The American National Standards
Institute (ANSI) set standards for flowcharts
and their symbols in the
1960s. The International Organization for
Standardization(ISO) adopted the ANSI
symbols in 1970. The current standard was
revised in 1985. Generally, flowcharts flow
from top to bottom and left to right.
BUILDING BLOCKS OF FLOW CHART
28. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Flowline
(Arrowhead)
Shows the process's order of
operation. A line coming from
one symbol and pointing at
another. Arrowheads are
added if the flow is not the
standard top-to-bottom, left-
to right.
29. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Terminal
Indicates the beginning and ending
of a program or sub-process.
Represented as a stadium, oval or
rounded (fillet) rectangle. They
usually contain the word "Start" or
"End", or another phrase signaling
the start or end of a process, such as
"submit inquiry" or "receive
product".
30. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Process
Represents a set of operations that
changes value, form, or location of
data. Represented as a rectangle
31. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Decision
Shows a conditional operation that
determines which one of the two
paths the program will take. The
operation is commonly a yes/no
question or true/false test.
Represented as a diamond
(rhombus).
32. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Input /
Output
Indicates the process of inputting
and outputting data, as in entering
data or displaying results.
Represented as a parallelogram
33. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Annotation
(Comment)
Indicating additional
information about a step the
program. Represented as an
open rectangle with a dashed
or solid line connecting it to
the corresponding symbol in
the flowchart.
34. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Predefined
Process
Functions
Shows named process
/Function which is defined
elsewhere. Represented as
a rectangle with double-
struck vertical edges.
35. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
On-page
Connector
Pairs of labelled connectors
replace long or confusing
lines on a flowchart page.
Represented by a small
circle with a letter inside.
36. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Off-page
Connector
A labelled connector for
use when the target is on
another page. Represented
as a home plate-
shaped pentagon.
37. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Storage/
Backup
Magnetic Tape used for sec
ondary storage/Backup
38. BUILDING BLOCKS OF FLOW CHART
ANSI/ISO
Shape
Name Description
Storage/
Backup
Magnetic Disk used for sec
ondary storage/Backup
39. ADVANTAGES OF USING FLOWCHARTS
As we discussed flow chart is used for
representing algorithm in pictorial form.
This pictorial representation of a
solution/system is having many
advantages. These advantages are as
follows:
1. COMMUNICATION.
2. EFFECTIVE ANALYSIS.
3. DOCUMENTATION OF PROGRAM/SYSTEM.
4. EFFICIENT PROGRAM MAINTENANCE.
5. CODING OF THE PROGRAM.
40. ADVANTAGES OF USING FLOWCHARTS
1. COMMUNICATION:
A Flowchart can be used as a better way of
communication of the logic of a system and
steps involve in the solution, to all concerned
particularly to the client of system.
41. ADVANTAGES OF USING FLOWCHARTS
2. EFFECTIVE ANALYSIS:
A flowchart of a problem can be used for
effective analysis of the problem.
42. ADVANTAGES OF USING FLOWCHARTS
3.DOCUMENTATION OF PROGRAM/
SYSTEM:
Program flowcharts are a vital part of a good
program documentation. Program document is
used for various purposes like knowing the
components in the program, complexity of the
program etc.
43. ADVANTAGES OF USING FLOWCHARTS
4. EFFICIENT PROGRAM
MAINTENANCE:
Once a program is developed and becomes
operational it needs time to time maintenance.
With help of flowchart maintenance become
easier.
44. ADVANTAGES OF USING FLOWCHARTS
5. CODING OF THE PROGRAM:
Any design of solution of a problem is finally
converted into computer program. Writing code
referring the flowchart of the solution become
easy.
45. LIMITATIONS OF USING FLOWCHARTS
1) COMPLEXITY OF LOGIC: If program logic is
complex then flowchart of the program
becomes complicated.
2) ALTERATIONS AND MODIFICATIONS IN LOGIC:
any alterations in the program logic may require
redrawing of flowchart completely.
3) REUSE IS NOT POSSIBLE: As the flowchart
symbols cannot be typed, always reproduction
of flowchart symbols are required.