#DATA ANALYSIS AND ALGORITHM #Unit 1 1. what is algorithm ? Why there is a need of analysis of algorithms? Discuss types of complexity. 2. Discuss the stratergy of composisons of algorithm? 3.write a note on arate of growth or write a note on asymptomatic analysis? 4. List the characteristics of algorithm and discuss asymptotic analysis? 5. what is computability illustrating running time or no of steps of execution with example.? 6. What is data structure? What are different types of data structure illustrate with example?7. Write a note on 1-d and 2-d array. 8. Write a note on stack data-structure and write a note on list data-structure (operations, advantages, disadvantages, applications) 9. Write detailed application of stack? 10. Calculate the time complexity for following code program? #Unit 2 1. diff. Between recursion and iteration 2.what is recursion and its application W.r.t. follow a) phibonaci series, b) factorial of number 3. note on tower of hanoy problem?4. What is sorting?, explain bubble sort with example? Ch ee selection sort? One insertion sort? 7. Compare and contrast performance analysis of diff. Sorting techniques? 8. What is searching techniques?, explain linear search? oe Binary search? 10. Compare and contrast linear search and binary search w.r.t. time and space complexity? 11. What is selection technique, explain selection by sorting with example program?12. Explain partition based selection algorithm, with example program? 13 . How to find the Kth smallest element in sorted order and do their comparitive analysis? #Unit 3 (QB) 1. Discuss diff. Techniques of Algo. Design techniques? 2.what is Greedy technique Explain the concept of Greedy techniques State its advantages and disadvantages? 3) Application of Greedy techniques?A)explain the concept of divide and concure state its advantages and disadvantages ? 5) Explain the application of divide and concur strategies 1. Merge sort 2.strassens matrix . 6) Explain the concept of dynamic programming state its advantages and disadvantages (application) 7) Explain application of w.r.t fibonaxy series , Factorial of number, longest common subsequence? 8)Explai_ the concept of Backtracking prog, advantages and disadvantages (application, Nth Queen problem) 9) Explain the application of back tracking prog. Like N written queen problem?