Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.


Please wait...

  Take Quiz (Monsoon) Beta Version !!
  Do You have Qs. in your Mind ??? Ask it as Qs. or MCQs or create it as polling Live Now !!

Data Structures :: Graphs

Home > Data Structures > Graphs > General Questions

1 / 12

 Which of the following is an invalid path for the following graph?

comvolt-written-graph-1

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Commvault

2 / 12

 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?

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

3 / 12

 A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

4 / 12

 The maximum degree of any vertex in a simple graph with n vertices is

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

5 / 12

 A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

7 / 12

 For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

8 / 12

 An adjacency matrix representation of a graph cannot contain information of :

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

9 / 12

 In Breadth First Search of Graph, which of the following data structure is used?

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Capgemini

10 / 12

 For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!