Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightA

A

  • Q. A
  • 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. The graphs G1 and G2 with their incidences matrices given are Isomorphic.

    e1 e2 e3 e4 e5 e6
    v1 1 0 0 0 0 0
    v2 1 1 0 0 0 1
    v3 0 1 1 0 1 0
    v4 0 0 1 1 0 0
    v5 0 0 0 1 1 1



    e1 e2 e3 e4 e5 e6
    v1 0 0 1 0 0 0
    v2 1 0 1 0 1 0
    v3 1 1 0 1 0 0
    v4 0 1 0 0 0 1
    v5 0 0 0 1 1 1
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. To create an adjacency list C++
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. In which of the following does a Directed Acyclic Word Graph finds its application in?
  • filter_dramaExplanation
    Answer is : A
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points