McqMate

Q. |
## Which of the following statements for a simple graph is correct? |

A. | Every path is a trail |

B. | Every trail is a path |

C. | Every trail is a path as well as every path is a trail |

D. | Path and trail have no relation |

Answer» A. Every path is a trail |

612

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)No comments yet

- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- Which of the following properties does a simple graph not hold?
- A graph is a tree if and only if graph is
- 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?
- For the given graph(G), which of the following statements is true?
- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
- Which of the following graph traversals closely imitates level order traversal of a binary tree?
- For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
- Which of the following ways can be used to represent a graph?
- Which of the following is useful in traversing a given graph by Breath first search?