Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn a Binary Decision Diagrams 0 values by a _________ line and the 1 v...

In a Binary Decision Diagrams 0 values by a _________ line and the 1 v...

  • Q. In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.
  • 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. What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored in form of adjacency list and binary heap is used ?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. If locality is a concern, you can use ................ to traverse the graph.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 3. Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. A connected graph T without any cycles is called
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points