Algorithm & Flowchart ((Table of contents)

1. Introduction to Algorithm

• 1.1 Advantages of Algorithms
• 1.2 Steps for Problem Solving

2. Introduction to Flowcharts

3. Flowchart Symbols

• 3.1 Terminal (Start/Stop)

• 3.2 Input/Output Symbol

• 3.3  Process Symbol

• 3.4 Decision Symbol

• 3.5 Flow Line / Arrow

• 3.6 Connector Symbol

• 3.7 Predefined Process Symbol

4. Basic Algorithm Structures

• 4.1 Sequential Processing

• 4.2 Decision-Based Processing

• 4.3 Iterative / Loop Processing

5. Algorithms and Flowcharts – Solved Examples

• 5.1 Exchange Values of Two Variables

• 5.2 Summation of a Set of Numbers

• 5.3 Decimal to Binary Conversion

• 5.4 Reverse Digits of an Integer

• 5.5 GCD (Greatest Common Divisor) of Two Numbers

• 5.6 Test Whether a Number is Prime

• 5.7 Factorial of a Number

• 5.8 Fibonacci Sequence Generation

• 5.9 Evaluate sin x Using Series Expansion

6. Array Processing Algorithms

• 6.1 Reverse Order of Elements of an Array

• 6.2 Find the Largest Number in an Array

• 6.3 Find the Smallest Number in an Array

• 6.4 Sum of Elements of an Array

• 6.5 Search an Element in an Array

7. Matrix Processing Algorithms

• 7.1 Print Upper Triangular Matrix

• 7.2 Print Lower Triangular Matrix

• 7.3 Sum of Diagonal Elements

• 7.4 Matrix Addition

• 7.5 Matrix Multiplication

8. Practice Problems

• 8.1 Check Even or Odd

• 8.2 Find Sum of Digits

• 8.3 Check Palindrome Number

• 8.4 Generate Multiplication Table

• 8.5 Count Digits of a Number