1.An algorithm used to find a value in an array is called a . 2.A search algorithm returns the element that we’re searching for, rather than the index of the element we’re searching for.
A. True
B. False
3.Suppose we used our searching algorithm to look for a specific element in a list. The algorithm returned -1. What does this mean?

A. Our algorithm found the element we were looking for which is -1.
B. Our algorithm did not find the element we were looking for.
C. Our algorithm found the element, but could not determine the index.
D. Our algorithm found the element at index -1.

Font size, font style, and are all aspects of character formatting.

How to do this programming flowchart?

When making changes to optimize part of a processor, it is often the case that speeding up one type of instruction comes at the cost of slowing down something else. for example, if we put in a complicated fast floating-point unit, that takes space, and something might have to be moved farther away from the middle to accommodate it, adding an extra cycle in delay to reach that unit. the basic amdahl's law equation does not take into account this trade-off. a. if the new fast floating-point unit speeds up floating-point operations by, on average, 2ă—, and floating-point operations take 20% of the original program's execution time, what is the overall speedup (ignoring the penalty to any other instructions)? b. now assume that speeding up the floating-point unit slowed down data cache accesses, resulting in a 1.5ă— slowdown (or 2/3 speedup). data cache accesses consume 10% of the execution time. what is the overall speedup now? c. after implementing the new floating-point operations, what percentage of execution time is spent on floating-point operations? what percentage is spent on data cache accesses?