PERMUTATION, COMBINATION AND SETS

PERMUTAIONS.

A permutation is a mathematical technique that determines the number of possible arrangements in a set when the order of the arrangements matters. Common mathematical problems involve choosing only several items from a set of items in a certain order.

The following are the applications of permutation.

Analyzing and sorting algorithms which is the set of rules followed in calculator or other problem solving operations, especially by computers.

d     COMBINATION

This is the selection of numbers of a given elements taken one by one or some or all at a time. Mathematics technique that determines the number of possible arrangements in a collection of items which the order doesn’t matter.

The applications of combinations are;

Communication network which is a network of computers globally or locally connected together.

e    SETS.

Is a collections of data or objects represented using curly brackets. In computer science it’s an abstract data type that can be stored without any particular order.

The following are the applications of sets in information technology

1.      Data structures.

2.      Class-based object-oriented systems.

3.      Machine learning.

4.      Databases.

5.      Pattern matching, and by extension.

6.      Compliers.