Answer:
1. A browser is used to access websites and web pages whereas a search engine is used to search for particular information.
2. Indexing is the process by which search engines organise information before a search to enable super-fast responses to queries.
3.Search engines are used to find specialized data rapidly whereas web directory is used to find a list of different sites.
4. The working behind the PageRank algorithm is that a page with a large number of in- links(a link from an important page) to it, then its outgoing links to other pages also become important. It gives more importance to back links of a web page and propagates the ranking through links.
5. Look for Sites from Established Institutions 2. Look for Sites with Expertise 3. Steer Clear of Commercial Sites 4. Beware of Bias 5. Check the Date 6. Consider the Site's Look 7. Avoid Anonymous Authors 8. Check the Links
Explanation:
Answer:
roadside
Explanation:
Novice drivers lack the experience necessary to reliably categorize and appropriately respond to roadside hazards. A roadside hazard refers to any roadside objects or features that have a diameter greater than 100mm that is on or near the roadway. These are objects or features that are likely to create a dangerous environment to the drivers.
Answer:
Reorganize the network into smaller groups and connect each group to a router.
Explanation:
The user presently has 15 switches linked to another switch, with such an avg of 20 locations. The switches are linked to each other in such a manner that almost all systems can convey within a single Local area network. The high percentage to broadcast frames were found on that Local area network. They believe the amount of broadcasts could affect throughput.
So, they would reorganize each network into smaller units and link to such a router for each unit.
Answer:
public class Calculator {
private int total;
private int value;
public Calculator(int startingValue){
// no need to create a new total variable here, we need to set to the our instance total variable
total = startingValue;
value = 0;
}
public int add(int value){
//same here, no need to create a new total variable. We need to add the value to the instance total variable
total = total + value;
return total;
}
/**
* Adds the instance variable value to the total
*/
public int add(){
// no need to create a new total variable. We need to add the value to the instance total variable
total += value;
return total;
}
public int multiple(int value){
// no need to create a new total variable. We need to multiply the instance total variable by value.
total *= value;
return total;
}
//We need to specify which value refers to which variable. Otherwise, there will be confusion. Since you declare the parameter as value, you need to put this keyword before the instance variable so that it will be distinguishable by the compiler.
public void setValue(int value){
this.value = value;
}
public int getValue(){
return value;
}
}
Explanation:
I fixed the errors. You may see them as comments in the code
Answer:
b. selection sort
b. 8 11 17 30 20 25
Explanation:
The options above are the correct answers to the given questions.
Selection sort is a simple comparison-based sorting algorithm.
selection sort. (algorithm) Definition: A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²), where n is the number of elements. The number of swaps is O(n).
It is this sorting algorithm that will best ne suitable in the given event.
