Algorithmic Efficiency (Textbook MCQs)

An algorithm should be

• Definite

• Unambiguous

• Both

• None of these

In which of the following algorithms, an input argument may not be required?

• Linear Search

• Binary Search

• Pseudo Random Generator

• None of these

Which of the following is more efficient, if the input list is sorted?

• Linear Search

• Binary Search

• Both are equally efficient

• Depends on the input constraints

Which of the following would not work if the input array is not sorted?

• Linear Search

• Binary Search

• Both

• None of these

In a recursive algorithm

• The function needs to be expressed in terms of itself

• The base case must be satisfied

• Both of the above

• None of the above

Generally, which of the following has more time complexity?

• Recursive algorithm

• Iterative algorithm

• Both

• None of these

Which of the following represents the upper bound?

• Big Oh notation

• Omega notation

• Theta notation

• None of these

If an algorithm is O(n²) then it is not

• O(n)

• O(n³)

• O(2ⁿ)

• All of these

If an algorithm is O(n) then it is

• O(n²)

• O(n³)

• O(2ⁿ)

• All of these

Who was the brain behind the famous page rank algorithm?

• Larry Page

• Alan Turing

• Trump

• None of these