Question 1

Directions: Find the time complexities of the following question.

T(n)=3T(n/4)+c(n²)

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: A

Question 2

Directions: Find the time complexities of the following question.

T(n)=(n - 1)+n

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: A

Question 3

Directions: Find the time complexities of the following question.

T(n)=2T(n/2)+c

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: D

Question 4

Directions: Find the time complexities of the following question.

T(n)= 2T(n/2)+n

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: A

Question 5

Directions: Find the time complexities of the following question.

T(n)=2T(n/2+17)+O(n)

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: A

Question 6

Directions: Find the time complexities of the following question.

T(n)=T(n/3)+T(2n/3)+O(n)

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: B

Question 7

Directions: Find the time complexities of the following question.

T(n)=3T(n/4)+nlogn

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: B

Question 8

Directions: Find the time complexities of the following question.

T(n)=9T(n/3)+n

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: A

Question 9

Directions: Find the time complexities of the following question.

T(n)=T(2n/3)+1

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: D

Question 10

Directions: Find the time complexities of the following question.

T(n)=T(n-1)+1/n

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: D

Question 11

Directions: Find the time complexities of the following question.

T(n)=4T(n/2)+n²√n

O(n²√n)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: A

Question 12

Directions: Find the time complexities of the following question.

T(n)=2T(n/2)+n/logn

O(n²)
O(n log n)
O(n)
O(nloglog n)

Answer

Correct Option: D

Question 13

Directions: Find the time complexities of the following question.

T(n)=T(n/2)+T(n/4)+T(n/8)+n

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: C

Question 14

Directions: Find the time complexities of the following question.

T(n)=3T(n/2)+nlogn

O(n²)
O(n^{log 3})
O(n)
O(log n)

Answer

Correct Option: D

Question 15

Directions: Find the time complexities of the following question.

T(n)=T(n-1)+logn

O(n²)
O(n log n)
O(n)
O(log n)

Answer

Correct Option: B

Question 16

Directions: Find the time complexities of the following question.

T(n)=T(n-2)+2logn

O(n²)
O(n^log3)
O(n)
O(log n)

Answer

Correct Option: B

Question 17

Directions: Find the time complexities of the following question.

T(n)=2T(√n)+logn

O(n²)
O(n^log3)
O(lognloglogn)
O(log n)

Answer

Correct Option: C

Question 18

Directions: Find the time complexities of the following question.

T(n)=2T(n-1)+1

O(n²)
O(n^log3)
O(2ⁿ)
O(log n)

Answer

Correct Option: C

Question 19

The time required by Kruskal's algorithm is _____.

O(|E|log|V|)
O(V^logE)
O(EV)
O(log V)

Answer

Correct Option: A

Question 20

The time required by Prim's algorithm is ______.

O(|V|²)
O(V^logE)
O(EV)
O(log V)

Answer

Correct Option: A

Question 21

Directions: Find the time complexities of the following question.

T(n)=T(n-1)+n+c

O(n²)
O(n^log3)
O(2ⁿ)
O(log n)

Answer

Correct Option: A

Question 22

In Prim's algorithm, it will be reduced to _________ if heap is used to keep.

O(|E|log|V|)
O(V^logE)
O(EV)
O(log V)

Answer

Correct Option: A

Question 23

Directions: Find the time complexities of the following question.

2T(n/2)+n²

O(n²)
O(n^log3)
O(2ⁿ)
O(log n)

Answer

Correct Option: A

Question 24

Directions: Find the time complexities of the following question.

T(n)=T(n/4)+2T(n)+n²

O(n²)
O(n^log3)
O(2ⁿ)
O(log n)

Answer

Correct Option: A

Question 25

Directions: Find the time complexities of the following question.

T(n)=2T(√n)+nlogn+n

Ω(n²)
Ω(n^log3)
Ω(2ⁿ)
None of these

Answer

Correct Option: D

Description: Get Notes and Test Papers for Design and Analysis of Algorithms, Computer Algorithms, Complexity of Algorithms, Hashing, Engineering Exam, DAA, FLAT, Formal Language and Automata Theory
Number of Questions: 25
Created by: Seema Agrawal
Tags: Design and Analysis of Algorithms Computer Algorithms Complexity of Algorithms Hashing Engineering Exam DAA FLAT Formal Language and Automata Theory Flowcharts/Algorithms Fundamentals of Computer Programming Algorithms Letter E Synonyms Antonyms Odd Word Out Classification Verbal Analogy Word Analogy

Analysis of Algorithm

Find more quizzes from top tags