Ques1Defineanalgorithm.docVIP

Ques 1: What is an algorithm. Ans: An algorithm is a procedure used to solve a well defined computational problem. Ques 2: Give the complexity in terms of Big O notation for the following algorithmic equations ? (a) 5.n^2 – 6n + 2 (b)6.2^n + 6 Ans. (a) O(n^2) (b) O(2^n) Ques 3. Arrange the following in increasing order of time complexity ? O(1) , O(2^n) , O(n^2), O(nlogn), O(n^3), O(n), O(logn) Ans. O(1) O(logn) O(n) O(nlogn) O(n^2) O(n^3) O(2^n) Ques 4. What do you understand by term O in Big O notation ? Ans. O(g(n)) = {f(n) : there exists positive constants c , n0 such that 0 = f(n)= cg(n) for all n} Ques 5. Show that the solution of T(n)=T(n/2) + 1 is O(lg n). Ans. Using the iteration method, we substitute the function recursively till we arrive at T(1).i.e T(n)=T(n/2) + 1 = T(n/4) + 1 + 1 = ....We get a total of lg(n) iterationsi.e T(n)=T(1) +lg(n)Thus the complexity is O(lg n). Ques6. Show that the solution to T(n)=2*T((n/2)+17) is O(n*(lg n)). Ans. Using the iteration method, it takes lg(n) iterations to reach T(1).After final iteration:T(n)=(2^lg(n))*(T(1) + lg(n)*17)Thus the complexity is (2^lg(n))*(lg n) = O(n*lg(n)) Ques7. Solve the recurrence T(n)=2*T(sqrt(n)) + 1. Ans. Let n=2^m,then T(2^m)=2*T(2^m/2) + 1Now let S(m)=T(2^m).=S(m)=2*S(m/2) +1This is the same as 2nd problem.Thus the complexity is O(m*lg(m)),but m=lg(n)Thus the final complexity is O(lg(n)*lg(lg(n))) Ques 8: Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? Ans: No. Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesnt mean that the distance between any two nodes involved in the minimum-spanning tree is minimum. Ques 9: What is the difference between BFS and DFS? Ans : BFS: This can be throught of as being like Dijkstras algorithm for shortest paths, but with every edg