- Computer Science Engineering (CSE)
- Data Structure (DS)
- A graph is said to be ……………… if the vert...

Q. |
## 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 |

Answer» B. bipartite |

View all MCQs in:
Data Structure (DS)

- The number of edges in a complete graph of n vertices is
- A ……….. is a graph that has weights of costs associated with its edges.
- A graph in which all vertices have equal degree is known as ____
- A graph is a tree if and only if graph is
- A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
- A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
- Which data structure is used in breadth first search of a graph to hold nodes?
- A vertex of in-degree zero in a directed graph is called a/an
- A list which displays the relationship of adjacency between elements is said to be
- What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

Login to Continue

It will take less than 2 minutes

Report MCQ