What is an algorithm?

• A programming language

• A sequence of instructions for solving a problem

• A type of computer hardware

• A data structure

Which of the following is a method of algorithm analysis?

• Sorting algorithms

• Programming languages

• Space efficiency

• Data structures

What does the term 'Brute Force' refer to in algorithms?

• A method that uses random guessing

• A method that uses exhaustive search

• A method that uses recursion

• A method that uses dynamic programming

Which algorithm is an example of 'Divide and Conquer'?

• Sequential Search

• Insertion Sort

• Binary search

• Bubble Sort

What is the purpose of asymptotic notations?

• To create flowcharts

• To compare programming languages

• To describe the efficiency of an algorithm

• To write algorithms in pseudocode

Which of the following is a characteristic of an algorithm?

• It must be complex

• It must have a clear and unambiguous definition

• It must be written in a programming language

• It must be long

What is the worst-case time complexity of a linear search?

• O(log n)

• O(n)

• O(1)

• O(n^2)

Which of the following case does not exist in complexity theory?

• best case

• worst case

• middle case

• average case

If an algorithms complexity is given by O(1) then its complexity is given by______

• Linear

• constant

• exponential

• one

father of algorithm is_______

• Dennis ritchie

• al-Khwarizmi

• Archimedes

• Guido van Rossum