CSC 313 Data Structure ain 3 Pall 2016 22. 0p) Given a C. einlo) D.?(nn lign) 23

Question

CSC 313 Data Structure ain 3 Pall 2016 22. 0p) Given a C. einlo) D.?(nn lign) 23. 3pts) Given a graph G- (V. E) with VI- n and lE]-m the complexity of initialization) i DES tomitting B.6(71) C Bllogm) D. ellog n) I foreach uEVdo 4 end s end Figure 3: Code used in question 24 24 3pts) Given a graph shown in Figure 3 is -(V.E) with |VI -n and LE-m the complexity of the code A. 13. ?(n) C. e(log m) D, e(log n) 25. (3pts) Given the graph in Figure 4. When four iterations of Kruskal's algorithm are finished how many edges are added to the MST? A. 1 B. 2 D. 4 Page 6

Explanation / Answer

Answers:------------

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.