# Introduction to Algorithms & flow charts

Summer Intern at OpenLX Technologies Pvt. Limited (formerly OpenLX Inc.)
22. Aug 2014
1 von 11

### Introduction to Algorithms & flow charts

• 1. ALGORITHMS AND FLOWCHARTS
• 2. ALGORITHMS AND FLOWCHARTS  A typical programming task can be divided into two phases:  Problem solving phase  produce an ordered sequence of steps that describe solution of problem  this sequence of steps is called an algorithm  Implementation phase  implement the program in some programming language
• 3. Steps in Problem Solving  First produce a general algorithm (one can use pseudocode)  Refine the algorithm successively to get step by step detailed algorithm that is very close to a computer language.  Pseudocode is an artificial and informal language that helps programmers develop algorithms. Pseudocode is very similar to everyday English.
• 4. The Flowchart A Flowchart  shows logic of an algorithm  emphasizes individual steps and their interconnections  e.g. control flow from one action to the next
• 5. Flowchart Symbols Basic
• 6. DECISION STRUCTURES  The expression A>B is a logical expression  it describes a condition we want to test  if A>B is true (if A is greater than B) we take the action on left  print the value of A  if A>B is false (if A is not greater than B) we take the action on right  print the value of B
• 7. DECISION STRUCTURES is A>B Print BPrint A Y N
• 8. IF–THEN–ELSE STRUCTURE  The structure is as follows If condition then true alternative else false alternative endif
• 9. IF–THEN–ELSE STRUCTURE  The algorithm for the flowchart is as follows: If A>B then print A else print B endif is A>B Print BPrint A Y N
• 10. Relational Operators Relational Operators Operator Description > Greater than < Less than = Equal to ≥ Greater than or equal to ≤ Less than or equal to ≠ Not equal to
• 11. NESTED IFS  One of the alternatives within an IF–THEN–ELSE statement  may involve further IF–THEN–ELSE statement
The text passage is a set of slides introducing algorithms and flowcharts, covering topics such as problem-solving phases, pseudocode, flowchart symbols, decision structures, and nested IF statements. It does not contain any mathematical questions or answers.
no_question
Given a text passage, determine:
    1. If it contains a mathematical question (including word problems or calculations)
    2. If an answer to that mathematical question is provided in the text

First, describe the content structure you found in 1-2 sentences.

Then provide your analysis in the following format:
TYPE: <one of the following values>
- NO_QUESTION
- SINGLE_QUESTION
- SINGLE_QUESTION_WITH_ANSWER
- MULTIPLE_QUESTIONS
- MULTIPLE_QUESTIONS_WITH_ANSWERS
system
# Introduction to Algorithms & flow charts

Summer Intern at OpenLX Technologies Pvt. Limited (formerly OpenLX Inc.)
22. Aug 2014
1 von 11

### Introduction to Algorithms & flow charts

• 1. ALGORITHMS AND FLOWCHARTS
• 2. ALGORITHMS AND FLOWCHARTS  A typical programming task can be divided into two phases:  Problem solving phase  produce an ordered sequence of steps that describe solution of problem  this sequence of steps is called an algorithm  Implementation phase  implement the program in some programming language
• 3. Steps in Problem Solving  First produce a general algorithm (one can use pseudocode)  Refine the algorithm successively to get step by step detailed algorithm that is very close to a computer language.  Pseudocode is an artificial and informal language that helps programmers develop algorithms. Pseudocode is very similar to everyday English.
• 4. The Flowchart A Flowchart  shows logic of an algorithm  emphasizes individual steps and their interconnections  e.g. control flow from one action to the next
• 5. Flowchart Symbols Basic
• 6. DECISION STRUCTURES  The expression A>B is a logical expression  it describes a condition we want to test  if A>B is true (if A is greater than B) we take the action on left  print the value of A  if A>B is false (if A is not greater than B) we take the action on right  print the value of B
• 7. DECISION STRUCTURES is A>B Print BPrint A Y N
• 8. IF–THEN–ELSE STRUCTURE  The structure is as follows If condition then true alternative else false alternative endif
• 9. IF–THEN–ELSE STRUCTURE  The algorithm for the flowchart is as follows: If A>B then print A else print B endif is A>B Print BPrint A Y N
• 10. Relational Operators Relational Operators Operator Description > Greater than < Less than = Equal to ≥ Greater than or equal to ≤ Less than or equal to ≠ Not equal to
• 11. NESTED IFS  One of the alternatives within an IF–THEN–ELSE statement  may involve further IF–THEN–ELSE statement
user
The text passage is a set of slides introducing algorithms and flowcharts, covering topics such as problem-solving phases, pseudocode, flowchart symbols, decision structures, and nested IF statements. It does not contain any mathematical questions or answers.

TYPE: NO_QUESTION