DAA_QUIZ1

Question 1

O(1) means computing time is ___________________

Accepted Answer

Constant

Question 2

An algorithm is __________?

Accepted Answer

A Procedure for solving a problem

Question 3

What is the purpose of asymptotic notation in algorithm analysis?

Accepted Answer

To simplify the comparison of algorithms based on their growth rates

Question 4

Which of the following is a Divide and Conquer algorithm?

Accepted Answer

Merge Sort

Question 5

Which of the following is incorrect? Algorithms can be represented:

Accepted Answer

As Syntax

Question 6

The time factor when determining the efficiency of algorithm is measured by

Accepted Answer

Counting the number of Key Operations

Question 7

Which of the following properties are necessary for an Algorithm?

Accepted Answer

A & C

Question 8

Sorting is not possible by using which of the following methods?

Accepted Answer

Deletion

Question 9

Identify the slowest sorting technique among the following?

Accepted Answer

Bubble Sort

Question 10

What should be considered when designing an algorithm?

Accepted Answer

If there is more than one way to solve the problem

Question 11

__________ is the minimum number of steps that can executed for the given parameters

Accepted Answer

Best Case

Question 12

O(n) means computing time is

Accepted Answer

Linear

Question 13

What is the worst-case time complexity of quick sort?

Accepted Answer

O(n^2)

Question 14

What is the time complexity of the binary search algorithm?O(n)O(1)O(log2n)O(n^2)

Accepted Answer

O(logn)

Question 15

What is the maximum number of swaps that can be performed in the Selection Sort algorithm?

Accepted Answer

n-1

Questions 15