 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.

 11. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. a. Partite b. Bipartite c. Rooted d. Bisects

 12. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. a. vertices, edges b. edges, vertices c. vertices, paths d. graph node, edges

 13. A ……….. is a graph that has weights of costs associated with its edges. a. Network b. Weighted graph c. Both A and B d. None of the above

 14. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1. a. Directed tree b. Undirected tree c. Dis-joint tree d. Direction oriented tree

 15. In a graph if e=[u, v], Then u and v are called a. endpoints of e b. adjacent nodes c. neighbors d. all of above

 16. A connected graph T without any cycles is called a. a tree graph b. free tree c. a tree d. All of above

 17. In a graph if e=(u, v) means a. u is adjacent to v but v is not adjacent to u b. e begins at u and ends at v c. u is processor and v is successor d. both b and c