7) (5 points). Consider two sets S1 and S2. How many relations are there from Si

Question

7) (5 points). Consider two sets S1 and S2. How many relations are there from Si to 52? 8) (5 points). How many 1-1 mappings are there from a set of size 4 to a set of size 8? 9) (5 points). How many 1-1 mappings are there from a set of size 4 to a set of size 4? 10) (5 points). How many 1-1 mappings are there from a set of size 8 to a set of size 4? 11) (20 points = 2 * 10 points). List in order the edges added when performing Prim's algorithm for Minimum Spanning Tree (MST) and then Kruskal's algorithm for MST.

Explanation / Answer

7) No. of relations from S1 to S2 = 2n(S1) x n(S2)

no. of 1-1 mappings from a set containing m elements to a set containing n elements= nm

8) 84 = 4096

9)44 = 256

10) 48 = 65536

11)Prims algo

let root node = 2

order of adding the edges(Prims): 2-3 3-0 0-1 3-6 6-5 6-4

order of adding the edges(Kruskals algo): 5-6 0-3 2-3 0-1 3-6 6-4

if my answer is correct,,,, pls rate...

Related Questions

Navigate

• Browse (All)
• Browse 7
• Subjects

---

---

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