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.
A 20-foot light post shows a shadow 25 feet long. At the similar time, a building nearby casts a shadow 50 feet long. determine the height of building? a. 40 ft b. 62.5 ft
at what price a 6.25%rs 100 share be quoted when the money is worth 5%
find the integral dx/1-x
660 ft/min=________ft/sec
how to do a bar graph
Question 1: (a) Show that, for all sets A, B and C, (i) (A ∩ B) c = A c ∩B c . (ii) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C). (iii) A - (B ∪ C) = (A - B) ∩ (A - C).
lbl 2 lcl 2 sin 2 θ
how to do mathematical proofs
Derive the probability distribution of the completion times: a. The following probability distributions relate to the completion times, in weeks, T A and T B of two independ
Marks obtained by 70 students are given below: M arks 20 70 50 60 75 90 40 No.
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