1) It is possible to email a document directly from the Word application. O FALSE O TRUE

What is the reason that friction is present in surface to surface contact?

Andrej [43]

One surface is larger than the other surface

3 0

3 years ago

. Consider the problem of finding the largest element in a list of n elements. What will be the basic operation of an algorithm

natali 33 [55]

Answer:

Comparison.

Explanation:

When we have to find a largest in a list of n elements.First we have to iterate over the list so we can access all the elements of the list in one go.Then to find the largest element in the list we have to initialize a variable outside the loop with the minimum value possible and in the loop compare each element with this value,if the element is greater than the variable assign the element to the variable.Then the loop will find the largest element and it will be the variable.

4 0

3 years ago

Consider the following algorithms. Each algorithm operates on a list containing n elements, where n is a very large integer.

DochEvi [55]

We have that the appropriate statement will be

An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

From the question we are told

Consider the following algorithms. Each algorithm operates on a list containing n elements, where n is a very large integer.

I. An algorithm that accesses each element in the list twice.

II. An algorithm that accesses each element in the list n times.

III. An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time?

<h3>Algorithm </h3>

Generally In order to get admission to every thing in the list twice, the algorithm has to traverse the listing twice,

which leads to 2*n entry to operations.

And if the every factor is accessed n times, the listing will be traversed n time, which leads to n^2 get right of entry to operations.

If n is a very giant integer, each 2*n and n^2 are plenty larger.

So, there will be solely ten entry to operations and this algorithm will have a sensible jogging time.

Therefore

An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

For more information on algorithm visit

brainly.com/question/950632

4 0

2 years ago

List of bad websites and why

r-ruslan [8.4K]

Penny Juice – bad design examples.

Blinkee website – bad design example.

Great Dreams I — bad designed website.

8 0

2 years ago

The points a b c and d lie on a straight line ab:bd = 1:4

pochemuha

The points a b c and d lie on a straight line ab:bd = 1:4 are A line that extends to infinity on both sides and has no curves is called a straight line.AB:BC=3:4.

<h3>What do you call a straight line? </h3>

A line is simply an object in geometry denoted as an object with no width that extends on both sides. A straight line is just a line with no curves.

AC=AB+BC=3+4=7; AC:CD=2:1, i.e. AC=2; because we get 2 different lengths for AC, we change the given ratio AC:CD to an equivalent one with AC=7 .
As follows: AC:CD = 2 : 1 = 7 : 3.5 (multiply both sides by 3.5 ) Now we have AC:CD = 7 : 3.5 and AD = AC+CD= 7+3.5 = 10.5,, and the answer is: the ratio BC:AD = 4:10.5.