 ### Analysis of Algorithm

 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
Attempted 0/25 Correct 0 Score 0

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: D

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: B

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: B

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: D

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: D

Directions: Find the time complexities of the following question.

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

1. O(n2√n)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(nloglog n)

Correct Option: D

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: C

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(nlog 3)

3. O(n)

4. O(log n)

Correct Option: D

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(n log n)

3. O(n)

4. O(log n)

Correct Option: B

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(nlog3)

3. O(n)

4. O(log n)

Correct Option: B

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(nlog3)

3. O(lognloglogn)

4. O(log n)

Correct Option: C

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(nlog3)

3. O(2n)

4. O(log n)

Correct Option: C

The time required by Kruskal's algorithm is _____.

1. O(|E|log|V|)

2. O(VlogE)

3. O(EV)

4. O(log V)

Correct Option: A

The time required by Prim's algorithm is ______.

1. O(|V|2)

2. O(VlogE)

3. O(EV)

4. O(log V)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(nlog3)

3. O(2n)

4. O(log n)

Correct Option: A

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

1. O(|E|log|V|)

2. O(VlogE)

3. O(EV)

4. O(log V)

Correct Option: A

Directions: Find the time complexities of the following question.

2T(n/2)+n2

1. O(n2)

2. O(nlog3)

3. O(2n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. O(n2)

2. O(nlog3)

3. O(2n)

4. O(log n)

Correct Option: A

Directions: Find the time complexities of the following question.

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

1. Ω(n2)

2. Ω(nlog3)

3. Ω(2n)

4. None of these

Correct Option: D
- Hide questions