Home /
Expert Answers /
Computer Science /
q1-find-the-topological-sorting-problem-for-the-given-graph-a-and-b-using-dfs-method-2-mark-pa955

Q1. Find the topological sorting problem for the given graph A and B using DFS Method. ( 2 Mark ) Q2. Apply Merge sort and Quick to sort the list, I,N,D,O,N,E,S,I,A in alphabetical order. (2 Mark ) Q3. Explain Master Theorem .Using Master Theorem solved the following recurrence. (2 Mark) relation i)

`T(n)=6T(2(n)/(19))+n^(2)`

j)

`T(n)=24T(3(n)/(72))+n^(2)`

Q4. Write the Recursive algorithm for Quick Sort.Consruct the recurrence relation for recursive algorithm and solve using backward Subtution. (2 Mark) Q5. Solve the following equations using Gaussian Elimination Method: (2 Mark)

```
-5x_(1)-3x_(2)+6x_(3)=10
7x_(1)+6x_(2)-7x_(3)=-23
2x_(1)-4x_(2)-3x_(3)=-20
```