Name:

Class:

Sec:

Roll No:

Submitted to:

Submitted By:

UCP(UNIVERSITY OF CENTRAL

PUNJAB)
 Application of Computer Science in Mathematics

Computer science is a vast degree which touches many other disciplines such as

operating systems, architecture, programming, encryption and many more. These

disciplines are interrelated. Mathematics is considered as the heart of these

disciplines and makes the foundation of majority of the algorithms in different

areas. Computer science comes from the study of the foundations of mathematics.

Whether practical or theoretical, CS is the applied mathematics.

Computer science is the evolved branch of mathematics that provides the

foundation for all the magnificent achievements of human discovery, exploration,

progress and prosperity that have radically transformed our quality of life and

understanding of our universe in mere decades. Whatever the future holds for us,

whatever human endeavors await to be undertaken, you can bet computer science

will continue to play at center stage

Figure 1.1 Venn diagram showing relation between mathematics and CS

Mathematics is a complex discipline which involves many sophisticated

calculation and theoretical theories which requires complex and critical analysis.

These calculations may take many hours and sometimes days. There is also a

chance of human errors, which can cause alterations in the calculations and the

resulting answers are incorrect. This causes a waste of time and energy of the

person doing those calculations. This delay and loss of time can be prevented by

means of computer science. By the help of computer science the complex

calculations can be solved within seconds and it also eliminates the human error

factor, as we know that computers do not make mistakes and the results are fast

and correct.

Figure 1.2: Comparison between Mathematics and CS

First off, linear algebra. You really can't do intensive mathematics without this. A

lot of optimization also requires this. It's difficult to do much systems analysis

without it.

Next, formal logic. This often starts with abstract data types, goes through

grammars, abstract state machines and ends up with lambda calculus or pi calculus.

If Z Notation, Higher Order Logic or Petri Nets are covered, they'll be in here

somewhere. A1-class operating systems need formal proofs, vehicular software

(such as self-driving cars and aircraft autopilots) don't but I wouldn't trust such

software further than I could spit the printout if formal methods haven't been used

in some form.

Abstract data types covered in formal logic are your basic ones - stacks, queues,

trees and graphs. Most people will have covered these at previous levels, but here

they're defined with greater rigour and greater abstraction than is typical in high

school/sixth form. They also become more of a means to teach things like lambda

calculus or first order logic than an end in themselves.