Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightDesign and Analysis of Algorithmschevron_rightWhich method of traversal does not use stack to hold nodes that are wa...

Which method of traversal does not use stack to hold nodes that are wa...

  • Q. Which method of traversal does not use stack to hold nodes that are waiting to be processed?
  • filter_dramaExplanation
    Answer is : C
    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. Incidence matrix and Adjacency matrix of a graph will always have same dimensions?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. Breadth first search
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. Minimum number of spanning tree in a connected graph is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. What is the number of edges present in a complete graph having n vertices?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. Given Adjacency matrices determine which of them are PseudoGraphs?
    i) {{1,0} {0,1}}

    ii) {{0,1}{1,0}}

    iii) {{0,0,1}{0,1,0}{1,0,0}}
  • filter_dramaExplanation
    Answer is : C
    None.

Design and Analysis of AlgorithmsTopics

  • folder Design and Analysis of Algorithms Basics

    Total MCQS : 76

    grade
  • logoutView
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points