- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- How many of the following statements are...

Q. |
## How many of the following statements are correct? |

A. | All cyclic graphs are complete graphs. |

B. | All complete graphs are cyclic graphs. |

C. | All paths are bipartite. |

D. | All cyclic graphs are bipartite. |

Answer» B. All complete graphs are cyclic graphs. |

View all MCQs in:
Data Structures (DS)

- Which of the following statements for a simple graph is correct?
- For the given graph(G), which of the following statements is true?
- For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
- Which of the following is a correct way to declare a multidimensional array in Java?
- How many common operations are performed in a binary tree?
- How many types of insertion are performed in a binary tree?
- How many bits would a succinct binary tree occupy?
- How many orders of traversal are applicable to a binary tree (In General)? 3
- Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
- With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

Login to Continue

It will take less than 2 minutes

Report MCQ