Name: Olaniran Semilore Peter

Matric No: CSC/2019/156

Question 1

1. Numerical computation, also known as scientific computing or computational

mathematics, is the field of study concerned with developing and applying computer
algorithms and software to solve mathematical problems
2. Data can be defined as a collection of discrete or continuous values that represent
quantities or measurements of interest. These values can be used as input to numerical
algorithms, or they can be the output of such algorithms.
3. Algorithm can be defined as a finite sequence of well-defined instructions that perform
a specific numerical task. These instructions can involve basic mathematical operations,
logical comparisons, and branching statements
4. Process refers to the execution of an algorithm on a computer to solve a specific
problem
5. A polynomial is an expression formed by combining constants and variables using the
operations of addition, subtraction, and multiplication. Each variable in the expression is
raised to non-negative integer powers
6. Accuracy refers to the closeness of a computed result to the true value. It is a crucial
measure of the quality and reliability of numerical methods and algorithms

Question 2

1. Identity:

 Law: For any number a, a + 0 = a and a * 1 = a.

 Violation: In numerical computations, due to rounding errors, adding or multiplying by a small
number may not be equivalent to the original number. For example, adding 0.000001 to 1.0
may not result in 1.0 exactly, but rather 1.00000099999.

2. Reflexivity:

 Law: For any number a, a = a.

 Violation: In numerical comparisons, due to limited precision, comparing a number to itself may
not always be true. For example, comparing 0.1 with 0.100000000000001 may not result in
equality, even though they represent the same value.
 3. Transmissivity:

 Law: If a = b and b = c, then a = c.

 Violation: In numerical computations, due to error propagation, transitive relationships may not
hold true. For example, if a = b + e1 and b = c + e2 (where e1 and e2 are small errors), then a ≠
c.

Question 3

Imagine you want to model the motion of a ball thrown upwards. This scenario involves several
key concepts:

1. Function:

In this case, the function represents the relationship between the ball's height and time. We
can write this as h(t), where h is the height (the dependent variable) and t is the time (the
independent variable). This function might take the form of a parabolic equation representing
the ball's trajectory.

2. Equation:

The equation specifically defines this relationship. For example, it could be h(t) = -4.9t^2 + 20t,
where -4.9 represents the acceleration due to gravity and 20 represents the initial upward
velocity. This equation tells us how the height changes with respect to time.

3. Parameter:

The parameters in this equation are the coefficients -4.9 and 20. These values determine the
specific shape and behavior of the parabolic function. They can be adjusted to represent
different initial conditions, such as throwing the ball with a different velocity or at a different
angle.

4. Constant:

Here, a constant could be the acceleration due to gravity (-4.9). This value is fixed and doesn't
change during the computation. It reflects a physical property that affects the ball's motion.

5. Variable:
 The variables are the height (h) and time (t). They can change depending on the specific
scenario and are used as inputs to the function and in the equation. We can calculate the height
at any given time by plugging the time value into the equation.

Relationship between these concepts:

 Function and Equation: The function describes the general relationship between the
variables, while the equation specifies the exact mathematical formula for that relationship. It's
like saying "what" and "how."
 Parameter and Constant: Parameters are like levers that allow us to adjust the function to
represent different situations. Constants are fixed values that have specific meaning within the
context of the problem.
 Variable and Function: Variables are the input and output of the function. We can change the
values of the variables and observe how the function's output changes accordingly

Question 4

Identifier Data Data Data Collection Program ID

description kind type instrument
CPU Usage Percentage of variable Real Operating Cpu. Usg.
processor system
resources utilized
by a process or
system

Memory Usage Amount of variable integer Task manager Mem Usg.

RAM currently
being used by
running
applications and
processes.
File Size The amount of constant integer Task manager Fil sz
storage space a
 file occupies.
Network The rate at variable real Web-based tool Netwk Bdwt.
Bandwidth which data can
be transferred
over a network
connection.

Progra Status precision Max Min Unit Admittable

m ID operation

Cpu. compulsory 0.1 9.1 0.5 Ghz

Usg.

Mem compulsory 99.9 64 2 Gb

Usg.

Fil sz. optional 11.11 1000 1 Mb

Netwk optional 1.1 100 1 Mbps

Bdwt.

Question 5
Algorithm for Problem Solution based on System Resources

Input:

 CPU Usage: Percentage of CPU utilization.

 Memory Usage: Percentage of memory utilization.
 File Size: Size of the relevant file(s) in bytes.
 Network Bandwidth: Bandwidth consumed in bytes/second.
 Output:

 Solution: A textual description of the most likely problem causing the system resource usage.

Algorithm:

1. Analyze CPU Usage:

o High CPU Usage:

 Check for single process dominating usage:
 Identify the process and its function.
 If process is a known system process or application, check for unusual activity or high resource
demands.
 If process is unknown, investigate further to identify its origin and purpose.
 Check for multiple processes sharing high usage:
 Analyze the processes and their functions.
 Identify potential bottlenecks or resource conflicts.
 Check for background processes or hidden programs.
o Normal CPU Usage:
 Analyze the recent system activity and applications used.
 Identify potential causes of increased CPU usage, even if within normal range.
2. Analyze Memory Usage:

o High Memory Usage:

 Check for memory leaks in applications.
 Identify processes with high memory allocations.
 Investigate potential memory corruption or fragmentation.
o Normal Memory Usage:
 Analyze the recent memory usage patterns and potential causes of increased usage.
3. Analyze File Size:

o Large File Size:

 Identify the file and its purpose.
 Investigate the need for such a large file.
 Consider compression, archiving, or alternative storage options.
o Normal File Size:
 Analyze the file size in relation to its purpose and usage.
4. Analyze Network Bandwidth:

o High Network Bandwidth:

 Identify the applications using the network.
 Check for unusual network activity or potential malware.
 Investigate potential bottlenecks in the network infrastructure.
 Consider throttling or limiting network usage for specific applications.
o Normal Network Bandwidth:
 Analyze the recent network usage patterns and potential causes of increased usage.
5. Combine Analysis:

o Integrate the findings from each resource analysis.

o Identify correlations and patterns between the resource usage metrics.
o Analyze the overall system activity and resource consumption.
6. Formulate Solution:

o Based on the combined analysis, form a conclusion about the most likely problem causing the
high resource usage.
o Prioritize the potential causes based on their severity and impact.
o Suggest potential solutions to address the identified problem(s).

Question 6

Solvable Computable Problem:

This refers to a problem for which an algorithm exists that can always find the correct solution
in a finite amount of time. These problems can be solved by computers using algorithms with
well-defined steps and guaranteed termination.

Example:
 Finding the roots of a polynomial equation: This problem can be solved using various algorithms
like Newton's method or Bisection method. These algorithms will eventually converge to the
correct root(s) with a certain degree of accuracy.

Unsolvable Computable Problem:

This refers to a problem for which no algorithm can always find the correct solution in a finite
amount of time. These problems are fundamentally difficult and cannot be efficiently solved by
computers using any known algorithm.

Example:

 The Traveling Salesman Problem: This problem seeks the shortest possible route that visits
every city exactly once and returns to the starting city. For large numbers of cities, finding the
optimal solution becomes computationally intractable.

Distinguishing Features:

 Solvable problems have guaranteed solutions within a finite time, while unsolvable problems
lack such guarantees.
 Solvable problems often have multiple algorithms that can achieve the solution, while
unsolvable problems may have no known algorithm at all.
 Solvable problems often involve finding a specific value or state, while unsolvable problems
may involve finding all possible solutions or exploring an infinite search space.