Chapter 3: Algorithms and Flowchart
(Note: Question and Answers to be written in Notebook)
(Write the questions from text book for respective “Main” and write the answers below)
D. Answer the following questions:
ANS 1. Algorithm is step-by-step procedure, which defines a set of instructions to be
executed in a certain order to get the desired output.
ANS 2. The efficiency of the program mainly depends on the algorithm. It should be
precise, short and mention the idea of programming logic. An algorithm should not use
any direct computer programming commands. It should be written in such a way that; it
can be used in similar programming languages.
An algorithm should have the following characteristics –
• Unambiguous − Algorithm should be clear and unambiguous. Each of the steps of
algorithm should be clear and must lead to only one meaning.
• Input − An algorithm should have 0 or more well-defined inputs.
• Output − An algorithm should have 1 or more well-defined outputs, and should
match the desired output.
• Finiteness − Algorithms must terminate after a finite number of steps.
• Feasibility – Algorithm should be feasible with the available resources.
• Independent − An algorithm should have step-by-step directions, which should be
independent of any programming code.
ANS 3. Flowcharts are graphical method of designing programs and are very easy to
draw. By visualizing the process, a flowchart can quickly help identify bottlenecks or
inefficiencies where the process can be streamlined or improved.
ANS 4. An algorithm should have the following characteristics−
➢ Unambiguous − Algorithm should be clear and unambiguous. Each of the steps of
algorithm should be clear and must lead to only one meaning.
➢ Input − An algorithm should have 0 or more well-defined inputs.
➢ Output − An algorithm should have 1 or more well-defined outputs, and should
match the desired output.
➢ Finiteness − Algorithms must terminate after a finite number of steps.
➢ Feasibility – Algorithm should be feasible with the available resources.
➢ Independent − An algorithm should have step-by-step directions, which should be
independent of any programming code.
ANS 5. Algorithms are used for
i. calculation,
ii. data processing, and
iii. automated reasoning.
ANS 6. Steps in a Flowchart are shown with symbolic shapes, and the flow of the process
is indicated with arrows connecting the symbols. Computer programmers popularized
flowcharts in the 1960’s, using them to map the logic of programs. In quality improvement
work, flowcharts are particularly useful for displaying how a process currently functions or
could ideally function.
ANS 7.
ANS 8: Flow lines ate the Lines that indicate the sequence of steps and the direction of
flow.
ANS 9: The following are the uses of flowcharts:
• Planning a new project
• Providing clarity of relationships among various processing steps
• Data collection during processing
• Data management
• Assisting in decision making process
• Evaluating the performance of a process
• Exploring the structure of a program
• Tracing the flow of processing
• Developing the logic of the programming
• To manage the workflow of process
• Helps to audit a process
(Note: Answers to be written in Textbook)
A. Choose the correct option.
1. d. It should be dependent of programming language
2. d. All of these
3. a. Symbolic shapes
4. b. Both start and ending point of the system
5. a. A decision
B. Write T for True and F for False statements.
1. False
2. True
3. False
4. True
5. True
C. Fill in the blanks.
1. algorithm
2. algorithm
3. express
4. graphical
6. Flowcharts
6. sequence
*************