Answer:
E. Genetic algorithms
Explanation:
In Computer science, Genetic algorithms are model building techniques where computers examine many potential solutions to a problem, iteratively modifying various mathematical models, and comparing the mutated models to search for a best alternative.
Answer:
approximately 5 lbs but no sure weight.
Answer:
See Explaination
Explanation:
package testscores;
import java.util.ArrayList;
import java.util.List;
public class TestScores {
public List<Integer> scorearray=new ArrayList<>();
public TestScores(List<Integer> scores) throws InvalidTestScore{
this.scorearray=scores;
for(int i=0;i<scorearray.size();i++){
if(scorearray.get(i)>100 || scorearray.get(i)<0){
throw new InvalidTestScore(this.scorearray.get(i));
}
}
}
public double average(){
int tot=0;
for(int i=0;i<this.scorearray.size();i++){
tot=tot+this.scorearray.get(i);
}
return tot*(1.0)/(this.scorearray.size());
}
class InvalidTestScore extends Exception
{
private double amount;
public InvalidTestScore(int Score)
{
System.out.println("Invalid Score "+Score);
}
}
}
Answer:A in the home tab then styles group
Explanation:
Answer:
Assembly Language
Explanation:
Machine dependent is a language that only runs on specific machines. The early languages were machine-dependent while the advanced languages are machine-independent.
In the early languages, the main machine dependent language was machine language. Later on, Assembly language was introduced. Assembly language was also machine-dependent as it only runs on specific kinds of PCs.
