2 marks(i & ii)
Download as DOCX, PDF0 likes11 views
The document contains questions about algorithms and data structures including: writing the recursive Fibonacci algorithm; deriving the complexity of binary search; properties of Big-oh notation; deriving the worst case analysis of Merge Sort; analyzing the asymptotic order of a recursive function; defining convex hull; sorting numbers using Merge Sort; discussing the divide and conquer technique; differentiating exhaustive search and divide and conquer; and briefly explaining time and space complexity.
1 of 1
Download to read offline
2 marks(i & ii)
- 1. 1.Write the recursive Fibonacci algorithm and its recursive relation? 2.Derive the complexity of binary search algorithm. 3.Write down the properties of Big-oh notation. 4. Derive the worst case analysis of Merge Sort 5. Suppose W satisfies the following recurrence equation and base case (where c is a constant) : W(n) = c.n + W(n/2) and W(1) = 1. What is the asymptotic order of W(n). 6. Define convex hull. 7. Sort the following using mergesort 310, 285, 179, 652, 351, 423, 861, 254 8. Discuss briefly about divide and conquer technique. 9. Differentiate Exhaustive search and divide and conquer technique 10. Briefly explain time complexity and space complexity