In this blog, we are going to learn about mathematical notation and functions in Data Structures.

Mathematical Notations and Functions:

• Floor and Ceiling
• Remainder Function
• Integer and Absolute Value
• Summation Symbol
• Factorial Function
• Permutations
• Exponents and Logarithms:

Algorithmic Notations:

Finite step by step list of well-defined instructions for solving a particular problem.
Formal presentation of the Algorithm consists of two parts:

1. A paragraph that tells the purpose of an algorithm. Identifies the variables which occur in the algorithm and lists the input data.
2. The list of the steps that is to be executed. Some conventions used in Algorithms:
3. Identifying Number (Algorithm 2: ).
4. Steps, Control and Exit ( All statements are numbered, Go to and Exit).
5. Comments (The comments are to be given to understand the meaning).
6. Variable Names (capital letters are used for variable names).
7. Assignment Statement (Max:=DATA[1])
8. Input and output (Read: variable names, Write: Messages and/or variable names)
9. Procedure.

Control Structures:

1. Sequential Logic or Sequential Flow

2. Selection Logic or Conditional Flow

   • If (condition) Endif
   • If (condition) Else Endif
   • Multiple If Elseif Else Endif

3. Iteration Logic (Repetitive Flow)

   • Repeat for K=R to S by T:
   • [Module]
   • [End of Loop]