All categories

3 years ago

Describe in detail what each step would look like if you ran into a software error.

Computers and Technology

1 answer:

denis23 [38]3 years ago

7 0

Answer:

First you have to identify the problem.

Second Gather information.

Third iterate through potential solutions.

Fourth Test your solution.

Explanation:

There are many different ways to handle errors in software but this is the way I do it.

Hope this helps :)

You might be interested in

Factors to consider while selecting a software to use

luda_lava [24]

You need to consider what exactly you will be using the software for, there are many different softwares and they all have different purposes.

6 0

2 years ago

A collection of realated files is called a

Thepotemich [5.8K]

The answer to this question would be:

database/records

They all have in common the same files.

4 0

3 years ago

What is microsoft excel

Andrei [34K]

Answer:

A spreadsheet program included in Microsoft Office suit of application. Spreadsheets present tables of value arranged in rows and columns that can be manipulated mathematically using both basic and advanced functions.

6 0

3 years ago

Read 2 more answers

Which of these statements about the truck driving occupation in the U.S. are accurate?

Airida [17]

Answer:

I'm unsure 38373672823

8 0

2 years ago

Read 2 more answers

Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursive (Algorithm 2.1).

damaskus [11]

Answer:

There is also an attachment below

Explanation:

Since we are talking about binary search, let's assume that the items are sorted according to some criteria.

Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.

N = 700000000.

So, number of comparisions can be log(N) = 29.3 = 29.

So, in the worst case it does comparisions 29 times

7 0

3 years ago