Discrete Mathematics Algorithm

969 Words2 Pages

Discrete Mathematics is very much real world Mathematics. In nowadays discrete Mathematics is one of the core components of Mathematics at the undergraduate level. This branch of Mathematics is very useful for people to understand and have a background in Computing Science like algorithms and programming in computing. There is a big question set about the combination of Mathematics and Computing Science. The answer can be withdrawn from the fact that digital computers, referred to hereafter simply as "computers" are discrete machines. This means that the branches of mathematical analysis that depend on mathematics are the distinction between the integers and the real numbers. With this transmission became possible for people to solve differential and other equations numerically. Logic, sets, relations, algorithms and functions are some examples that make Discrete Mathematics interested and show us that this branch of mathematics has got data considered as objects.
Algorithm is a part of discrete mathematics and very useful for the computer science. An algorithm is the ability to carry out the correct steps in the correct order and should always be considered in the context of the certain assumptions. Algorithms of arithmetic, operate with integers which they depend on a digit integer. That was the definition of an algorithm in numerical situation. The connection with the computing science is that in nowadays the algorithms are designed to be used by a machine. So algorithms can be expressed in more languages like natural language , Java, C++. The computer solves a problem by way of a computer program, which as it is mentioned above is a list of orders giving detailed instructions about the action of the computer. Algo...

... middle of paper ...

... way. It is true that people who using computers daily they do not understand these connection between mathematics and computer science. Discrete mathematics is purely numbers for them. Important chapters of discrete mathematic are algorithms, functions, sets and Logic. Algorithms are useful for the programing design and is a basic step for the program operation. From Logic conclude that the line of orders in an algorithm can have different operation with the status “true or false”. Data structures that we can save information in a computer system based on Sets which is a part of discrete mathematics also. Functions can return results to the requesting program and other functions need to make requests of the operating system in order to perform their work in summary. So discrete mathematics is advantageous branch of mathematics which computer science is based on it.

Open Document