Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Write Prim's Algorithm.
Ans: Prim's algorithm to find out a minimum spanning tree from a weighted graph in step by step form is given below.
Let G = (V, E) be graph and S = (VS, ES) be the spanning tree to be found from G.
Step 1: Choose a vertex v1 of V and initialize
VS = {v1} and
ES
= {}
Step 2: Choose a nearest neighbor of vi from V that is adjacent to some vj∈VS and that edge (vi, vj) does not form a cycle with members edge of ES. Set
VS = VS ∪{vi} and
ES = ES ∪{(vi, vj)}
Step 3: Again Repeat step2 until |Es| = |V| - 1.
smart mind
If a triangular sail has a horizontal length of 30 ft and a vertical height of 83 ft , Determine the area of the sail? a. 1,245 ft 2 b. 1,155 ft 2 c. 201 ft 2 d. 2,4
what is principle of marketing?
1/cos(x-a)cos(x-b)
(8-)
Fermat Catalan Conjecture
Chain Rule : Assume that we have two functions f(x) & g(x) and they both are differentiable. 1. If we define F ( x ) = ( f o g ) ( x ) then the derivative of F(x) is,
1. Use mathematical induction to prove whenever n is a positive integer. 2. Use loop invariant to prove that the program for computing the sum of 1,...,n is correct.
1/sec A+tan A =1-sin A /cos A
at what price 6.25% rs 100 share be quoted when the money is worth 5%
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd