Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightA connected graph T without any cycles is called

A connected graph T without any cycles is called

  • Q. A connected graph T without any cycles is called
  • filter_dramaExplanation
    Answer is : D
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. A
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is ?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. Given the following adjacency matrix of a graph(G) determine the number of components in the G. [0 1 1 0 0 0], [1 0 1 0 0 0], [1 1 0 0 0 0], [0 0 0 0 1 0], [0 0 0 1 0 0], [0 0 0 0 0 0].
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. A connected graph T without any cycles is called
  • filter_dramaExplanation
    Answer is : D
    None.
  • 5. What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?
  • filter_dramaExplanation
    Answer is : C
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points