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.
if ab=25 . a(5,x)and b(2,5) . find x.
Mod(Z-25i) Sol) mod (Z-25i) means Z lies in the circumference of the circle with (0,25) at its centre and radius less then 15. so difference in the max and min value of arg Z is
Sketch the graph of the below function. f ( x ) = - x 5 + (5/2 )x 4 + (40/3) x 3 + 5 Solution : Whenever we sketch a graph it's good to have a few points on the graph to
A box is 30 cm long, 8 cm wide and 12 cm high. Determine the length of the diagonal AB ? Round to the nearest tenth. a. 34.5 cm b. 32.1 cm c. 35.2 cm d. 33.3 cm
f(x)=sin x+cos x in the interval {0,90}
Finding derivatives
Given f ( x ) = 3x - 2 determine f -1 ( x ) . Solution Now, already we know what the inverse to this function is as already we've done some work with it. Though, it
Equivalent or Equal sets Two sets C and D are said to be equal whether every member of set C belongs to D and every member of set D belongs also to C.
I really need help with 30 60 90 right triangles and my last tutor did not make sense to me so can you please help
What was last years salary if after a 3% increase the salary is 35,020?
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