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.

Data Structures :: Graphs

Home > Data Structures > Graphs > General Questions

1. Which of the following is an invalid path for the following graph?comvolt-written-graph-1

Answer: C D A C B A

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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?

Answer: O(e+n)

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: more than n(n-1)/2

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: n-1

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: greater than n-1

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

6. Let A be an adjacency matrix of a graph G. The ij entry in the matrix A^k , gives

Answer: Shortest path of K edges from vertex Vi to vertex Vj.

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: 2e

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: parallel edges

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: Queue.

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!

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

Answer: 2e

Explanation:

Here is no explanation for this answer

Workspace

Tags:

No Tags on this question yet!