# IT THEORY FUNDAMENTAL

DISCUSSION.
Software testing provides stakeholders with information about the quality of a product or service. It employs various techniques with the intent to identify failures during, before, and after software deployment.
As in mathematics, it might become necessary to test the logic of a program to make sure it is producing the correct results. For example, if I write a program that takes four variables (Integer One, Integer two, Integer three, and integer four) and calculates an output variable (resultOut), using the formula: resultOut=integerOne+ (IntegerTwo*IntegerThree)-integerFour. Assuming I input the values 2, 3, 4, and 5, and the value out computes to 9, instead of 15, then it means there is a logic error in my program. I will need to test the logic of my program. In other words, I will need to prove why the answer should be 15, not 9. Proofs are not only useful in mathematics but also in computer science. Their application in computer science includes error-checking programs, demonstrating that the operating system is secured, and making sure specifications are followed (Rosen, K. H., 2011). An example of a proof method is proof by induction. Proof by induction consists of steps that must be justified. It is used to show that all elements in an infinite set have a certain property. For example, to prove that 1+2+3+…..+p=p (p+1)/2, we need to take two steps, the first step is the basis and the second step is the inductive step. Similarly, in software testing, we need to test individual parts of the software. When we take a random piece of code, it should match a required test case. All units have to be tested based on individual models to make sure each functionality is working properly.

Need assignment help for this question?