DQuestion 26 5 pts Suppose a graph consists of a ring with 10 vertices and nine

Question

DQuestion 26 5 pts Suppose a graph consists of a ring with 10 vertices and nine edges. Which will take more storage space? Representing the edges as an adjacency matrix or as a list of edges? C matrix D list Question 27 5 pts If every node in a balanced (the longest path from root to leaf and shortest path from root to leaf differ by at most 1) binary tree has two children except the leaf (terminal) nodes, and the longest path in the graph from the root to a leaf has 3 edges, how many nodes are there in the graph? o 15 O 16

Explanation / Answer

Q26

It will take more space when it is represented as matrix as it will be 10*10 units whereas in the other case it will be 10+9

Q27

There will be 8 nodes as 1 root + 2 +4 +1(leaf)

Q28

It will be proportional to n

Q29

True as all the vertices should be covered

Q30

No BFS doesn't have backtracking

Q31

A U B will have{1,2,3,4,5,6} -{6} will result in {1,2,3,4,5}

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

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