Apply the DFS based algorithm to solve the topological sorting problem for the following Graph. (2...

  

Transcribed Image Text:

Apply the DFS based algorithm to solve the topological sorting problem for the following Graph. (2 Mark) Q2. Apply Merge sort and Quick to sort the list, X,W,A,D,B,C,H,G,E in alphabetical Order. (2 Mark) Q3. Explain Master Theorem. Using Master Theorem solved the following recurrence. (2 Mark) 32T(8n/4)+ n relation a) T(n) b) T(n) 12T(6n/48) + 3n Q4. Write the pseudocode for the divide and Conquer algorithm for finding the position of the element in an array of n numbers ans estimate the number of key comparision made by the the algorithm. Q5. Solve the following equations using Gaussian Elimination Method: 8x: +6x2+3x=-60 -3x1-7x2+8x=100 -6x1-8x2+2x3 100 (2 Marks) (2 Mark) Apply the DFS based algorithm to solve the topological sorting problem for the following Graph. (2 Mark) Q2. Apply Merge sort and Quick to sort the list, X,W,A,D,B,C,H,G,E in alphabetical Order. (2 Mark) Q3. Explain Master Theorem. Using Master Theorem solved the following recurrence. (2 Mark) 32T(8n/4)+ n relation a) T(n) b) T(n) 12T(6n/48) + 3n Q4. Write the pseudocode for the divide and Conquer algorithm for finding the position of the element in an array of n numbers ans estimate the number of key comparision made by the the algorithm. Q5. Solve the following equations using Gaussian Elimination Method: 8x: +6x2+3x=-60 -3x1-7x2+8x=100 -6x1-8x2+2x3 100 (2 Marks) (2 Mark)