_________ efficiency deals with a sequence of operations on the same data structure instead of single operationQuestion 1Answera.Average caseb.Amortizedc.Best cased.Worst case

Amortized analysis considers the cost of a ________ operation(s).Group of answer choicessequence ofsingle

Suppose that we have an ordered array and we want to do the binary search on it. If we know that the best-case efficiency is 1 comparison, and the worst-case efficiency is 11 comparisons, can we say that the average-case efficiency is 6 comparisons (from (1 + 11)/2)?Group of answer choicesyesno

For an algorithm the complexity of the average case isA Much more complicated to analyze than that of worst case.B Much more simpler to analyze than that of worst caseC Sometimes more complicated and some other times simpler than that of worst caseD None or above

Explain: Worst Case, Best Case and Average Case Complexitywith suitable example.

Two main measures for the efficiency of an algorithm areQuestion 8Answera.Data and spaceb.Time and spacec.Processor and memoryd.Complexity and capacity