Design and Analysis of Algorithms - Cycle Test 2

CYCLE TEST - 2
Design and Analysis of Algorithms

1. Write the general paln for analysing the efficiency for recusive algorithms
2. Write a non-recurcive algorithm for finding the number of Binary digits for a positive decimal integer.
3. Define Brute Force approach? Give any two advantages of Brute force technique
4. Mention the non-recurcive algorithm for matrix multiplication?
5. Whaat is the difference between quicksort and mergesort?

6. Write an algorithm for a given numbers 'n' to generate the 'n'th  number of Fibonacci sequence.
7. (a) Design a recurcive algorithm for computing 2^n for any non-negative integer 'n' which is based on formula 2^n = 2^n-1 + 2^n-1
   (b) Settup a recurrence relation for the Towers of Hanoi puzzle and solve it.
8. Write a Brute force algorithm for String matching in a given text
9. What is the general plan for Divide and Conquer technique and explain the quicksort algorithm using this technique
10. Write the general paln for analyzing the efficiency of non-recurcive algorithms and illustrate it with an algorithm od element uniqueness problem
11. (a) Design a brute force algorithm for computing the bubbel sort
    (b) Sort the list E,X,A,M,P,L,E in alphabetical order by bubble sort

Tags : cycle test, cycle test 2, 2012, algorithm, Design and Analysis of Algorithm, sem 4