The document discusses planning computer programs. It describes that programs must be planned before writing through algorithms, flowcharts, and pseudocode. Algorithms define the logic steps, flowcharts show the logic visually through standardized symbols and connections, and pseudocode describes the logic in a code-like format without actual syntax. Examples are provided of algorithms, flowcharts, and how to represent different logic structures and program flows. Planning helps ensure the instructions are correct and in the proper sequence.
This PPT is for First year engineering student,It covered all about C Programming according to Rajastha Technical University Kota.
flowchart, pseudo code, Programming Languages and Language Translators, Identifiers, Constants, Variables, Basic Data Types, Operators, Expressions, type casting, Input / Output Statement, Scope Rules and Storage classes, Preprocessor and Macro Substitution.
Breadth First Search & Depth First SearchKevin Jadiya
The slides attached here describes how Breadth first search and Depth First Search technique is used in Traversing a graph/tree with Algorithm and simple code snippet.
This PPT is for First year engineering student,It covered all about C Programming according to Rajastha Technical University Kota.
flowchart, pseudo code, Programming Languages and Language Translators, Identifiers, Constants, Variables, Basic Data Types, Operators, Expressions, type casting, Input / Output Statement, Scope Rules and Storage classes, Preprocessor and Macro Substitution.
Breadth First Search & Depth First SearchKevin Jadiya
The slides attached here describes how Breadth first search and Depth First Search technique is used in Traversing a graph/tree with Algorithm and simple code snippet.
Presentation on "Knowledge acquisition & validation"Aditya Sarkar
Presentation on "Knowledge acquisition and validation made and presented by Aditya Sarkar, I took the help of different sources available on internet to make all understand how a knowledge is acquired?. I hope this presentation will help everyone.
Knowledge representation In Artificial IntelligenceRamla Sheikh
facts, information, and skills acquired through experience or education; the theoretical or practical understanding of a subject.
Knowledge = information + rules
EXAMPLE
Doctors, managers.
P, NP, NP-Complete, and NP-Hard
Reductionism in Algorithms
NP-Completeness and Cooks Theorem
NP-Complete and NP-Hard Problems
Travelling Salesman Problem (TSP)
Travelling Salesman Problem (TSP) - Approximation Algorithms
PRIMES is in P - (A hope for NP problems in P)
Millennium Problems
Conclusions
1)what is an algorithm?
2)problem solving
3)Algorithms: example 1
4)Algorithms: example 2
5)Flowcharts
6)Flowcharts: example 1
2)A guide to understanding flowcharts
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking
To understand algorithm and flowchart, it is better to refer this Slideshare that I have created. I have thoroughly presented the key points that make easy in remembering what algorithm and flowchart is. The slide is really simple and wonderful to use it for a quick reference.
Presentation on "Knowledge acquisition & validation"Aditya Sarkar
Presentation on "Knowledge acquisition and validation made and presented by Aditya Sarkar, I took the help of different sources available on internet to make all understand how a knowledge is acquired?. I hope this presentation will help everyone.
Knowledge representation In Artificial IntelligenceRamla Sheikh
facts, information, and skills acquired through experience or education; the theoretical or practical understanding of a subject.
Knowledge = information + rules
EXAMPLE
Doctors, managers.
P, NP, NP-Complete, and NP-Hard
Reductionism in Algorithms
NP-Completeness and Cooks Theorem
NP-Complete and NP-Hard Problems
Travelling Salesman Problem (TSP)
Travelling Salesman Problem (TSP) - Approximation Algorithms
PRIMES is in P - (A hope for NP problems in P)
Millennium Problems
Conclusions
1)what is an algorithm?
2)problem solving
3)Algorithms: example 1
4)Algorithms: example 2
5)Flowcharts
6)Flowcharts: example 1
2)A guide to understanding flowcharts
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking
To understand algorithm and flowchart, it is better to refer this Slideshare that I have created. I have thoroughly presented the key points that make easy in remembering what algorithm and flowchart is. The slide is really simple and wonderful to use it for a quick reference.
A practical computer program that diagnoses diseases in actual patients.carlos_feder
Several so called "computer medical diagnosis programs" have been devised. We had a chance to review Internist, Quick Medical Reference (QMR), DXplain, Iliad, Gideon, Isabel, and others; some are no longer available. All this systems evoke a typically long differential diagnosis list, based on patient's symptoms, providing an excellent reminder of unusual diagnoses; however, they are unable to pinpoint the actual disease or diseases that indeed afflict a specific patient. Consequently, they are considered rather teaching or training tools for medical students or inexperienced physicians, as admitted by some of the program authors; for this reason and being quite time consuming to consult, these programs are poorly accepted and used by practicing health care providers. Our novel diagnostic system overcomes the drawbacks of existing programs, emulating as close as possible the natural reasoning of human clinicians. The core of our system is the novel mini-max procedure that computes the probability of each potential diagnosis more accurately than Bayes formula, Bayesian networks, and other similar methods; the system also diagnoses concurrent diseases that simultaneously afflict a single patient. Mini-max procedure enables to determine probabilistically and recommend at each diagnostic step the best cost-benefit clinical data next to investigate in a patient. This facilitates important overall cost saving-cost comprising expense, risk, and discomfort of obtaining clinical data-for patents and saving of available medical resources, by discouraging the ordering of futile tests or procedures. Our system is capable of diagnosing complex clinical presentations and precludes overlooking diagnoses associated with confirmed diagnoses. For all its virtues, our diagnostic system offers important socio-economic benefits that have the potential to change the way medicine will be practiced in the future; it is expected to provide invaluable benefits to patients, physicians, nurses, hospitals, health insurance companies, malpractice insurance companies and lawyers, and the entire medical establishment.
Motivation. A power that drives us to excel. Yet often missing. Get inspired and go change the world!
This presentation is a shorter version of my original 'D.I.Y - A Story on Motivation' upload.
This is the ppt of Array in data structure and algorithm which is provided by our faculty member of Galgotias University. In this ppt you will see basic introduction of Data structure's Algorithm.You will learn the need of Algorithm, learn how to write algorithm and Examples to understand in better way .
Explaining on what is a program ,how a program development is done with a study on program development life cycle,Algorithm ,characteristics of an algorithm,few examples
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
Chapter 01 Planning Computer Program (re-upload)
1. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 1/44Chapter 11: Planning the Computer ProgramRef Page
2. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 2/44Chapter 11: Planning the Computer ProgramRef Page
In this chapter you will learn about:
§ Programs must be planned before they are written
§ Algorithm
§ Flowchart
§ Pseudocode
§ Plan the logic of a computer program
§ Commonly used tools for program planning and
their use
Learning ObjectivesLearning Objectives
183
3. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 3/44Chapter 11: Planning the Computer ProgramRef Page
Purpose of Program PlanningPurpose of Program Planning
§ To write a correct program, a programmer must write
each and every instruction in the correct sequence
§ Logic (instruction sequence) of a program can be very
complex
§ Hence, programs must be planned before they are
written to ensure program instructions are:
§ Appropriate for the problem
§ In the correct sequence
183
4. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 4/44Chapter 11: Planning the Computer ProgramRef Page
AlgorithmAlgorithm
§ Refers to the logic of a program and a step-by-step
description of how to arrive at the solution of a given
problem
§ In order to qualify as an algorithm, a sequence of
instructions must have following characteristics:
§ Each and every instruction should be precise and
unambiguous
§ Each instruction should be such that it can be performed in
a finite time
§ One or more instructions should not be repeated infinitely.
This ensures that the algorithm will ultimately terminate
§ After performing the instructions, that is after the algorithm
terminates, the desired results must be obtained
184
5. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 5/44Chapter 11: Planning the Computer ProgramRef Page
Sample Algorithm (Example 1)Sample Algorithm (Example 1)
There are 50 students in a class who appeared in their
final examination. Their mark sheets have been given to
you.
The division column of the mark sheet contains the
division (FIRST, SECOND, THIRD or FAIL) obtained by the
student.
Write an algorithm to calculate and print the total number
of students who passed in FIRST division.
184
6. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 6/44Chapter 11: Planning the Computer ProgramRef Page
Step 1: Initialize Total_First_Division and
Total_Marksheets_Checked to zero.
Step 2: Take the mark sheet of the next student.
Step 3: Check the division column of the mark sheet to see if it is
FIRST, if no, go to Step 5.
Step 4: Add 1 to Total_First_Division.
Step 5: Add 1 to Total_Marksheets_Checked.
Step 6: Is Total_Marksheets_Checked = 50, if no, go to Step 2.
Step 7: Print Total_First_Division.
Step 8: Stop.
Sample Algorithm (Example 1)Sample Algorithm (Example 1)
(contd…)
184
7. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 7/44Chapter 11: Planning the Computer ProgramRef Page
There are 100 employees in an organization. The organization
wants to distribute annual bonus to the employees based on their
performance. The performance of the employees is recorded in
their annual appraisal forms.
Every employee’s appraisal form contains his/her basic salary and
the grade for his/her performance during the year. The grade is of
three categories – ‘A’ for outstanding performance, ‘B’ for good
performance, and ‘C’ for average performance.
It has been decided that the bonus of an employee will be 100% of
the basic salary for outstanding performance, 70% of the basic
salary for good performance, 40% of the basic salary for average
performance, and zero for all other cases.
Write an algorithm to calculate and print the total bonus amount to
be distributed by the organization.
Sample Algorithm (Example 2)Sample Algorithm (Example 2)
185
8. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 8/44Chapter 11: Planning the Computer ProgramRef Page
Step 1: Initialize Total_Bonus and Total_Employees_Checked to zero.
Step 2: Initialize Bonus and Basic_Salary to zero.
Step 3: Take the appraisal form of the next employee.
Step 4: Read the employee’s Basic_Salary and Grade.
Step 5: If Grade = A, then Bonus = Basic_Salary. Go to Step 8.
Step 6: If Grade = B, then Bonus = Basic_Salary x 0.7. Go to Step 8.
Step 7: If Grade = C, then Bonus = Basic_Salary x 0.4.
Step 8: Add Bonus to Total_Bonus.
Step 9: Add 1 to Total_Employees_Checked.
Step 10: If Total_Employees_Checked < 100, then go to Step 2.
Step 11: Print Total_Bonus.
Step 12: Stop.
Sample Algorithm (Example 2)Sample Algorithm (Example 2)
(contd…)
185
9. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 9/44Chapter 11: Planning the Computer ProgramRef Page
Representation of AlgorithmsRepresentation of Algorithms
§ As programs
§ As flowcharts
§ As pseudocodes
When an algorithm is represented in the form of a
programming language, it becomes a program
Thus, any program is an algorithm, although the
reverse is not true
185
10. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 10/44Chapter 11: Planning the Computer ProgramRef Page
FlowchartFlowchart
§ Flowchart is a pictorial representation of an algorithm
§ Uses symbols (boxes of different shapes) that have
standardized meanings to denote different types of
instructions
§ Actual instructions are written within the boxes
§ Boxes are connected by solid lines having arrow marks to
indicate the exact sequence in which the instructions are
to be executed
§ Process of drawing a flowchart for an algorithm is called
flowcharting
186
12. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 12/44Chapter 11: Planning the Computer ProgramRef Page
Examples of Decision SymbolExamples of Decision Symbol
Is I = 10?
No
Yes
(a) A two-way branch decision. (b) A three-way branch decision.
A > B
A = B
A < B Compare
A & B
188
13. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 13/44Chapter 11: Planning the Computer ProgramRef Page
I = ?
(c) A multiple-way branch decision.
= 0 = 1 = 2 = 3 = 4 = 5 = Other
Examples of Decision SymbolExamples of Decision Symbol
(contd…)
188
14. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 14/44Chapter 11: Planning the Computer ProgramRef Page
Sample Flowchart (Example 3)Sample Flowchart (Example 3)
A student appears in an examination, which consists of
total 10 subjects, each subject having maximum marks
of 100.
The roll number of the student, his/her name, and the
marks obtained by him/her in various subjects are
supplied as input data.
Such a collection of related data items, which is treated
as a unit is known as a record.
Draw a flowchart for the algorithm to calculate the
percentage marks obtained by the student in this
examination and then to print it along with his/her roll
number and name.
188
15. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 15/44Chapter 11: Planning the Computer ProgramRef Page
Start
Read input data
Add marks of all
subjects giving Total
Percentage = Total / 10
Write output data
Stop
Sample Flowchart (Example 3)Sample Flowchart (Example 3)
(contd…)
189
16. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 16/44Chapter 11: Planning the Computer ProgramRef Page
50 students of a class appear in the examination of
Example 3.
Draw a flowchart for the algorithm to calculate and print
the percentage marks obtained by each student along
with his/her roll number and name.
Sample Flowchart (Example 4)Sample Flowchart (Example 4)
189
17. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 17/44Chapter 11: Planning the Computer ProgramRef Page
Flowchart for the solution
of Example 4 with an
infinite (endless) process
loop.
Start
Add marks of all
subjects giving Total
Percentage = Total / 10
Write output data
Read input data
Sample Flowchart (Example 4)Sample Flowchart (Example 4)
(contd…)
190
18. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 18/44Chapter 11: Planning the Computer ProgramRef Page
Flowchart for the solution
of Example 4.
Stop
Start
Read input data
Count = 0
Add marks of all subjects giving Total
Percentage = Total/10
Write output data
Add 1 to Count
Is Count = 50?
No
Yes
Sample Flowchart (Example 4)Sample Flowchart (Example 4)
(contd…)
191
19. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 19/44Chapter 11: Planning the Computer ProgramRef Page
Sample Flowchart (Example 4)Sample Flowchart (Example 4)
Generalized flowchart
for the solution of
Example 4 using the
concept of trailer
record. Here the
process loop is
terminated by detecting
a special non-data
record.
Stop
Yes
Start
Add marks of all subjects
giving Total
Percentage = Total / 10
No
Is Rollno = 0000000?
Read input data
Write output data
(contd…)
191
20. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 20/44Chapter 11: Planning the Computer ProgramRef Page
For the examination of Example 3, we want to make a
list of only those students who have passed (obtained
30% or more marks) in the examination.
In the end, we also want to print out the total number of
students who have passed.
Assuming that the input data of all the students is
terminated by a trailer record, which has sentinel value
of 9999999 for Rollno, draw a flowchart for the
algorithm to do this.
Sample Flowchart (Example 5)Sample Flowchart (Example 5)
192
21. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 21/44Chapter 11: Planning the Computer ProgramRef Page
Is Percentage = > 30?
Percentage = Total/10
Start
Count = 0
Add marks of all subjects giving Total
Is Rollno = 9999999?
No
Yes
Add 1 to Count
Read input data
Write output data
No
Write Count
Stop
Yes
Sample Flowchart (Example 5)Sample Flowchart (Example 5)
(contd…)
193
22. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 22/44Chapter 11: Planning the Computer ProgramRef Page
Suppose the input data of each student for the examination of
Example 3 also contains information regarding the sex of the
candidate in the field named Sexcode having values M (for
male) or F (for female).
We want to make a list of only those female students who have
passed in second division (obtained 45% or more but less than
60% marks).
In the end, we also want to print out the total number of such
students.
Assuming that the input data of all the students is terminated
by a trailer record, which has a sentinel value of Z for Sexcode,
draw a flowchart for the algorithm to do this.
Sample Flowchart (Example 6)Sample Flowchart (Example 6)
193
23. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 23/44Chapter 11: Planning the Computer ProgramRef Page
Add marks of all subjects giving Total
Yes
Yes
No
Start
Count = 0
No
1
Read input data
Is Sexcode = Z?
Is Sexcode = F?
1
2
Percentage = Total / 10
3
Sample Flowchart (Example 6)Sample Flowchart (Example 6)
195
24. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 24/44Chapter 11: Planning the Computer ProgramRef Page
No
No
Yes
Yes
Add 1 to Count
Write output data
Is Percentage < 60?
Is Percentage = > 45?
Stop
Write Count
2
1
1
1
3
Sample Flowchart (Example 4)Sample Flowchart (Example 4)
(contd…)
195
25. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 25/44Chapter 11: Planning the Computer ProgramRef Page
Levels of FlowchartLevels of Flowchart
§ Flowchart that outlines the main segments of a program
or that shows less details is a macro flowchart
§ Flowchart with more details is a micro flowchart, or
detailed flowchart
§ There are no set standards on the amount of details that
should be provided in a flowchart
196
26. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 26/44Chapter 11: Planning the Computer ProgramRef Page
Example of Micro FlowchartExample of Micro Flowchart
Part of a macro
flowchart
Add marks of all
subjects giving Total
Is I > 10?
1
I = 1
Total = 0
Total = Total + Marks (I)
I = I + 1
1
Yes
No
A micro
Flowchart
196
27. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 27/44Chapter 11: Planning the Computer ProgramRef Page
§ First chart the main line of logic, then incorporate detail
§ Maintain a consistent level of detail for a given flowchart
§ Do not chart every detail of the program. A reader who is
interested in greater details can refer to the program itself
§ Words in the flowchart symbols should be common
statements and easy to understand
Flowcharting RulesFlowcharting Rules
196
28. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 28/44Chapter 11: Planning the Computer ProgramRef Page
§ Be consistent in using names and variables in the
flowchart
§ Go from left to right and top to bottom in
constructing flowcharts
§ Keep the flowchart as simple as possible. Crossing of
flow lines should be avoided as far as practicable
§ If a new flowcharting page is needed, it is
recommended that the flowchart be broken at an
input or output point.
§ Properly labeled connectors should be used to link
the portions of the flowchart on different pages
(contd…)
Flowcharting RulesFlowcharting Rules
197
29. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 29/44Chapter 11: Planning the Computer ProgramRef Page
Advantages of FlowchartAdvantages of Flowchart
§ Better Communication
§ Proper program documentation
§ Efficient coding
§ Systematic debugging
§ Systematic testing
197
30. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 30/44Chapter 11: Planning the Computer ProgramRef Page
Limitations of FlowchartLimitations of Flowchart
§ Flowcharts are very time consuming and laborious to
draw (especially for large complex programs)
§ Redrawing a flowchart for incorporating changes/
modifications is a tedious task
§ There are no standards determining the amount of detail
that should be included in a flowchart
198
31. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 31/44Chapter 11: Planning the Computer ProgramRef Page
PseudocodePseudocode
§ A program planning tool where program logic is written in
an ordinary natural language using a structure that
resembles computer instructions
§ “ Pseudo” means imitation or false and “ Code” refers to
the instructions written in a programming language.
Hence, pseudocode is an imitation of actual computer
instructions
§ Because it emphasizes the design of the program,
pseudocode is also called Program Design Language
(PDL)
198
32. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 32/44Chapter 11: Planning the Computer ProgramRef Page
Basic Logic (Control) StructuresBasic Logic (Control) Structures
Any program logic can be expressed by using only
following three simple logic structures:
1. Sequence logic,
2. Selection logic, and
3. Iteration (or looping) logic
Programs structured by using only these three logic
structures are called structured programs, and the
technique of writing such programs is known as
structured programming
199
33. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 33/44Chapter 11: Planning the Computer ProgramRef Page
It is used for performing instructions one after another
in sequence.
Sequence LogicSequence Logic
Process 1
(b) Pseudocode
Process 2
Process 1
Process 2
(a) Flowchart
199
34. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 34/44Chapter 11: Planning the Computer ProgramRef Page
Selection LogicSelection Logic
• Also known as decision logic, it is used for making
decisions
• Three popularly used selection logic structures are
1. IF…THEN…ELSE
2. IF…THEN
3. CASE
200
35. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 35/44Chapter 11: Planning the Computer ProgramRef Page
Selection Logic (IF…THEN…ELSE Structure)Selection Logic (IF…THEN…ELSE Structure)
THEN
Process 2
IF Condition
Process 1
ELSE
ENDIF
(b) Pseudocode
THEN
Process 1
ELSE
Process 2
Yes No
(a) Flowchart
IF (condition)
200
36. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 36/44Chapter 11: Planning the Computer ProgramRef Page
(b) Pseudocode
THEN
IF Condition
Process 1
ENDIF
THEN
Process 1
Yes No
(a) Flowchart
IF (condition)
Selection Logic (IF…THEN Structure)Selection Logic (IF…THEN Structure)
200
37. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 37/44Chapter 11: Planning the Computer ProgramRef Page
Selection Logic (CASE Structure)Selection Logic (CASE Structure)
(b) Pseudocode
Case Type 1: Process 1
CASE Type
ENDCASE
Case Type 2: Process 2
Case Type n: Process n
Type 1
Type 2
Type n
Process 2
Process 1
Process n
Yes
Yes
Yes
No
No
No
(a) Flowchart
201
38. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 38/44Chapter 11: Planning the Computer ProgramRef Page
Iteration (or Looping) LogicIteration (or Looping) Logic
§ Used to produce loops in program logic when one or
more instructions may be executed several times
depending on some conditions
§ Two popularly used iteration logic structures are
1. DO…WHILE
2. REPEAT…UNTIL
201
39. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 39/44Chapter 11: Planning the Computer ProgramRef Page
Iteration (or Looping) Logic
(DO…WHILE Structure)
Iteration (or Looping) Logic
(DO…WHILE Structure)
(b) Pseudocode
DO WHILE Condition
Process 1
ENDDO
Process n
Process 1
False
(a) Flowchart
Process n
True
Condition?
Block
202
40. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 40/44Chapter 11: Planning the Computer ProgramRef Page
Iteration (or Looping) Logic
(REPEAT…UNTIL Structure)
Iteration (or Looping) Logic
(REPEAT…UNTIL Structure)
(b) Pseudocode
REPEAT
Process 1
UNTIL Condition
Process n
Process 1
(a) Flowchart
Process n
True
False
Condition?
202
41. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 41/44Chapter 11: Planning the Computer ProgramRef Page
Sample Pseudocode (for Example 6)Sample Pseudocode (for Example 6)
Set Count to zero
Read first student record
DO WHILE Sexcode is not equal to Z
IF Sexcode = F THEN
Calculate Percentage
IF Percentage = > 45 THEN
IF Percentage < 60 THEN
Write output data
Add 1 to Count
ENDIF
ENDIF
ENDIF
Read next student record
ENDDO
Write Count
Stop
203
42. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 42/44Chapter 11: Planning the Computer ProgramRef Page
Advantages of PseudocodeAdvantages of Pseudocode
§ Converting a pseudocode to a programming language
is much more easier than converting a flowchart to a
programming language
§ As compared to a flowchart, it is easier to modify the
pseudocode of a program logic when program
modifications are necessary
§ Writing of pseudocode involves much less time and
effort than drawing an equivalent flowchart as it has
only a few rules to follow
204
43. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 43/44Chapter 11: Planning the Computer ProgramRef Page
Limitations of PseudocodeLimitations of Pseudocode
§ In case of pseudocode, a graphic representation of
program logic is not available
§ There are no standard rules to follow in using
pseudocode
§ Different programmers use their own style of writing
pseudocode and hence communication problem
occurs due to lack of standardization
§ For a beginner, it is more difficult to follow the logic
of or write pseudocode, as compared to flowcharting
204
44. Computer Fundamentals: Pradeep K. Sinha & Priti SinhaComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Slide 44/44Chapter 11: Planning the Computer ProgramRef Page
Key Words/PhrasesKey Words/Phrases
§ Algorithm
§ Basic logic structures
§ Control structures
§ Flowchart
§ Iteration logic
§ Looping logic
§ Micro flowchart
§ Macro flowchart
§ Pseudocode
§ Program Design Language (PDL)
§ Sequence logic
§ Selection logic
§ Sentinel value
§ Structured programming
§ Trailer record
204