- Computer Science Engineering (CSE)
- Data Structures (DS)
- If every node u in G is adjacent to ever...

Q. |
## If every node u in G is adjacent to every other node v in G, A graph is said to be _______. |

A. | isolate. |

B. | complete. |

C. | finite. |

D. | Strongly connected. |

Answer» B. complete. |

View all MCQs in:
Data Structures (DS)

- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- A linked list whose last node points back to the list node instead of containing the null pointer________.
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
- _______________is a header list where the last node points back to the header node.
- In a directed tree any node which has out degree 0 is called a terminal node or__________.
- A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
- To insert a new node in linked list free node will be available in ___________.
- A ______________ list is a header list where the node points back to the header node.
- ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.

Login to Continue

It will take less than 2 minutes

Report MCQ