Computer Science Class 11 – Flowcharts & Algorithms
1. Introduction to Algorithms
• An algorithm is a step-by-step procedure to solve a problem or perform a task.
• Algorithms are written in simple English or pseudocode and are independent of
programming languages.
• Example: An algorithm to add two numbers: Step 1: Start. Step 2: Input A, B. Step 3:
Sum = A + B. Step 4: Display Sum. Step 5: Stop.
2. Characteristics of a Good Algorithm
• Finite – It must complete in a limited number of steps.
• Definite – Each step must be clear and unambiguous.
• Input – Should have defined input values.
• Output – Must produce one or more results.
• Effectiveness – Each instruction must be simple enough to be executed.
3. Types of Algorithms
• 1. Sequential Algorithm – Steps executed one after another.
• 2. Conditional Algorithm – Uses decision making (IF...THEN).
• 3. Iterative Algorithm – Repeats steps using loops (WHILE, FOR).
4. What is a Flowchart?
• A flowchart is a graphical representation of an algorithm using symbols to show the
flow of control.
• It visually represents the sequence of operations to solve a problem.
• Flowcharts are widely used in system design and programming.
5. Common Flowchart Symbols
• Oval – Start/Stop symbol represents the beginning or end of a program.
• Parallelogram – Used for input/output operations.
• Rectangle – Represents processing or calculation steps.
• Diamond – Used for decision making (Yes/No).
• Arrow Lines – Show the direction of control flow.
• Connector – Used to connect flowlines from one page or section to another.
6. Rules for Drawing Flowcharts
• Flowcharts should be drawn from top to bottom or left to right.
• Arrows must clearly show the flow of logic.
• Avoid crossing lines wherever possible.
• Use proper symbols and spacing for readability.
• Keep it simple and easy to follow.
7. Example Flowchart 1 – Sum of Two Numbers
• 1. Start
• 2. Input two numbers A and B
• 3. Add A and B → SUM
• 4. Display SUM
• 5. Stop
8. Example Flowchart 2 – Find Largest of Two Numbers
• 1. Start
• 2. Input A and B
• 3. If A > B then print 'A is greater' else print 'B is greater'
• 4. Stop
9. Algorithm vs Flowchart – Comparison
• Algorithm is written in words or pseudocode, Flowchart is drawn using symbols.
• Algorithm focuses on logic, Flowchart focuses on structure.
• Flowchart is easier to understand for beginners.
• Algorithm is useful for coding directly; flowchart helps in visualization.
10. Advantages of Flowcharts
• Provide a clear overview of a process or program logic.
• Help in identifying errors or logical mistakes before coding.
• Useful for documentation and future reference.
• Aid in program debugging and maintenance.
11. Limitations of Flowcharts
• Can become complex for large programs.
• Difficult to modify once completed.
• Time-consuming to draw and maintain.
12. Real-Life Applications
• Used in designing computer programs and algorithms.
• Helps explain processes in industries like banking, education, and healthcare.
• Used in data flow and system analysis diagrams.
13. Tips for Designing Good Algorithms & Flowcharts
• Start with simple examples before complex ones.
• Use meaningful variable names and comments.
• Test your algorithm with different inputs.
• Always validate your output before finalizing.
Summary:
Flowcharts and algorithms form the foundation of programming and problem-solving. They
provide structured, logical, and efficient methods to analyze and represent processes
clearly.
Exam Tips:
• Always practice drawing flowcharts neatly with correct symbols.
• Memorize at least two example algorithms and their flowcharts.
• Understand differences between iterative and conditional algorithms.
• Label all flowchart symbols properly in the exam.
