Find Big Oh, Theta and Omega Complexity of following Functions
a) f(x) = x^3+2y^2+x^2y^2+6x
b) f(x) = x^6+x^2-x^8+5x^2
c) f(x) = -1
d) f(n) = 14 n^3+8
What is the Difference Between
a) Divide & conquer and Greedy Method
b) Merge and Quick Sort
c) Linear and Binary Searchkavi
Find C = A x B by using Strassen's Matrix Multiplication
A={{4,2,0,1},{3,1,2,5},{3,2,1,4},{5,2,6,7}}
B={{2,1,3,2},{5,4,2,3},{1,4,0,2},{3,2,4,1}}
Apply Merge Sort on
20,35,18,8,14,41,3,33
Apply Quick Sort on
L={19,28,17,2,12,4,35,7,16,10}
Bonus Question
Minimum spanning forest. Develop versions of Prim's and Kruskal's algorithms that compute the minimum spanning forest of an edge-weighted graph that is not necessarily connected.
a) f(x) = x^3+2y^2+x^2y^2+6x
b) f(x) = x^6+x^2-x^8+5x^2
c) f(x) = -1
d) f(n) = 14 n^3+8
What is the Difference Between
a) Divide & conquer and Greedy Method
b) Merge and Quick Sort
c) Linear and Binary Searchkavi
Find C = A x B by using Strassen's Matrix Multiplication
A={{4,2,0,1},{3,1,2,5},{3,2,1,4},{5,2,6,7}}
B={{2,1,3,2},{5,4,2,3},{1,4,0,2},{3,2,4,1}}
Apply Merge Sort on
20,35,18,8,14,41,3,33
Apply Quick Sort on
L={19,28,17,2,12,4,35,7,16,10}
Bonus Question
Minimum spanning forest. Develop versions of Prim's and Kruskal's algorithms that compute the minimum spanning forest of an edge-weighted graph that is not necessarily connected.
No comments:
Post a Comment