(Regulation 2017) Fourth Semester: Register Number: .
(Regulation 2017) Fourth Semester: Register Number: .
PAGE 1 OF 2
Case Complexity.
(OR)
b) Explain in detail about Travelling Salesman Problem using exhaustive search (13) CO2 [K2]
(OR)
b) Write algorithm to find closest pair of points using divide and conquer and (13) CO2 [K2]
explain it with example. Derive the worst case and average case time
complexity.
14. a) What is Convex hull problem? Explain the brute force approach to solve (13) CO2 [K2]
convex-hull with an example. Derive time complexity.
(OR)
b) construct the heap sort for the following nodes 5,16,22,45,10,18,30,50,12,1 (13) CO2 [K2]
15. a) Explain in detail about Binary search tree with one example (13) CO3 [K2]
(OR)
b) Given coins of denomination 2,4 and 5 with amount to be pay is 7. Find (13) CO3 [K2]
optimal number of coins and sequence of coin used to pay given amount
using dynamic method
Answer any ONE Questions
PART C (1x15=15 marks)
16. a) Explain in detail about warshall and Floyd's algorithm with one example. (15) CO3 [K2]
************
Please indicate knowledge level (K1toK6) and Course Outcome level (CO1 to CO5)
against each question for each subdivision.
PAGE 2 OF 2