0% found this document useful (0 votes)
23 views

IX Ch-1 Algorithms and Flowcharts (Python Manual)

Uploaded by

aaravkr302010
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views

IX Ch-1 Algorithms and Flowcharts (Python Manual)

Uploaded by

aaravkr302010
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Q/A cum topic-wise notes

Ch-1: Algorithms & Flowcharts (Python Content Manual)

Q1) What is an algorithm? (page 15)


• The method to write a logical step-by-step solution of the identified problem is called algorithm. In other
words, an algorithm is a procedure for solving problems.
• In order to solve a mathematical or computer problem, this is the first step of the procedure.
• An algorithm includes calculations, reasoning and data processing. Algorithms can be written and presented
by any natural languages.
• We need to mention the Start and Stop of the algorithm as the first and last steps.
• Below is the example of an algorithm to find the larger number between two.
Step 1: Start
Step 2: Declare variables a and b.
Step 3: Read variables a and b.
Step 4: If a > b
Display a is the largest number.
Else
Display b is the largest number.
Step 5: Stop

Q2) What is a flowchart? (page 18)


• A flowchart is the graphical or pictorial representation of an algorithm with the help of different symbols,
shapes and arrows in order to demonstrate a process or a program.
• Humans need visual representations to understand the information well and communicate it effectively.
• Flowcharts are used to break a process into smaller parts and elaborate it using visual representations.

Q3) List down all the standard graphics for making a flowchart. (page 18)

Terminal Box Input/ Output Process/ Instruction


(Start/ Stop)

Decision/ Conditional Connector/ Arrow/ Flow lines


Q4) Represent the below algorithm using a flowchart. (hint on page 19)
Step 1: Start
Step 2: Declare variables a and b.
Step 3: Read variables a and b.
Step 4: If a > b
Display a is the largest number.
Else
Display b is the largest number.
Step 5: Stop

Flowchart:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy