Hi!
Our computers will have system software and application software. Application software would be something like a game or just any general purpose app you've downloaded.
Hopefully, this helps! =)
Answer:
Answered below
Explanation:
class TestScores {
double test1;
double test2;
double test 3;
public TestScores (double test1, double test2, double teat3){
this.test1= test1;
this.test2 = test2;
this.test3 = teat3;}
//mutator
public setTest1(double test1){
this.test1 = test1;
}
//accessor
public double getTest1(){
return test 1;
}
//Write same accessors and mutators for test2 and test3
public double getTestAverage(){
double sum = test1+test2+test3;
return sum / 3;
}
}
class TestRun{
public static void main (String [] args){
TestScores scores = new TestScores(50.5, 40.0, 80.7)
int average = scores.getTestAverage();
System.out.print(average);
}
Cutting down trees for paper
Answer:
true
Explanation:
because it needs a interpreter so that it could be more developed
Answer:
import sys
import turtle
import random
def n_pointed_star(total_points):
if total_points <= 4:
raise ValueError('Not enough total_points')
area = 150
for coprime in range(total_points//2, 1, -1):
if greatest_common_divisor(total_points, coprime) == 1:
start = turtle.position()
for _ in range(total_points):
turtle.forward(area)
turtle.left(360.0 / total_points * coprime)
turtle.setposition(start)
return
def greatest_common_divisor(a, b):
while b != 0:
a, b = b, a % b
return a
turtle.reset()
n_pointed_star(5)
Explanation:
- Inside the n_pointed_star function, check whether the total no. of points are less than or equal to 4 and then throw an exception.
- Loop through the total_points variable and check whether the result from greatest_common_divisor is equal to 1 or not and then set the starting position of turtle and move it.
- Create the greatest_common_divisor which takes two parameters a and b to find the GCD.
- Finally reset the turtle and call the n_pointed_star function.
