 A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

 31. For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is a. ne b. 2n c. 2e d. e^n

 32. A complete graph can have ............... a. n^2 spanning trees b. n^(n-2) spanning trees c. n^(n+1) spanning trees d. n^n spanning trees

 33. Graph traversal is different from a tree traversal, because: a. trees are not connected b. graphs may have loops c. trees have root d. None of these

 34. The number of edges in a simple, n-vertex, complete graph is a. n*(n-2) b. n*(n-1) c. n*(n-1)/2 d. n*(n-1)*(n-2)

 36. The spanning tree of connected graph with 10 vertices contains .............. a. 9 edges b. 11 edges c. 10 edges d. 9 vertices

 37. If locality is a concern, you can use ................ to traverse the graph. a. Breadth First Search b. Depth First Search c. Either BFS or DFS d. None of these