ADSA_Unit-1_ Quiz-1

Which of the following is NOT a characteristic of a good algorithm?

• Finiteness

• Effectiveness

• Ambiguity

• Feasibility

Which of these is not part of space complexity?

• Input space

• Auxiliary space

• Compilation space

• Output space

In the algorithm analysis, T(p)=C(p)+R(p) refers to:

• Space complexity formula

• Time complexity formula

• Recursion time

• None of the above

The purpose of using algorithms is:

• To reduce memory

• To avoid errors

• To get output efficiently

• To avoid recursion

What is the main difference between data and information?

• Information is raw, data is processed

• Data is raw, information is processed

• Both are same

• Information is random

Which of the following is used for time complexity analysis?

• Memory graph

• Time graph

• Asymptotic notations

• Control flow graph

In the algorithm syntax, the keyword used to start an algorithm is:

• procedure

• start

• Algorithm

• function

Which of the following operations does not affect space complexity much?

• Recursion

• Variable declarations

• Input storage

• Loop iterations

Which notation gives the worst-case performance of an algorithm?

• Θ(n)

• Ω(n)

• O(n)

• o(n)

Which of the following notations gives both upper and lower bounds?

• O(n)

• Ω(n)

• Θ(n)

• ω(n)