### 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 |

** Directions:** Find the time complexities of the following question.

T(n)=3T(n/4)+c(n^{2})

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

T(n)=4T(n/2)+n^{2}√n

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

** Directions:** Find the time complexities of the following question.

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

The time required by Kruskal's algorithm is _____.

The time required by Prim's algorithm is ______.

** Directions:** Find the time complexities of the following question.

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

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

** Directions:** Find the time complexities of the following question.

2T(n/2)+n^{2}

** Directions:** Find the time complexities of the following question.

T(n)=T(n/4)+2T(n)+n^{2}

** Directions:** Find the time complexities of the following question.

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