10CS43 Design and Analysis of Algorithm Question Bank-Unit 1
Design and Analysis of Algorithm(10cs43) UNIT 1 INTRODUCTION QUESTION BANK 1.What is algorithm? What are properties of Algorithm? 2.If f 1 (n)€O(g 1 (n)) and If f 2 (n)€O(g 2 (n)) prove that f 1 (n)+ f 2 (n) €O(max{g 1 (n),g 2 (n)}) 4.Explain briefly various Asymptotic Notation? 5. Design a recursive Algorithm for solving Tower of Hanoi problem and give general plan of analyzing that algorithm. Show that time complexity of tower of Hanoi algorithm is exponential in nature. 6.Write an algorithm for computing GCD. a)Using Euclid Algorithm. b)Repetitive subtraction c) Consecutive Integer Checking 7.Explain the Sieve of Eratosthenes Alogrithm to generate prime factor? 8.Write general plans for non recursive algorithm for analyzing time efficiency?Explain with algorithm Element Uniqueness problem.Show that time efficiency is Quadratic in nature. 9.Explain non recursive algorithm to find Maximum of n-elements .Also provid