This action might not be possible to undo. Are you sure you want to continue?
DESIGN AND ANALYSIS OF ALGORITHMS Time: 3 hours
Max. Marks: 60 Answer any five questions All questions carry equal marks ---
1.a) b) 2.a) b) 3.a) b) 4.a) b) 5. 6.a) b) 7.a) b) 8.
What is meant by time complexity and space complexity? Discuss its importance. Explain the Heap sort with an example. Explain the merge sort. Perform the quick sort to sort the following numbers. 20 40 50 15 10 05 80 90. Discuss about job sequencing with deadlines. What is meant by minimum spanning tree? Discuss how to achieve it? Explain in detail the floor shop scheduling. Discuss the 0/1 knapsack problem. Explain the breadth first search and traversal with a suitable example. Explain the Hamiltonian cycles with a suitable example. What is meant by graph coloring? Discuss its uses. Discuss about LC search. Discuss about non-deterministic algorithms. Write short notes on the following a) Cooks theorem b) Travelling sales man problem c) NP- complete. $$$