Vidyalelo
Data Structure · Q885

Miscellaneous on Data Structures

Programming · Data Structure · question 885

Q885

Given below is the pseudocode of the vertex cover problem. Which of the following best suits the blank? Vertex_Cover(G = (V, E)) A = while (E!=0) pick any edge (u, v) from E add u and v to A ________________ return A

A.
remove every edge incident on either u or v
Answer
B.
add every edge incident on u
C.
delete the vertex
D.
delete adjacent edge

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board