πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!

  • google app store apple app store
  • βœ–

      Question

      A directed acyclic graph (DAG) has 10 vertices and 15

      edges. What is the maximum possible number of topological orderings?
      A 1 Correct Answer Incorrect Answer
      B 10 Correct Answer Incorrect Answer
      C 10! Correct Answer Incorrect Answer
      D 15! Correct Answer Incorrect Answer
      E Depends on edge constraints Correct Answer Incorrect Answer

      Solution

      Number of valid orders depends on partial ordering defined by edges; only fully disconnected graph yields 10! possibilities.

      Practice Next
      More Algorithms Questions
      ask-question