Apply quick sort algorithm to sort the list E,X,A,M,P,L,E in alphabetical order. Draw tree of recursive calls made Answer:- The Quick Sort algorithm works by choosing a pivot element and partitioning the array such that all elements less than the…
Sort the following keyword A,L,G,O,R,I,T,H,M by applying Quicksort method Answer:- Sort the right sub-subarray: The keywords are now sorted in alphabetical order using the Quick Sort method:
Design an algorithm for performing quick sorting. Apply the same to solve the following set of numbers: 5 3 1 9 8 2 4 7 Answer:- Apply the Quick sort to solve the following set of numbers: 5 3 1…
Design an algorithm for performing merge sort. Analyze its time efficiency; apply the same to sort the following number. 4 9 0 -1 6 8 9 2 3 12 Answer:- Algorithm: Merge Sort Apply the same to sort the following…
Explain the divide and conquer technique with a general algorithm Answer:- Divide and Conquer is one of the best-known general algorithm design technique. It worksaccording to the following general plan: A typical case with k=2 is diagrammatically shown below. Control…
21CS42 – Design and Analysis of Algorithm – DAA Solved Previous year question papers – PYQ’s MODULE – 1 1) What is an algorithm? Explain the criteria/properties to be satisfied by the algorithm 2) 3) Explain the algorithm design and analysis…
Sort the given list of number using Heap sort. Answer:-
Define heap. Write bottom-up construction algorithm. Construct heap for the list 1,8,6,5,3,7 using bottom-up algorithm and successive key insertion method Answer:- A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Algorithm: HeapBottomUp(H[n..1])
Solve the below instance of single source shortest path problem with vertex “a” as the source Answer:-
Obtain a minimum cost-spanning tree for the graph below using Prim’s algorithm Answer:-
