Problem Mapping - C

1. Understanding the problem

2. Analyzing the problem

3. Developing the solution

4. Coding and implementation.

A set of sequential
steps usually written
in Ordinary Language
to solve a given
problem is called
Algorithm.
1. Identification of input
2. Identification of output
3. Identification of the
processing operations
4. Processing Definiteness
5. Processing Finiteness
6. Possessing Effectiveness
 Pseudocode
Suppose we want to find the average of three numbers, the
algorithm is as follows:
Step 1 : Read the numbers a, b, c
Step 2 : Compute the sum of a, b and c
Step 3 : Divide the sum by 3
Step 4 : Store the result in variable d
Step 5 : Print the value of d
Step 6 : End of the program
Flow Chart
Oval
Input and output indicators

Process Indicators Decision Makers

Flow Lines On- Page connectors

Off-page connectors
Top down approach and stepwise refinement
Machine language

Assembly language

High level languages

Assemblers

Compilers

Interpreters
Assemblers
Compilers
Machine Code :
0000 = 0 0101 = 5
0001 = 1 0110 = 6
0010 = 2 0111 = 7
0011 = 3 1000 = 8
0100 = 4 1001 = 9
Micro controller
Interpreters:

https://techdifferences.com/difference-between-compiler-and-assembler.html