COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.
|
|
|
Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.
|
|
|
the time used to complete a task sequentially divided by the time to complete a task in parallel
|
|
|
a measure of how many steps are needed to complete an algorithm
|
Detailed explanation-1: -Efficiency: a measure of how many steps are needed to complete an algorithm. Linear Search: a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.
Detailed explanation-2: -Time and space complexity are the two main measures for calculating algorithm efficiency, determining how many resources are needed on a machine to process it. Where time measures how long it takes to process the algorithm, space measures how much memory is used.
Detailed explanation-3: -Step 1: Obtain a description of the problem. Step 2: Analyze the problem. Step 3: Develop a high-level algorithm. Step 4: Refine the algorithm by adding more detail.
Detailed explanation-4: -There are two main measures for the efficiency of an algorithm. The complexity of an algorithm is divided into two types: Time complexity. Space complexity.