Test 2 Algorithms | Computer Science

Time: 00:00:00

Attempted

Not Attempted

Marked For Review

Attempted & Reviewed

Question 1 of 20

Let T be a depth first search tree in an undirected graph G. Vertices u and n are leaves of this tree T.

The degrees of both u and n in G are at least 2. Which one of the following statements is true?

Select Your Answer:

There must exist a vertex w adjacent to both u and n in G.

There must exist a vertex w whose removal disconnects u and n in G.

There must exist a cycle in G containing u and n.

There must exist a cycle in G containing u and all its neighbours in G.

Mark for Review

Attempted

Not Attempted

Marked for Review

Attempted & Reviewed

Current