Self Studies
Self Studies
Self Studies
Self Studies

Algorithms Test...

TIME LEFT -
  • Question 1
    1 / -0

    Which of the following statements are TRUE?

    I. In a depth-first search of an undirected graph G, every edge of G is either a tree edge or a back edge.

    II. Forward and cross edges never occur in a depth-first search of an undirected graph.

    III. A directed graph is acyclic if and only if a depth-first search yields no back edges.

  • Question 2
    1 / -0

    Consider a graph G(V, E) where V is the vertices and E is the edge which is marked as tree edges in the depth-first traversal of a graph G. If V is 10 and E is 6 then the number of connected components in G is _____.

Submit Test
Self Studies
User
Question Analysis

  • Answered - 0

  • Unanswered - 2

  • 1
  • 2
Submit Test
Selfstudy
Selfstudy
Self Studies Get latest Exam Updates
& Study Material Alerts!
No, Thanks
Self Studies
Click on Allow to receive notifications
Allow Notification
Self Studies
Self Studies Self Studies
To enable notifications follow this 2 steps:
  • First Click on Secure Icon Self Studies
  • Second click on the toggle icon
Allow Notification
Get latest Exam Updates & FREE Study Material Alerts!
Self Studies ×
Open Now