Which of the following prefixes would be best to use when measuring your own mass?

Which line of code will only allow a symbol to be stored in a variable?

nataly862011 [7]

<h2>Answer:</h2><h2></h2><h2>phone = int(input("What is your phone number?"))</h2><h2></h2><h2>Hope this helps, have a great day, stay safe, and positive!!</h2>

8 0

3 years ago

Read 2 more answers

____ is a linux-based operating system developed by the open handset alliance.

Misha Larkins [42]

The answer is Android

6 0

3 years ago

When you set code inside other code, in an orderly fashion, it is called:

V125BC [204]

Answer:

It is called Nesting

Explanation:

or in this case B

5 0

3 years ago

Think about what you have learned about work ethic. In a paragraph of no less than 125 words, explain why employers prefer to hi

Zepler [3.9K]

An individual who possesses good work ethic embodies principles like reliability, dependability, dedication to the job, teamwork and cooperation, and a self-disciplined character. Most employers seek a strong work ethic; performance depends on it; satisfaction is derived from it; and it ensures career progression. It is that untouchable effort an employee exemplifies daily, regardless of whether someone is watching or not. A company that has its employees doing exemplary well has everything to do with their performance. Thus, if you have a strong work ethic, you will have qualities that will keep you in demand by huge companies. When you are skilled at the workplace and your colleagues notice and appreciate it, you will have a very deep sense of satisfaction within you. If you put 101 percent, your willingness to work hard will be recognized and will leave you shining brightly than others when the opportunity of promotion knocks.

7 0

3 years ago

We have said that the average number of comparisons need to find a target value in an n-element list using sequential search is

bija089 [108]

Answer:

Part a: If the list contains n elements (where n is odd) the middle term is at index (n-1)/2 and the number of comparisons are (n+1)/2.

Part b: If the list contains n elements (where n is even) the middle terms are at index (n-2)/2 & n/2 and the number of comparisons are (n+2)/2.

Part c: The average number of comparisons for a list bearing n elements is 2n+3/4 comparisons.

Explanation:

Suppose the list is such that the starting index is 0.

Part a

If list has 15 elements, the middle item would be given at 7th index i.e.

there are 7 indices(0,1,2,3,4,5,6) below it and 7 indices(8,9,10,11,12,13,14) above it. It will have to run 8 comparisons to find the middle term.

If list has 17 elements, the middle item would be given at 8th index i.e.

there are 8 indices(0,1,2,3,4,5,6,7) below it and 8 indices(9,10,11,12,13,14,15,16) above it.It will have to run 9 comparisons to find the middle term.

If list has 21 elements, the middle item would be given at 10th index i.e.

there are 10 indices (0,1,2,3,4,5,6,7,8,9) below it and 10 indices (11,12,13,14,15,16,17,18,19,20) above it.It will have to run 11 comparisons to find the middle term.

Now this indicates that if the list contains n elements (where n is odd) the middle term is at index (n-1)/2 and the number of comparisons are (n+1)/2.

Part b

If list has 16 elements, there are two middle terms as one at would be at 7th index and the one at 8th index .There are 7 indices(0,1,2,3,4,5,6) below it and 7 indices(9,10,11,12,13,14,15) above it. It will have to run 9 comparisons to find the middle terms.

If list has 18 elements, there are two middle terms as one at would be at 8th index and the one at 9th index .There are 8 indices(0,1,2,3,4,5,6,7) below it and 8 indices(10,11,12,13,14,15,16,17) above it. It will have to run 10 comparisons to find the middle terms.

If list has 20 elements, there are two middle terms as one at would be at 9th index and the one at 10th index .There are 9 indices(0,1,2,3,4,5,6,7,8) below it and 9 indices(11,12,13,14,15,16,17,18,19) above it. It will have to run 11 comparisons to find the middle terms.

Now this indicates that if the list contains n elements (where n is even) the middle terms are at index (n-2)/2 & n/2 and the number of comparisons are (n+2)/2.

Part c

So the average number of comparisons is given as

((n+1)/2+(n+2)/2)/2=(2n+3)/4

So the average number of comparisons for a list bearing n elements is 2n+3/4 comparisons.

6 0

3 years ago