Analysis of Algorithms

Question 1

An ___ is defined as a set of well-defined instructions used to accomplish a particular task.

• Algorithm

• Function

• Program

• Procedure

Question 2

___ of an algorithm is the amount of time required for it to execute.

• Time complexity

• Space complexity

• Compiling time

• Best case
  

Question 3

___ is the maximum amount of time an algorithm takes to execute a specific set of inputs.

• Running time

• Average case time complexity

• Worst case time complexity

• Best case time complexity
  

Question 4

___ within the limit deals with the behavior of a function for sufficiently large values of its parameter.

• Asymptotic notation

• Big-Oh notation

•  Omega notation

• Theta notation

Question 5

Which one of the following helps in calculating the longest amount of time taken for the completion of the algorithm?

• Theta notation

• Big-Oh notation

•  Omega notation

• Time complexity