All categories

3 years ago

What is runtime error in Python? Provide an example

Computers and Technology

1 answer:

Pepsi [2]3 years ago

7 0

Answer:

If the program is syntactically correct means there are no syntax errors in the program the python interpreter will execute the program.But if the program exits unexpectedly then there exists a run-time error in the python program.

For Example:-

Accessing a list element which does not exists.
divide by 0.
Accessing a file which does not exists.
Performing operation on incompatible types.

For ex:-

my_list=[1,34,7,3,7,8]

print(my_list[6])

This code will produce run-time error.

You might be interested in

Sort short_names in reverse alphabetic order.

tangare [24]

lst = short_names.split()

print(sorted(lst,reverse = True))

6 0

3 years ago

Choose the correct term to complete the sentence.

Alex

Answer:

the answer to your question is obviously "rational"

3 0

3 years ago

Which of these about non-disclosure agreements is accurate?

grandymaker [24]

Answer: number 2

Explanation: number 2

6 0

3 years ago

Read 2 more answers

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

For all of you who listen to podcasts, when do you usually find time to do so?

ss7ja [257]

Morning and afternoon commute times are obvious blocks of time that you can assume are used for listening to podcasts, but the answer will obviously vary widely based on individual habits and schedules.

Hope this helps

7 0

3 years ago